Scheduling divisible workloads on heterogeneous platforms under bounded multi-port model

IPDPS Miami 2008 - Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, Program and CD-ROM

Volumn , Issue , 2008, Pages

  Beaumont, Olivier ^a   Bonichon, Nicolas ^a   Eyraud Dubois, Lionel ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Bounded multi port model; Divisible tasks; One round algorithms; Scheduling

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER NETWORKS; DISTRIBUTED PARAMETER NETWORKS; INFORMATION THEORY; NUCLEAR PROPULSION; PORTS AND HARBORS;

BOUNDED MULTI-PORT MODEL; DIVISIBLE TASKS; ONE-ROUND ALGORITHMS; PARALLEL AND DISTRIBUTED PROCESSING; SCHEDULING;

DATA PROCESSING;

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

References (17)

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. O. Beaumont, H. Casanova, A. Legrand, Y. Robert, and Y. Yang. Scheduling divisible loads on star and tree networks: results and open problems. IEEE Transactions on Parallel and Distributed Systems, 16(3):207-218, 2005.
5. V. Bharadwaj, D. Ghose, V. Mani, and T. Robertazzi. Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, 1996.
6. J. Blazewicz, M. Drozdowski, and M. Markiewicz. Divisible task scheduling - concept and verification. Parallel Computing, 25:87-98, 1999.
7. P. Chrétienne, E. G. C. Jr., J. K. Lenstra, and Z. Liu, editors. Scheduling Theory and its Applications. John Wiley and Sons, 1995.
8. M. Drozdowski. Selected problems of scheduling tasks in multiprocessor computing systems. PhD thesis, Instytut Informatyki Politechnika Poznanska, Poznan, 1997.
9. H. El-Rewini, T. G. Lewis, and H. H. Ali. Task scheduling in parallel and distributed systems. Prentice Hall, 1994.
10. M. R. Garey and D. S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1991.
11. B. Hong and V. Prasanna. Distributed adaptive task allocation in heterogeneous computing environments to maximize throughput. International Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International, 2004.
12. B. Hubert et al. Linux Advanced Routing & Traffic Control. http://lartc.org/lartc.pdf, 2002.
13. C. Lee and M. Hamdi. Parallel image processing applications on a network of workstations. Parallel Computing, 21:137-160, 1995.
14. A. Legrand, Y. Yang, and H. Casanova. Np-completeness of the divisible load scheduling problem on heterogeneous star platforms with affine costs. Research Report CS2005-0818, GRAIL Project, University of California at San Diego, march, 2005.
15. 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.
16. 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.
17. Y. Yang, H. Casanova, M. Drozdowski, M. Lawenda, and A. Legrand. On the complexity of multi-round divisible load scheduling. Research report RR-6096, INRIA, 2007.