On-line scheduling of MPI-2 programs with hierarchical work stealing

Proceedings - Symposium on Computer Architecture and High Performance Computing

Volumn , Issue , 2007, Pages 247-254

  Pezzi, Guilherme P ^a   Cera, Márcia C ^a   Mathias, Elton ^a   Maillard, Nicolas ^a   Navaux, Philippe O A ^a  

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER ARCHITECTURE; COMPUTER SCIENCE; COMPUTER SYSTEMS; COMPUTERS; HIGH PERFORMANCE LIQUID CHROMATOGRAPHY; MESSAGE PASSING; PARALLEL ALGORITHMS; SCHEDULING; STANDARDS;

CLASSICAL SOLUTIONS; DE FACTO STANDARDS; HETEROGENEOUS RESOURCES; HIGH EFFICIENCY; HIGH PERFORMANCE COMPUTING (HIPC); HIGHLY EFFICIENT; INTERNATIONAL SYMPOSIUM; LOAD BALANCING; MPI (MESSAGE PASSING INTERFACE ); PARALLEL PROGRAMS; RUN TIME; SYNTHETIC APPLICATIONS; WORK STEALING;

COMPUTER CRIME;

EID: 47249163692     PISSN: 15506533     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SBAC-PAD.2007.32     Document Type: Conference Paper

References (18)

1. R. Blumofe and et al. Cilk: An efficient multithreaded runtime system. In PDOPP'05, pages 207-216, 1995.
2. R. D. Blumofe and C. E. Leiserson. Space-efficient scheduling of multithreaded computations. SIAM Journal on Computing, 27(1):202-229, 1998.
3. M. C. Cera, G. P. Pezzi, E. N. Mathias, N. Maillard, and P. O. A. Navaux. Improving the Dynamic Creation of Processes in MPI-2. In LNCS - 13th European PVMMPI Users Group Meeting, volume 4192/2006, pages 247-255, Bonn, Germany, Set. 2006.
4. T. H. Cormen, C. E. Leiserson, and R. L. R. ans Clifford Stein. Introduction to Algorithms. The MIT Press, second edition, 2001.
5. D. Dailey and C. E. Leiserson. Using Cilk to write multiprocessor chess programs. The Journal of the International Computer Chess Association, 2002.
6. J. Dongarra, I. Foster, G. Fox, W. Gropp, K. Kennedy, L. Torczon, and A. White. Sourcebook of Parallel Computing. Morgan Kaufmann, first edition, 2003.
7. I. Foster. Designing and Building Parallel Programs. Addison-Wesley, 1994.
8. W. Gropp, E. Lusk, and A. Skjellum. Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, Cambridge, Massachusetts, USA, oct 1994.
9. W. Gropp, E. Lusk, and R. Thakur. Using MPI-2 Advanced Features of the Message-Passing Interface. The MIT Press, Cambridge, Massachusetts, USA, 1999.
10. C. Huang, O. Lawlor, and L. V. Kalé. Adaptive MPI. In Proceedings of the 16th International Workshop on Languages and Compilers for Parallel Computing (LCPC 2003), LNCS 2958, pages 306-322, College Station, Texas, October 2003.
11. J. Jaja. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
12. L. Kalé and S. Krishnan. CHARM++: A Portable Concurrent Object Oriented System Based on C++. In A. Paepcke, editor, Proceedings of OOPSLA'93, pages 91-108. ACM Press, September 1993.
13. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, chapter 17, pages 871-941. Elsevier Science Publishers, 1990.
14. V. Kumar. Algorithms for constraint-satisfaction problems: A survey. AIMagazine, 13(1):32-44, 1992.
15. M. Snir and et al. MPI: the Complete Reference vol. 1 and 2. The MIT Press, 1998.
16. R. V. van Nieuwpoort, T. Kielmann, and H. E. Bal. Satin: Efficient Parallel Divide-and-Conquer in Java. In Euro-Par 2000 Parallel Processing, number 1900 in LNCS, pages 690-699, Munich, Germany, aug 2000. Springer.
17. R. V. van Nieuwpoort, J. Maassen, R. Hofman, T. Kielmann, and H. E. Bal. Satin: Simple and efficient java-based grid programming. In AGridM 2003 Workshop on Adaptive Grid Middleware, New Orleans, Louisiana, USA, 2003.
18. R. V. van Nieuwpoort, J. Maassen, G. Wrzesinska, T. Kielmann, and H. E. Bal. Adaptive load balancing for divide-and-conquer grid applications. J. of Supercomputing, 2006.