Library support for hierarchical multi-processor tasks

Proceedings of the International Conference on Supercomputing

Volumn 2002-November, Issue , 2002, Pages

  Rauber, Thomas ^a   Rünger, Gudula ^b  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Distributed memory; Hierarchical decomposition of processor sets; Library support; Mixed task and data parallelism; Multilevel group SPMD; Multiprocessor tasks

Indexed keywords

PARALLEL PROCESSING SYSTEMS;

DISTRIBUTED MEMORY; DISTRIBUTED MEMORY MACHINES; GROUP STRUCTURE; HIERARCHICAL DECOMPOSITION OF PROCESSOR SETS; LIBRARY SUPPORT; MIXED TASK AND DATA PARALLELISM; MODULAR PROGRAMMING; MULTILEVEL GROUP SPMD; MULTIPROCESSOR TASKS; PARALLEL EXECUTIONS;

MEMORY ARCHITECTURE;

EID: 84944094500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2002.10064     Document Type: Conference Paper

References (23)

1. S.B. Baden and S.J. Fink. A Programming Methodology for Dual-Tier Multicomputers. IEEE Transactions on Software Engineering, 26(3):212-226, 2000.
2. H. Bal and M. Haines. Approaches for Integrating Task and Data Parallelism. IEEE Concurrency, 6(3):74-84, July-August 1998.
3. C.J. Beckmann and C. Polychronopoulos. Microarchitecture Support for Dynamic Scheduling of Acyclic Task Graphs. Technical Report CSRD Report 1207, University of Illinois, 1992.
4. S. Chakrabarti, J. Demmel, and Yelick K. Modeling the benefits of mixed data and task parallelism. In Symposium on Parallel Algorithms and Architecture (SPAA), pages 74-83, 1995.
5. F. Darema, D. A. George, V. A. Norton, and G. F. Pfister. A single-program-multiple-data computational mode for EPEX/FORTRAN. Parallel Comput., 7(1):11-24, 1988.
6. S.J. Fink. A Programming Model for Block-Structured Scientific Calculations on SMP Clusters. PhD thesis, University of California, San Diego, 1998.
7. I. Foster and K.M. Chandy. Fortran M: A Language for Modular Parallel Programming. Journal of Parallel and Distributed Computing, 25(1):24-35, April 1995.
8. I. Foster, M. Xu, B. Avalani, and A. Choudhary. A Compilation System That Integrates High Performance Fortran and Fortran M. In Proceedings 1994 Scalable High Performance Computing Conference, pages 293-300. IEEE Computer Society Press, 1994.
9. E. Hairer, S.P. Nørsett, and G. Wanner. Solving Ordinary Differential Equations I: Nonstiff Problems. Springer-Verlag, Berlin, 1993.
10. M. Hill, W. McColl, and D. Skillicorn. Questions and Answers about BSP. Scientific Programming, 6(3):249-274, 1997.
11. P. Joisha and P. Banerjee. PARADIGM (version 2.0): A New HPF Compilation System. In Proc. 1999 International Parallel Processing Symposium (IPPS'99), 1999.
12. C.W. Keßler. NestStep: Nested Parallelism and Virtual Shared Memory for the BSP model. The Journal of Supercomputing, 17:245-262, 2001.
13. S.R. Kohn and S.B. Baden. Irregular Coarse-Grain Data Parallelism under LPARX. Scientific Programming, 5:185-201, 1995.
14. M. Kühnemann, T. Rauber, and G. Rünger. Performance Modelling for Task-Parallel Programs. In Proc. of the Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), pages 148-154, San Antonio, USA, 2002.
15. S. Ramaswamy. Simultaneous Exploitation of Task and Data Parallelism in Regular Scientific Applications. PhD thesis, University of Illinois at Urbana-Champaign, 1996.
16. T. Rauber, R. Reilein, and G. Rünger. ORT - A Communication Library for Orthogonal Processor Groups. In Proc. of the Supercomputing 2001, Denver, USA, 2001. IEEE Press.
17. T. Rauber and G. Rünger. Load Balancing Schemes for Extrapolation Methods. Concurrency: Practice and Experience, 9(3):181-202, 1997.
18. T. Rauber and G. Rünger. Diagonal-Implicitly Iterated Runge-Kutta Methods on Distributed Memory Machines. Int. Journal of High Speed Computing, 10(2):185-207, 1999.
19. D. Skillicorn and D. Talia. Models and languages for parallel computation. ACM Computing Surveys, 30(2):123-169, 1998.
20. J. Subhlok and B. Yang. A New Model for Integrating Nested Task and Data Parallel Programming. In 8th ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming, pages 1-12, 1997.
21. P.J. van der Houwen, B.P. Sommeijer, and W. Couzy. Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers. Mathematics of Computation, 58(197):135-159, January 1992.
22. Z. Xu and K. Hwang. Early Prediction of MPP Performance: SP2, T3D and Paragon Experiences. Parallel Computing, 22:917-942, 1996.
23. G. Zhang, B. Carpenter, G.Fox, X. Li, and Y. Wen. A high level SPMD programming model: HPspmd and its Java language binding. Technical report, NPAC at Syracuse University, 1998.