Optimal algorithms for scheduling divisible workloads on heterogeneous systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages 14-28

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

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Asymptotical optimality; Divisible tasks; Multi round algorithms; Scheduling

Indexed keywords

SCHEDULING;

ABSOLUTE PERFORMANCE; ASYMPTOTICALLY OPTIMAL; DIVISIBLE TASKS; DIVISIBLE WORKLOAD; EXTENSIVE SIMULATIONS; HETEROGENEOUS SYSTEMS; OPTIMALITY; RESOURCE SELECTION;

GENETIC ALGORITHMS;

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

References (24)

1. D. Altilar and Y. Paker. An optimal scheduling algorithm for parallel video processing. In IEEE Int. Conference on Multimedia Computing and Systems. IEEE Computer Society Press, 1998.
2. D. Altilar and Y. Paker. Optimal scheduling algorithms for communication constrained parallel processing. In Euro-Par 2002, LNCS 2400, pages 197-206. Springer Verlag, 2002.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer, Berlin, Germany, 1999.
4. S. Bataineh, T. Hsiung, and T. G. Robertazzi. Closed form solutions for bus and tree networks of processors load sharing a divisible job. IEEE Transactions on computers, 43(10):1184-1196, Oct. 1994.
5. 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. Extended version available as LIP Research Report 2001-25.
6. V. Bharadwaj, D. Ghose, V. Mani, and T. Robertazzi. Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, 1996.
7. J. Blazewicz, M. Drozdowski, and M. Markiewicz. Divisible task scheduling-concept and verification. Parallel Computing, 25:87-98, 1999.
8. H. Casanova. Simgrid: A toolkit for the simulation of application scheduling. In Proceedings of the IEEE Symposium on Cluster Computing and the Grid (CCGrid' 01). IEEE Computer Society, May 2001.
9. H. Casanova and F. Berman. Grid'2002. In F. Berman, G. Fox, and T. Hey, editors, Parameter sweeps on the grid with APST. Wiley, 2002.
10. B. W. Char, K. O. Geddes, G. H. Gonnet, M. B. Monagan, and S. M. Watt. Maple Reference Manual, 1988.
11. S. Charcranoon, T. Robertazzi, and S. Luryi. Optimizing computing costs using divisible load analysis. IEEE Transactions on computers, 49(9):987-991, Sept. 2000.
12. P. Chrétienne, E. G. C. Jr. , J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.
13. D. E. Culler and J. P. Singh. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, San Francisco, CA, 1999.
14. M. Drozdowski. Selected problems of scheduling tasks in multiprocessor computing systems. PhD thesis, Instytut Informatyki Politechnika Poznanska, Poznan, 1997.
15. H. El-Rewini, T. G. Lewis, and H. H. Ali. Task scheduling in parallel and distributed systems. Prentice Hall, 1994.
16. M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NPCompleteness. W. H. Freeman and Company, 1991.
17. T. Hagerup. Allocating independent tasks to parallel processors: An experimental study. J. Parallel and Distributed Computing, 47(2):185-197, 1997.
18. S. F. Hummel, E. Schonberg, and L. Flynn. Factoring: A method for scheduling parallel loops. Communications of the ACM, 35(8):90-101, 1992.
19. C. Lee and M. Hamdi. Parallel image processing applications on a network of workstations. Parallel Computing, 21:137-160, 1995.
20. J. Lerouge and A. Legrand. Towards realistic scheduling simulation of distributed applications. Technical Report 2002-28, LIP, ENS Lyon, France, July 2002.
21. A. L. Rosenberg. Sharing partitionable workloads in heterogeneous NOWs: greedier is not better. In D. S. Katz, T. Sterling, M. Baker, L. Bergman, M. Paprzycki, and R. Buyya, editors, Cluster Computing 2001, pages 124-131. IEEE Computer Society Press, 2001.
22. J. Sohn, T. Robertazzi, and S. Luryi. Optimizing computing costs using divisible load analysis. IEEE Transactions on parallel and distributed systems, 9(3):225-234, Mar. 1998.
23. R. Wang, A. Krishnamurthy, R. Martin, T. Anderson, and D. Culler. Modeling communication pipeline latency. In Measurement and Modeling of Computer Systems (SIGMETRICS'98), pages 22-32. ACM Press, 1998.
24. Y. Yang and H. Casanova. Multi-round algorithm for scheduling divisible workload applications: Analysis and experimental evaluation. Technical Report CS2002-0721, Dept. of Computer Science and Engineering, University of California, San Diego, 2002.