Synthesizing a Parallel Sorting Algorithms based on Design Patterns

Title in English: 
Synthesizing a Parallel Sorting Algorithms based on Design Patterns
Abstract in English: 
Design Patterns have proven valuable in the creation of flexible and reusable object-oriented designs. In recent years there has been much interest in this topic and several catalogues of design patterns have been created. However, the issue of the application of a design pattern to an existing program has not received much attention. Applying a design pattern to a program may involve a large amount of code restructuring and extension. This paper refactors a traditional and important problem of sorting data based on design patterns and parallelism. This refactoring process passes through three stages: Setting Common Ontology, Partitioning using Divide and Conquer, and Building using Design Patterns.