Abstract
In this work, a two-step approach is adopted for scheduling tasks with synchronous communication. To that end, an efficient algorithm, called GLB-Synch, is introduced for mapping clusters and ordering tasks on processors in one integrated step. The algorithm used the information obtained during the clustering step for selecting a cluster to be mapped on the least loaded processor. A performance study has been conducted on the GLB-Synch algorithm by simulation. We have shown by analysis and experimentation that the GLB-Sync algorithm retains the same low complexity cost of the first step for clustering.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arafeh, B.: Non-linear Clustering Algorithm for Scheduling Parallel programs with Synchronous Communication on NOWs. International Journal of Computers and Their Applications 10(2), 103–114 (2003)
Foster, I., Kesselman, C.: Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputing Applications and High Performance Computing 11(2), 115–128 (1997)
Kadamuddi, D., Tsai, J.: Clustering Algorithm for Parallelizing Software Systems in Multiprocessors. IEEE Transactions on Software Engineering 26(4), 340–361 (2000)
Liou, J.-C., Palis, M.A.: A Comparison of General Approaches to Multiprocessor Scheduling. In: Proceedings of 11th International Parallel Processing Symposium, pp. 152–156 (1997)
Radulescu, A.: Compile-Time Scheduling for Distributed-Memory Systems. Ph.D. thesis, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands (2001)
Sarkar, V.: Partitioning and Scheduling Programs for Execution on Multiprocessors. MIT Press, Cambridge (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arafeh, B.R. (2004). On Mapping and Scheduling Tasks with Synchronization on Clusters of Machines. In: Li, M., Sun, XH., Deng, Q., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3033. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24680-0_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-24680-0_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21993-4
Online ISBN: 978-3-540-24680-0
eBook Packages: Springer Book Archive