Abstract
While the problem of scheduling weighted arbitrary DAGs under the delay model has been studied extensively, comparatively little work exists for this problem under a more realistic model such as LogP. This paper investigates the similarities and differences between task clustering algorithms for the delay and LogP models. The principles behind three new algorithms for tackling the scheduling problem under the LogP model are described. The quality of the schedules produced by the algorithms are compared with good delay model-based algorithms and a previously existing LogP strategy.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
I. Ahmad and Y-K Kwok. A new approach to scheduling parallel programs using task duplication. In K.C. Tai, editor, International Conference on Parallel Processing, volume 2, pages 47–51, Aug 1994.
C. Boeres and V.E.F. Rebello. A versatile cost modelling approach for multicomputer task scheduling. Parallel Computing, 25(1):63–86, 1999.
C. Boeres, V.E.F. 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-Verlag.
D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. 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, May 1993.
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.
A. Gerasoulis and T. Yang. List scheduling with and without communication. Parallel Computing, 19:1321–1344, 1993.
S.J. Kim and J.C. 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.
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-Verlag.
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):505–521, May 1996.
A. Nascimento. Aglomeraç ão de tarefas em arquiteturas paralelas com memória distribuída. Master’s thesis, Instituto de Computaç ão, Universidade Federal Fluminense, Brazil, 1999. (In Portuguese).
M.A. Palis, J.-C Liou, and D.S.L. Wei. Task clustering and scheduling for distributed memory parallel architectures. IEEE Transactions on Parallel and Distributed Systems, 7(1):46–55, January 1996.
C.H. Papadimitriou and M. Yannakakis. Towards an architecture-independent analysis of parallel algorithms. SIAM J. Comput., 19:322–328, 1990.
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.
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-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boeres, C., Nascimento⋆, A., Rebello, V.E.F. (1999). Scheduling Arbitrary Task Graphs on LogP Machines. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_44
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive