CPR: Mixed task and data parallel scheduling for distributed systems

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Radulescu A ^a   Nicolescu, C ^a   Van Gemund, A J C ^a   Jonker, P P ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; SCHEDULING ALGORITHMS;

CLUSTER OF WORKSTATIONS; COMPUTATIONAL APPLICATIONS; DEPENDENCE GRAPHS; DISTRIBUTED SYSTEMS; MATRIX MULTIPLICATION; PERFORMANCE MEASUREMENTS; REAL APPLICATIONS; TASK PARALLELISM;

MATRIX ALGEBRA;

EID: 84981186499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924977     Document Type: Conference Paper

References (19)

1. A. Aiken and A. Nicolau. Optimal loop parallelization. In Proceedings, ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 308-317, June 1988.
2. S. Ben Hassen, H. E. Bal, and C. J. Jacobs. A task and data parallel programming language based on shared objects. ACM Transactions on Programming Languages and Systems, 20(6):1131-1170, Nov. 1998.
3. R. Bhoedjang, T. Ruhl, R. Hofman, K. Langendoen, H. Bal, and M. Kaashoek. Panda: A portable platform to support parallel programming languages. In Proceedings, USENIX Symposium on Experiences with Distributed and Multiprocessor Systems, pages 213- 226, Sept. 1993.
4. S. Chakrabarti, J. Demmel, and K. Yelick. Models and scheduling algorithms for mixed data and task parallel programs. Journal of Parallel and Distributed Computing, 9:168-184, 1997.
5. A. Darte and Y. Robert. Constructive methods for scheduling uniform loop nests. IEEE Transactions on Parallel and Distributed Systems, 5(8):814-822, 1994.
6. L. Finta, Z. Liu, I. Milis, and E. Bampis. Scheduling UET-UCT series-parallel graphs on two processors. Theoretical Computer Science, 162:323-340, Aug. 1996.
7. T. I. Foster and K. M. Chandy. Fortran M: A language for modular parallel programming. Journal of Parallel and Distributed Computing, 26:24-35, 1995.
8. C. Fu and T. Yang. Run-time techniques for exploiting irregular task parallelism on distributed memory architectures. Journal of Parallel and Distributed Computing, 42(2):143-156, May 1997.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP- Completeness. W. H. Freeman and Co., 1979.
10. P. E. Gill, W. Murray, and M. A. Saunders. User's guide for SNOPT 5.3: A Fortran package for largescale nonlinear programming. Technical Report SOL-98-1, Stanford University, 1997.
11. G. Golub and C. F. van Loan. Matrix computations. Baltimore: Johns Hopkins University Press, 1996.
12. R. L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(2):416-429, Mar. 1969.
13. Y.-K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59:381-422, 1999.
14. M. Lam. Software pipelining: An effective scheduling technique for VLIW machines. In Proceedings, ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 318-328, June 1988.
15. K. Parhi and D. Messerschmitt. Static rate-optimal scheduling of iterative dataflow programs via optimum unfolding. IEEE Transactions on Computers, 40(2):178-195, 1991.
16. C. D. Polychronopoulos. Parallel Programming and Compilers. Kluwer Academic, 1988.
17. G. Prasanna, A. Agarwal, and B. R. Musicus. Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory. IEEE Transactions on Parallel and Distributed Systems, 5(7):720-736, July 1994.
18. S. Ramaswamy, S. Sapatnekar, and P. Banerjee. A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Transactions on Parallel and Distributed Systems, 8(11):1098-1115, Nov. 1997.
19. B. R. Rau. Iterative modulo scheduling. International Journal of Parallel Programming, 24(1):3-64, 1996.