Parallel Transferable Uniform Multi-round Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload (original) (raw)

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.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Foster, I., Kesselman, C.: The GRID Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1998)
    Google Scholar
  2. Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid. International Journal of Supercomputer Applications 15(3), 200–222 (2001)
    Article Google Scholar
  3. Bharadwaj, V., Ghose, D., Mani, V., Robertazzi, T.G.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Alamitos (1996)
    Google Scholar
  4. Robertazzi, T.G.: Ten Reasons to Use Divisible Load Theory. Jounal of IEEE Computer 36(5), 63–68 (2003)
    Google Scholar
  5. 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)
    Article Google Scholar
  6. 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)
    Article Google Scholar
  7. 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)
    Google Scholar
  8. 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)
    Google Scholar
  9. 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)
    Google Scholar
  10. 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)
    Google Scholar
  11. 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)
    Google Scholar

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Electronics, Kyushu Institute of Technology, Kawazu 680-4, Iizuka, 820-8502, Japan
    Hiroshi Yamamoto, Masato Tsuru & Yuji Oie

Authors

  1. Hiroshi Yamamoto
  2. Masato Tsuru
  3. Yuji Oie

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
    Laurence T. Yang
  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK
    Omer F. Rana
  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy
    Beniamino Di Martino
  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA
    Jack Dongarra

Rights and permissions

© 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

Keywords

Publish with us