Parallel transferable uniform multi-round algorithm for achieving minimum application turnaround times for divisible workload

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

Volumn 3726 LNCS, Issue , 2005, Pages 817-828

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

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Constraint Minimization Problem; Divisible Workload; Master Worker model; Parallel Data Transmission; UMR

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; TURNAROUND TIME;

CONSTRAINT MINIMIZATION PROBLEM; DIVISIBLE WORKLOAD; MASTER/WORKER MODEL; PARALLEL DATA TRANSMISSION; UMR;

PARALLEL PROCESSING SYSTEMS;

EID: 33646409260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557654_92     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. Chose, 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. A. Chervenak, I. Foster, C. Kesselman, C. Salisbury, and S. Tuecke, "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.
7. 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.
8. 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.
9. 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.
10. 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.
11. 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.