Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogeneous platforms

Proceedings - ISPDC 2004: Third International Symposium on Parallel and Distributed Computing/HeteroPar '04: Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Hete

Volumn , Issue , 2004, Pages 296-302

  Beaumont, O ^a   Legrand, A ^b   Marchai, L ^b   Robert, Y ^b  

^a CNRS   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PARALLELISM; SCHEDULING ALGORITHM; STEADY-STATE SCHEDULING; UNDIRECTED GRAPHS;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LINEAR PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; ROUTERS; SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 19644398316     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPDC.2004.12     Document Type: Conference Paper

References (28)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, Berlin, Germany, 1999.
2. C. Banino, O. Beaumont, A. Legrand, and Y. Robert. Scheduling strategies for master-slave tasking on heterogeneous processor grids. In PARA'02: International Conference on Applied Parallel Computing, LNCS 2367, pages 423-432. Springer Verlag, 2002.
3. O. Beaumont, V. Boudet, and Y. Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In HCW'2002, the 11th Heterogeneous Computing Workshop. IEEE Computer Society Press, 2002.
4. O. Beaumont, L. Carter, J. Ferrante, A. Legrand, and Y. Robert. Bandwidth-centric allocation of independent tasks on heterogeneous platforms. In International Parallel and Distributed Processing Symposium (IPDPS'2002). IEEE Computer Society Press, 2002.
5. O. Beaumont, A. Legrand, L. Marchai, and Y. Robert. Assessing the impact and limits of steady-state scheduling for mixed task and data parallelism on heterogenous platforms. Research Report RR-2004-20, LIP, ENS Lyon, France, April 2004. Available at http://www.ens-lyon.fr/LIP/.
6. O. Beaumont, A. Legrand, L. Marchai, and Y. Robert. Complexity results and heuristics for pipelined multicast operations on heterogeneous platforms. Research Report RR-2004-07, LIP, ENS Lyon, France, January 2004.
7. O. Beaumont, A. Legrand, L. Marchai, and Y. Robert. Pipelining broadcasts on heterogeneous platforms. In International Parallel and Distributed Processing Symposium IPDPS'2004. IEEE Computer Society Press, 2004.
8. D. Bertsimas and D. Gamarnik. Asymptotically optimal algorithm for job shop scheduling and packet routing. Journal of Algorithms, 33(2):296-318, 1999.
9. Michael D. Beynon, Tahsin Kurc, Alan Sussman, and Joel Saltz. Optimizing execution of component-based applications using group instances. Future Generation Computer Systems, 18(4):435-448, 2002.
10. P. B. Bhat, V. K. Prasanna, and C. S. Raghavendra. Efficient collective communication in distributed heterogeneous systems. In 19th IEEE International Conference on Distributed Computing Systems (ICDCS'99). IEEE Computer Society Press, 1999.
11. T. D. Braun, H. J. Siegel, and N. Beck. Optimal use of mixed task and data parallelism for pipelined computations. J. Parallel and Distributed Computing, 61:810-837, 2001.
12. J.-I. Hatta and S. Shibusawa. Scheduling algorithms for efficient gather operations in distributed heterogeneous systems. In 2000 International Conference on Parallel Processing (ICPP'2000). IEEE Computer Society Press, 2000.
13. E. Heymann, M. A. Senar, E. Luque, and M. Livny. Adaptive scheduling for master-worker applications on the computational grid. In R. Buyya and M. Baker, editors, Grid Computing -GRID 2000, pages 214-227. Springer-Verlag LNCS 1971, 2000.
14. L. Hollermann, T. S. Hsu, D. R. Lopez, and K. Vertanen. Scheduling problems in a practical allocation model. J. Combinatorial Optimization, 1(2):129-149, 1997.
15. B. Hong and V.K. Prasanna. Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput. In Proceedings of the 32th International Conference on Parallel Processing (ICPP'2003). IEEE Computer Society Press, 2003.
16. T. S. Hsu, J. C. Lee, D. R. Lopez, and W. A. Royce. Task allocation on a network of processors. IEEE Trans. Computers, 49(12):1339-1353, 2000.
17. S. L. Johnsson and C.-T. Ho. Optimum broadcasting and personalized communication in hypercubes. IEEE Trans. Computers, 38(9):1249-1268, 1989.
18. D. W. Krumme, G. Cybenko, and K. N. Venkataraman. Gossiping in minimal time. SIAM J. Computing, 21:111-139, 1992.
19. R. Libeskind-Hadas, J. R. K, Hartline, P. Boothe, G. Rae, and J. Swisher. On multicast algorithms for heterogeneous networks of workstations. Journal of Parallel and Distributed Computing, 61(11):1665-1679, 2001.
20. M. Maheswaran and H. J. Siegel. A dynamic matching and scheduling algorithm for heterogeneous computing systems. In Seventh Heterogeneous Computing Workshop. IEEE Computer Society Press, 1998.
21. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986.
22. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency, volume 24 of Algorithms and Combinatorics. Springer-Verlag, 2003.
23. G. Shao. Adaptive scheduling of master/worker applications on distributed computational resources. PhD thesis, Dept. of Computer Science, University Of California at San Diego, 2001.
24. B. A. Shirazi, A. R. Hurson, and K. M. Kavi. Scheduling and load balancing in parallel and distributed systems. IEEE Computer Science Press, 1995.
25. O. Sinnen and L. Sousa. Comparison of contention-aware list scheduling heuristics for cluster computing. In T. M. Pinkston, editor, Workshop for Scheduling and Resource Management for Cluster Computing (ICPP'01), pages 382-387. IEEE Computer Society Press, 2001.
26. M. Spencer, R. Ferreira, M. Beynon, T. Kurc, U. Catalyurek, A. Sussman, and J. Saltz. Executing multiple pipelined data analysis operations in the grid. In 2008 ACM/IEEE Supercomputing Conference. ACM Press, 2002.
27. K. Taura and A. A. Chien. A heuristic algorithm for mapping communicating tasks on heterogeneous resources. In Heterogeneous Computing Workshop, pages 102-115. IEEE Computer Society Press, 2000.
28. H. Topcuoglu, S. Hariri, and M.-Y. Wu. Task scheduling algorithms for heterogeneous processors. In Eighth Heterogeneous Computing Workshop. IEEE Computer Society Press, 1999.