The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2004  
         
  Article:   UNBOUNDED AND BOUNDED PARALLELISM IN BMF. CASE-STUDY: RANK SORTING.

Authors:  VIRGINIA NICULESCU.
 
       
         
  Abstract:  BMF is a formalism that allows us to design parallel programs independently of the target architecture, and to transform the programs into more eficient programs using equational reasoning. We show in this paper that even the abstractness of BMF is very high, bounded and unbounded parallelism can be expressed in this model, and also that BMF allows us to transform a program into different variants, each of them being more appro- priate for a specific architecture type. We consider the case-study of rank sorting, for which we construct first a general unbounded parallel program. Then, we transform the program for bounded parallelism, by imposing a limited number of processors. Three variants are obtained. The implementa- tions of the programs onto shared memory, distributed memory, and pipeline architectures are analyzed, too.  
         
     
         
         
      Back to previous page