Abstract
A parallel transferable uniform multi-round (PTUMR) scheduling algorithm is proposed for mitigating the adverse effect of the data transmission time by dividing workloads and allowing their parallel transmissions to distributed clients from the master in a network. The performance of parallel computing using the master/worker model for distributed grid computing tends to degrade when handling large data sets due to the impact of data transmission time. Multiple-round scheduling algorithms have therefore been proposed to mitigate the effects of the data transmission time by dividing the data into chunks that are sent in multiple rounds so as to overlap the time required for computation and communication. However, standard multiple-round algorithms assume a homogeneous network environment with uniform link transmission capacity, and as such cannot minimize the turnaround time effectively in real heterogeneous network environments. The proposed PTUMR algorithm optimizes the size of chunks, the number of rounds, and the number of workers to which data is to be transmitted in parallel, and is shown through performance evaluations to mitigate the adverse effects of data transmission time between the master and workers significantly, achieving turnaround times close to the theoretical lower limits.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Foster, I., Kesselman, C.: The GRID Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1998)
Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid. International Journal of Supercomputer Applications 15(3), 200–222 (2001)
Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.G.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)
Robertazzi, T.G.: Ten Reasons to Use Divisible Load Theory. Jounal of IEEE Computer 36(5), 63–68 (2003)
Gerogiannis, D., Orphanoudakis, S.C.: Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks. IEEE Trans. Parallel and Distributed Systems 4(9), 994–1013 (1993)
Chervenak, A., Foster, I., Kesselman, C., Salisbury, C., Tuecke, S.: The Data Grid: Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets. Journal of Network and Computer Applications 23, 187–200 (2001)
Yang, Y., Casanova, H.: UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads. In: Proc. of International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France (April 2003)
Yang, Y., Casanova, H.: A Multi-Round Algorithm for Scheduling Divisible Workload Applications: Analysis and Experimental Evaluation. Technical Report of Dept. of Computer Science and Engineering, University of California CS20020721 (2002)
Beaumont, O., Legrand, A., Robert, Y.: Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems. In: Proc. of International Parallel and Distributed Processing Symposium (IPDPS 2003), Nice, France (April 2003)
Cyril, C., Beaumont, O., Legrand, A., Robert, Y.: Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids. Technical Report 2002-12, LIP (March 2002)
Rosenberg, A.L.: Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better. In: Proc. of the 3rd IEEE International Conference on Cluster Computing (Cluster 2001), California, USA, October 2001, pp. 124–131 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, H., Tsuru, M., Oie, Y. (2005). Parallel Transferable Uniform Multi-round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_92
Download citation
DOI: https://doi.org/10.1007/11557654_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)