On the design of clustering-based scheduling algorithms for realistic machine models

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

Volumn , Issue , 2001, Pages

  Boeres, C ^a   Rebello, V E F ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DESIGN; DIRECTED GRAPHS; HEURISTIC METHODS; SCHEDULING; SCHEDULING ALGORITHMS;

DELAY MODELING; DESIGN METHODOLOGY; DIRECTED ACYCLIC GRAPH (DAG); FULLY CONNECTED NETWORKS; MACHINE MODELS; REALISTIC MODEL; SCHEDULING HEURISTICS; TASK REPLICATIONS;

CLUSTERING ALGORITHMS;

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

References (25)

1. F. Anger, J.-J. Hwang, and Y.-C. Chow. Scheduling with sufficient loosely coupled processors. Journal of Parallel and Distributed Computing, 9:87-92, 1990.
2. C. Boeres. Versatile Communication Cost Modelling for Multicomputer Task Scheduling Heuristics. PhD thesis, Department of Computer Science, University of Edinburgh, May 1997.
3. C. Boeres, G. Chochia, and P. Thanisch. On the scope of applicability of the ETF algorithm. In A. Ferreira and J. Rolim, editors, The 2nd International Workshop on Parallel Algorithms for Irregularly Structured Problems (IR- REGULAR'95), LNCS 980, pages 159-164, Lyon, France, September 1995. Springer.
4. C. Boeres, A. P. Nascimento, and V. E. F. Rebello. Cluster-based task scheduling for LogP model. International Journal of Foundations of Computer Science, 10(4):405-424, 1999.
5. C. Boeres and V. Rebello. Versatile task scheduling of binary trees for realistic machines. In C. Lengauer, M. Griebl, and S. Gorlatch, editors, The Proceedings of the Third International Euro-Par Conference on Parallel Processing (Euro-Par'97), LNCS 1300, pages 913-921, Passau, Germany, August 1997. Springer-Verlag.
6. C. Boeres, V. Rebello, and D. Skillicorn. Static scheduling using task replication for LogP and BSP models. In D. Pritchard and J. Reeve, editors, The Proceedings of the 4th International Euro-Par Conference on Parallel Processing (Euro-Par'98), LNCS 1470, pages 337-346, Southampton, UK, September 1998. Springer.
7. C. Boeres and V. E. F. Rebello. A versatile cost modelling approach for multicomputer task scheduling. Parallel Computing, 25(1):63-86, 1999.
8. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, USA, May 1993.
9. A. Gerasoulis and T. Yang. A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. Journal of Parallel and Distributed Computing, 16:276-291, 1992.
10. A. Gerasoulis and T. Yang. List scheduling with and without communication. Parallel Computing, 19:1321-1344, 1993.
11. T. Kalinowski, I. Kort, and D. Trystram. List scheduling of general task graphs under LogP. Parallel Computing, 26(9):1109-1128, 2000.
12. S. Kim and J. Browne. A general approach to mapping of parallel computations upon multiprocessor architectures. In Proceedings of the 3rd International Conference on Parallel Processing, pages 1-8, 1988.
13. I. Kort and D. Trystram. Scheduling fork graphs under LogP with an unbounded number of processors. In D. Pritchard and J. Reeve, editors, The Proceedings of the 4th International Euro-Par Conference on Parallel Processing (Euro-Par'98), LNCS 1470, pages 940-943, Southampton, UK, September 1998. Springer.
14. Y. K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating tasks graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5):506-521, May 1996.
15. Y.-K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59(3):381-422, Dec. 1999.
16. Y.-K. Kwok and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4), Dec. 1999.
17. W. Lowe and W. Zimmermann. Scheduling balanced taskgraphs to LogP-machines. Parallel Computing, 26(9):1083-1108, 2000.
18. R. Martin, A. Vahdat, D. Culler, and T. Anderson. Effects of communication latency, overhead, and bandwidth in a cluster architecture. In Proceedings of the 24th Annual International Symposium on Computer Architecture, pages 85-97, June 1997.
19. A. Nascimento. Aglomeração de tarefas em arquiteturas paralelas com memória distribuída. Master's thesis, Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil, 1999. (In Portuguese).
20. G. C. Nunes. Minimizando processadores em escalonamentos LogP. Master's thesis, Instituto de Computação, Universidade Federal Fluminense, Niterói, RJ, Brazil, 2001. (In Portuguese).
21. M. Palis, J.-C. Liou, and D. Wei. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems, 7(1):46-55, January 1996.
22. C. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput., 19:322-328, 1990.
23. A. Tam and C. Wang. Realistic communication model for parallel computing on cluster. In The Proceedings of the First IEEE International Workshop on Cluster Computing, pages 92-101, Melbourne, Australia, December 1999. IEEE Computer Society Press.
24. T. Yang and A. Gerasoulis. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Transactions on Parallel and Distributed Systems, 5(9):951-967, 1994.
25. W. Zimmermann, M. Middendorf, and W. Lowe. On optimal k-linear scheduling of tree-like task graph on LogP-machines. In D. Pritchard and J. Reeve, editors, The Proceedings of the 4th International Euro-Par Conference on Parallel Processing (Euro-Par'98), LNCS 1470, pages 328-336, Southampton, UK, September 1998. Springer.