Why Not Use a Pattern-based Parallel Programming System

• Author(s) / Creator(s)

  • Schaeffer, Jonathan
  • Szafron, Duane
  • Tan, Kai
  • Anvik, John

• Technical report TR03-13. Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of the program, since new issues must be addressed for a concurrent application. Parallel programming environments provide a way for users to reap the benefits of concurrent programming while reducing the effort required to create them. The COPS parallel programming system is one such tool which uses a pattern-based approach to create a parallel program. Using the Cowichan Problems, this paper demonstrates that the COPS system contains a sufficient number of parallel patterns to implement a wide variety of applications. This characteristic is called the utility of a system. Code metrics and performance results are presented for the various applications to show the usability of the COPS system and its ability to reduce programming effort, while producing programs with reasonable performance. Finally, the extensibility of COPS is illustrated by describing how a new pattern, called the Search-Tree pattern, was added to COPS in order to solve two of the Cowichan Problems. | TRID-ID TR03-13

• Date created

  2003

• Subjects / Keywords

  • Parallel Programming
  • Design Patterns

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3M32NC4Z

• License

  Attribution 3.0 International