A low-cost approach towards mixed task and data parallel scheduling

Proceedings of the International Conference on Parallel Processing

Volumn 2001-January, Issue , 2001, Pages 69-76

  Redulescu A ^a   Van Gemund, A J C ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Clustering algorithms; Computer applications; Concurrent computing; Costs; Measurement; Parallel processing; Parallel programming; Performance loss; Processor scheduling; Workstations

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER PROGRAMMING; COMPUTER WORKSTATIONS; COSTS; MEASUREMENTS; PARALLEL PROGRAMMING; SCHEDULING;

CLUSTER OF WORKSTATIONS; COMPUTATIONAL APPLICATIONS; CONCURRENT COMPUTING; MATRIX MULTIPLICATION; PARALLEL PROCESSING; PERFORMANCE LOSS; PERFORMANCE MEASUREMENTS; PROCESSOR SCHEDULING;

MATRIX ALGEBRA;

EID: 84951146624     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2001.952048     Document Type: Conference Paper

References (30)

1. A. Aiken and A. Nicolau. Optimal loop parallelization. In PLDI, 1998.
2. S. Ben Hassen, H. E. Bal, and C. J. Jacobs. A task and data parallel programming language based on shared objects. ACM Trans. on Programming Languages and Systems, 20(6):1131-1170, Nov. 1998.
3. R. A. Bhoedjang, T. Ruhl, R. Hofman, K. G. Langendoen, H. E. Bal, and M. F. Kaashoek. Panda: A portable platform to support parallel programming languages. In SEDMS IV, 1993.
4. S. Chakrabarti, J. Demmel, and K. Yelick. Models and scheduling algorithms for mixed data and task parallel programs. J. of Parallel and Distributed Computing, 9:168-184, 1997.
5. A. Darte and Y. Robert. Constructive methods for scheduling uniform loop nests. IEEE Trans. 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. I. T. Foster and K. M. Chandy. Fortran M: A language for modular parallel programming. J. 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. J. 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. G. Golub and C. F. van Loan. Matrix computations. Baltimore: Johns Hopkins University Press, 1996.
11. S. Koziełand Z. Michalewicz. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 7(1):19-44, 1991.
12. Y.-K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. J. of Parallel and Distributed Computing, 59:381-422, 1999.
13. M. Lam. Software pipelining: An effective scheduling technique for VLIW machines. In PLDI, 1988.
14. K. K. Parhi and D. G. Messerschmitt. Static rate-optimal scheduling of iterative dataflow programs via optimum unfolding. IEEE Trans. on Computers, 40(2):178-195, 1991.
15. C. D. Polychronopoulos. Parallel Programming and Compilers. Kluwer Academic, 1988.
16. G. Prasanna, A. Agarwal, and B. R. Musicus. Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory. IEEE Trans. on Parallel and Distributed Systems, 5(7):720-736, July 1994.
17. S. Ramaswamy, S. Sapatnekar, and P. Banerjee. A framework for exploiting task and data parallelism on distributed memory multicomputers. IEEE Trans. on Parallel and Distributed Systems, 8(11):1098-1115, Nov. 1997.
18. B. R. Rau. Iterative modulo scheduling. Int'l J. of Parallel Programming, 24(1):3-64, 1996.
19. T. Rauber and G. Rünger. Compiler support for task scheduling in hierarchical execution models. J. of Systems Architecture, 45:483-503, 1998.
20. A. Rədulescu, C. Nicolescu, A. J. C. van Gemund, and P. P. Jonker. CPR: Mixed task and data parallel scheduling for distributed systems. In IPDPS, 2001. Best Paper Award.
21. A. Rədulescu and A. J. C. van Gemund. FLB: Fast load balancing for distributed-memory machines. In ICPP, 1999.
22. A. Rədulescu and A. J. C. van Gemund. On the complexity of list scheduling algorithms for distributed-memory systems. In ICS, 1999.
23. V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. MIT Press, 1989.
24. J. Subhlok, J. M. Stichnoth, D. R. O'Hallaron, and T. Gross. Exploiting task and data parallelism on a multicomputer. In PPoPP, 1993.
25. J. Subhlok and G. Vondran. Optimal use of mixed task and data parallelism for pipelined computations. J. of Parallel and Distributed Computing, 60:297-319, 2000.
26. J. Subhlok and B. Yang. A new model for integrated nested task and data parallel programming. In PPoPP, 1997.
27. J. Turek, J. L. Wolf, and P. S. Yu. Approximate algorithms for scheduling parallelizable tasks. In SPAA, 1992.
28. M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, 1995.
29. M.-Y. Wu and D. D. Gajski. Hypertool: A programming aid for message-passing systems. IEEE Trans. on Parallel and Distributed Systems, 1(7):330-343, July 1990.
30. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. on Parallel and Distributed Systems, 5(9):951-967, Dec. 1994.