Algorithms for Divisible Load Scheduling of Data-intensive Applications

被引：0
作者：
Chen Yu
Dan C. Marinescu
机构：
[1] University of Central Florida,School of Electrical Engineering & Computer Science
来源：
Journal of Grid Computing | 2010年 / 8卷
关键词：
Divisible Load Scheduling; Divisible Load Theory (DLT); Load balancing; Grid computing;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we introduce the Divisible Load Scheduling (DLS) family of algorithms for data-intensive applications. The polynomial time algorithms partition the input data and generate optimal mappings to collection of autonomous and heterogeneous computational systems. We prove the optimality of the solution and report a simulation study of the algorithms.
引用
收藏
页码：133 / 155
页数：22
相关论文
共 71 条
  • [1] Atallah MJ(1992)Models and algorithms for co-scheduling compute-intensive tasks on a network of workstations J. Parallel Distrib. Comput. 16 319-327
  • [2] Black CL(2008)A launch-time scheduling heuristics for parallel applications on wide area Grids J. Grid Computing 6 159-175
  • [3] Marinescu DC(2005)Scheduling divisible loads on star and tree networks: results and open problems IEEE Trans. Parallel Distrib. Syst. 16 207-218
  • [4] Siegel HJ(1999)Divisible task scheduling—concept and verification Parallel Comput. 25 87-98
  • [5] Casavant TL(1995)Scheduling divisible jobs on hypercubes Parallel Comput. 21 1945-1956
  • [6] Baraglia R(1996)The performance limits of a two-dimensional network of load-sharing processors Found. Comput. Decis. Sci. 21 3-15
  • [7] Ferrini R(2001)A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems J. Parallel Distrib. Comput. 61 810-837
  • [8] Tonellotto N(1988)Distributed computation with communication delay IEEE Trans. Aerosp. Electron. Syst. 24 700-712
  • [9] Ricci L(1990)Distributed computation for a tree network with communication delays IEEE Trans. Aerosp. Electron. Syst. 26 511-516
  • [10] Yahyapour R(1998)Cooperative task scheduling on workstations network J. Softw. 9 14-17
12345678