Compiler support for task scheduling in hierarchical execution models

Journal of Systems Architecture

Volumn 45, Issue 6-7, 1999, Pages 483-503

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

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; SCHEDULING;

HIERARCHICAL EXECUTION MODEL; REALISTIC PARALLEL RUNTIMES;

ALGORITHMS;

EID: 0032662049     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(98)00019-8     Document Type: Article

References (40)

1. A. Alexandrov, M. Ionescu, K.E. Schauser, C. Scheiman, LogGP: Incorporating long messages into the LogP model one step closer towards a realistic model for parallel computation, Technical Report TRCS95-09, University of California at Santa Barbara, 1995.
2. P. Banerjee, J. Chandy, M. Gupta, E. Hodge, J. Holmes, A. Lain, D. Palermo, S. Ramaswamy, E. Su, The Paradigm Compiler for Distributed Memory Multicomputers, IEEE Computer, 1995.
3. K. Belkhale, P. Banerjee, Approximate scheduling algorithms for the partitionable independent task scheduling problem, in: Proceedings of the 1990 International Conference of Parallel Processing, 1990, pp. 72-75.
4. S. Chakrabarti, J. Demmel, K. Yelick, Modeling the benefits of mixed data and task parallelism, in: Symposium on Parallel Algorithms and Architecture (SPAA), 1995, pp. 74-83.
5. D.E. Culler, R. Karp, A. Sahay, K.E. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, in: Proceedings of the Fourth Symposium on Principles and Practice of Parallel Programming, vol. 28, no. 4, 1993, pp. 1-12.
6. J. Darlington, A.J. Field, P.G. Harrison, P.H.J. Kelly, D.W.N. Sharp, Q. Wu, R.L. While, Parallel programming using skeleton functions, in: Proceedings of the PARLE'93, volume 694 of LNCS, Munich, Germany, June 1993, pp. 146-160.
7. P. Deuflhard, Recent progress in extrapolation methods for ordinary differential equations, SIAM Review 27 (1985) 505-535.
8. M.A. Driscoll, W.R. Daasch, Accurate predictions of parallel program execution time, Journal of Parallel and Distributed Computing 25 (1) (1995) 16-30.
9. J. Du, J. Leung, Complexity of scheduling parallel task systems, SIAM Journal on Computing, 1989.
10. A. Feldmann, J. Sgall, T. Shang-Hua, Dynamic scheduling on parallel machines, in: Foundations of Computer Science, 1991, pp. 111-120.
11. I. Foster, K.M. Chandy, Fortran M: A language for modular parallel programming, Journal of Parallel and Distributed Computing, 1995.
12. I. Foster, M. Xu, B. Avalani, A. Choudhary, A compilation system that integrates high performance Fortran and Fortran M, in: Proceedings of the 1994 Scalable High Performance Computing Conference, IEEE Computer Society Press, 1994.
13. T.L. Freeman, C. Phillips. Parallel Numerical Algorithms, Prentice-Hall, New York, 1992.
14. R. Graham, Bounds on multiprocessor timing anomalies, SIAM Journal on Appl. Math., 1969.
15. E. Hairer, G. Wanner, Solving Ordinary Differential Equations II, Springer, Berlin, 1991.
16. P. Hanrahan, D. Salzman, L. Aupperle, A rapid hierarchical radiosity algorithm, Computer Graphics 25 (4) (1991); Proceedings of SIGGRAPH '91.
17. R.N. Ibbett, G. Chochia, P.S. Coe, M.I. Cole, P.E. Heywood, T. Heywood, R.J. Pooley, P. Thanisch, N.P. Topham, Algorithms, architectures and models of computation, Technical Report ECS-CSG-22-96, University of Edinburgh, 1996.
18. W.F. McColl. Universal computing, in: Proceedings of EuroPar'96, Springer LNCS 1123, 1996, pp. 25-36.
19. P.K. McKinley, Y. Tsai, Collective communication in wormhole-routed massively parallel computers, IEEE Computer 28 (12) (1995) 39-50.
20. M.G. Norman, P. Thanisch, Models of machines and computation for mapping in multicomputers, ACM Computing Surveys 25 (3) (1993) 263-302.
21. S. Ramaswamy, Simultaneous exploitation of task and data parallelism in regular scientific applications, Ph.D. Thesis, University of Illinois at Urbana, Champaign, 1996.
22. S. Ramaswamy, S. Sapatnekar, P. Banerjee, A framework for exploiting data and functional parallelism on distributed-memory multicomputers, Technical Report CRHC-94-10, University of Illinois, 1994.
23. T. Rauber, G. Rünger, Parallel solution of a Schrödinger-Poisson system, in: International Conference on High-Performance Computing and Networking, Springer LNCS 919, 1995, pp. 697-702.
24. T. Rauber, G. Rünger, Comparing task and data parallel execution schemes for the DIIRK method, in: Proceedings of the EuroPar'96, Springer LNCS 1124, 1996, pp. 52-61.
25. T. Rauber, G. Rünger, Deriving structured parallel implementations for numerical methods, The Euromicro Journal 41 (1996) 589-608.
26. T. Rauber, G. Rünger, Parallel iterated Runge-Kutta methods and applications, International Journal of Supercomputer Applications 10 (1) (1996) 62-90.
27. T. Rauber, G. Rünger, The compiler TwoL for the design of parallel implementations, in: Proceedings of the Fourth International Conference on Parallel Architectures and Compilation Techniques, Boston, MA, 1996, pp. 292-301.
28. T. Rauber, G. Rünger, Load balancing schemes for extrapolation methods, Concurrency: Practice and Experience 9 (3) (1997) 181-202.
29. T. Rauber, G. Rünger, R. Wilhelm, Deriving optimal data distributions for group parallel numerical algorithms, in: Conference on Massively Parallel Programming Models, Berlin, Germany, 1995, pp. 33-41.
30. J. Rose, LocusRoute: A parallel global router for standard cells, in: Twenty-fifth ACM/IEEE Design Automation Conference, 1988, pp. 189-195.
31. J. Rose, Parallel global routing for standard cells, IEEE Transaction on Computer Aided Design 9 (10) (1990).
32. S.K. Sahni, Algorithms for scheduling independent tasks, Journal of the ACM 23 (1) (1976) 116-127.
33. J. Stoer, R. Bulirsch, Introduction to Numerical Analysis, Springer, New York, 1990.
34. J. Subhlok, Automatic mapping of task and data parallel programs for efficient execution on multiprocessors, Technical Report CMU-CS-93-212, Carnegie Mellon University, 1993.
35. J. Turek, W. Ludwig, J. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, Ph. Yu, Scheduling prallelizable tasks to minimize average response time, in: Proceedings of SPAA'94, 1994, pp. 200-209.
36. J. Turek, J.L. Wolf, Ph.S. Yu, Approximate algorithms for scheduling parallelizable tasks, in: Proceedings of SPAA'92, 1992, pp. 323-332.
37. L.G. Valiant, A bridging model for parallel computation, Communications of the ACM 33 (8) (1990) 103-111.
38. P.J. van der Houwen, B.P. Sommeijer, Parallel iteration of high-order Runge-Kutta methods with stepsize control, Journal of Computational and Applied Mathematics 29 (1990) 111-127.
39. P.J. van der Houwen, B.P. Sommeijer, W. Couzy, Embedded diagonally implicit Runge-Kutta algorithms on parallel computers, Mathematics of Computation 58 (197) (1992) 135-159.
40. S.C. Woo, M. Ohara, E. Torrie, J.P. Singh, A. Gupta, The SPLASH-2 programs: Characterization and methodological considerations, in: Proceedings of the 22nd Annual International Symposium on Computer Architecture, 1995, pp. 24-36.