Load Balancing of Irregular Parallel Divide-and-Conquer Algorithms in Group-SPMD Programming Environments

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-81, Issue , 2006, Pages 313-322

  Eriksson, Mattias ^a   Kessler, Christoph ^a   Chalabine, Mikhail ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS;

DIVIDE-AND-CONQUER ALGORITHM; DYNAMIC GROUPS; LOAD-BALANCING; LOCAL LOADS; LOCAL STRATEGIES; NESTED PARALLELISM; PARALLEL ENVIRONMENT; PROGRAMMING ENVIRONMENT; QUICKSORT; SPLITTINGS;

DYNAMIC PROGRAMMING;

EID: 85186516187     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Albert Alexandrov, Mihai F. Ionescu, Klaus E. Schauser, and Chris Scheiman. LogGP: Incorporating Long Messages into the LogP Model. Journal of parallel and distributed computing, vol 44, n r l, pp. 71-79, 1997.
2. T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
3. David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice Santos, Ramesh Subramonian, and Thorsten von Eicken. LogP: Towards a Realistic Model of Parallel Computation. Principles and Practice of Parallel Programming, pp. 1-12, 1993.
4. Mattias Eriksson. Load Balancing of Irregular Parallel Divide-and-Conquer Algorithms in Group-SPMD Programming Environments. Master's Thesis, PELAB, Linköpings Universitet, Oct. 2005.
5. William Gropp and Ewing Lusk and Anthony Skjellum. Using MPI - 2nd Edition. Portable Parallel Programming with the Message Passing Interface. MIT Press, 1999.
6. Jonathan C. Hardwick. An efficient Implementation of Nested Data Parallelism for Irregular Divide-and-Conquer Algorithms. In First International Workshop on High-Level Programming Models and Supportive Environments, pp. 105-114, April 1996.
7. Christoph A. Herrmann and Christian Lengauer. Parallelisation of Divide-and-Conquer by Translation to Nested Loops. Journal of Functional Programming 9(3):279-310, May 1999.
8. C. A. R. Hoare. Quicksort. The Computer Journal 5(1): 10-16, 1962.
9. Jörg Keller, Christoph W. Kessler and Jesper Larsson Träff. Practical PRAM Programming. Wiley-Interscience, 2001.
10. Christoph W. Kessler. NestStep: Nested Parallelism and Virtual Shared Memory for the BSP Model. The Journal of Supercomputing 17:245-262, Kluwer Academic Publishers, 2000.
11. Hui Li and Kenneth C. Sevcik. Parallel Sorting by Overpartitioning. In Proc. 6th annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'94), pp. 46-56, 1994.
12. Thomas Rauber and Gudula Rünger. Tlib — A Library to Support Programming with Hierarchical Multi-Processor Tasks. Journal ofParallel andDistr. Computing, 65(3):347-360, 2005.
13. Peter Sanders and Thomas Hansen. On the Efficient Implementation of Massively Parallel Quicksort. Worksh. on Par. Algorithms for Irregularly Structured Problems, pp. 13-24, 1997.