A parallel transferable uniform multi-round algorithm in heterogeneous distributed computing environment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4208 LNCS, Issue , 2006, Pages 51-60

  Yamamoto, Hiroshi ^a,b   Tsuru, Masato ^a   Oie, Yuji ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

^b FUJITSU LABORATORIES LTD   (Japan)

Author keywords

Divisible Work load; Grid Computing; Master Worker Model; Multi Round Scheduling; UMR

Indexed keywords

COMPUTATION THEORY; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS;

DIVISIBLE WORK-LOAD; GRID COMPUTING; MASTER/WORKER MODELS; MULTI-ROUND SCHEDULING; UNIFORM MULTI-ROUND ALGORITHM (UMR);

PARALLEL ALGORITHMS;

EID: 33750308662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847366_6     Document Type: Conference Paper

References (11)

1. I. Foster and C. Kesselman, The GRID Blueprint for a New Computing Infrastructure, Morgan Kaufmann Publishers, 1998.
2. I. Foster, C. Kesselman, and S. Tuecke, "The Anatomy of the Grid," International Journal of Supercomputer Applications, Vol. 15, No. 3, pp. 200-222, 2001.
3. V. Bharadwaj, D. Ghose, V. Mani, and T. G. Robertazzi, "Scheduling Divisible Loads in Parallel and Distributed Systems," IEEE Computer Society Press, 1996.
4. T. G. Robertazzi, "Ten Reasons to Use Divisible Load Theory," Jounal of IEEE Computer, Vol. 36, No. 5, pp. 63-68, May 2003.
5. D. Gerogiannis and S. C. Orphanoudakis, "Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks," IEEE Trans. Parallel and Distributed Systems, Vol. 4, No. 9, pp. 994-1013, 1993.
6. Y. Yang and H. Casanova, "UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads," Proc. of International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, April 2003.
7. Y. Yang and H. Casanova, "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.
8. O. Beaumont, A. Legrand, and Y. Robert, "Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems," Proc. of International Parallel and Distributed Processing Symposium (IPDPS'03), Nice, France, April 2003.
9. C. Cyril, O. Beaumont, A. Legrand, and Y. Robert, "Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Grids," Technical Report 2002-12, LIP, March 2002.
10. A. L. Rosenberg, "Sharing Partitionable Workloads in Heterogeneous NOWs: Greedier Is Not Better," Proc. of the 3rd IEEE International Conference on Cluster Computing (Cluster 2001), pp. 124-131, California, USA, October 2001.
11. H. Yamamoto, M. Tsuru, and Y. Oie, "Parallel Transferable Uniform Multi-Flound Algorithm for Achieving Minimum Application Turnaround Times for Divisible Workload," Proc. of the 2005 International Conference on High Performance Computing and Communication (HPCC-05), LNCS 3726, pp. 817-828, Capri-Sorrento Penisular, Italy, September 2005.