Abstract
This paper briefly describes the mechanisms used to reduce the number of processors required by a class of task replication-based scheduling heuristics for the LogP model. These heuristics, which are based on the task clustering algorithm design methodology [3], are known to generate schedules with good makespans [3,5]. Results in this paper show that a significant reduction, on average, in the number of processors required can be obtained without degrading the makespan. These mechanisms can also be used to tradeoff quality in terms of an increase in the makespan for quantity in terms of a further reduction in the number of processors required.
This work is funded by grants from the the Fundação de Amparo á Pesquisa do Estado do Rio de Janeiro (FAPERJ). The authors are partially supported by grants from Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq).
Chapter PDF
Similar content being viewed by others
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
A. Alexandrov, M. Ionescu, K. E. Schauser, and C. Scheiman. LogGP: Incorporating long messages into the LogP model-one step closer towards a realistic model for parallel computation. 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA’95), 1995.
C. Boeres, A. Nascimento, and V. E. F. Rebello. Scheduling arbitrary task graphs on LogP machines. In P. Amestoy et al., editors, The Proceedings of the 5th International Euro-Par Conference on Parallel Processing (Euro-Par’99), LNCS 1685, pages 340–349, Toulouse, France, August 1999. Springer.
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.
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 and V. E. F. Rebello. On the design of clustering-based scheduling algorithms for realistic machine models. In The Proceedings of the 15th International Parallel and Distributed Processing Symposium (IPDPS’01), San Francisco, USA, April 2001. IEEE Computer Society Press.
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 Proc. of the 4th International Euro-Par Conference on Parallel Processing (Euro-Par’98), LNCS 1470, pages 337–346, Southampton, UK, September 1998. Springer.
D. Culler et al.. 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.
T. Kalinowski, I. Kort, and D. Trystram. List scheduling of general task graphs under LogP. Parallel Computing, 26(9):1109–1128, 2000.
W. Lowe and W. Zimmermann. Scheduling balanced task-graphs to LogP-machines. Parallel Computing, 26(9):1083–1108, 2000.
R. P. Martin, A. M. Vahdat, D. E. Culler, and T. E. Anderson. Effects of communication latency, overhead, and bandwidth in a cluster architecture. In Proc. of the 24th International Symposium on Computer Architecture, pages 85–97, June 1997.
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.
A. Tam and C. Wang. Realistic communication model for parallel computing on cluster. In Proc. of the 1st IEEE International Workshop on Cluster Computing, pages 92–101, Melbourne, Australia, December 1999. IEEE Computer Soc. Press.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boeres, C., da Cunha, G.N., Rebello, V.E.F. (2001). On Minimising the Processor Requirements of LogP Schedules. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive