TY - GEN
T1 - Task scheduling and lightpath establishment in optical grids
AU - Liu, Xin
AU - Wei, Wei
AU - Qiao, Chunming
AU - Wang, Ting
AU - Hu, Weisheng
AU - Guo, Wei
AU - Wu, Min You
PY - 2008
Y1 - 2008
N2 - Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where computing tasks are executed. For a future WDM network to efficiently support this type of emerging applications, traditional approaches to establishing lightpaths between given source destination pairs are not sufficient because a computing task may be executed on any one of several computing nodes having the necessary resources. Therefore, lightpath establishment has to be considered jointly with task scheduling to achieve best performance. In this paper, we study the optimization problems of jointly scheduling both computing resources and network resources. We first present the formulation of two optimization problems with the objectives being the minimization of the completion time of a job and minimization of the resource usage/cost to satisfy a job with a deadline respectively. When the objective is to minimize the completion time, we devise an optimal algorithm for a special type of applications. Furthermore, we propose efficient heuristics to deal with general applications with either optimization objective and demonstrate their good performances via simulation.
AB - Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where computing tasks are executed. For a future WDM network to efficiently support this type of emerging applications, traditional approaches to establishing lightpaths between given source destination pairs are not sufficient because a computing task may be executed on any one of several computing nodes having the necessary resources. Therefore, lightpath establishment has to be considered jointly with task scheduling to achieve best performance. In this paper, we study the optimization problems of jointly scheduling both computing resources and network resources. We first present the formulation of two optimization problems with the objectives being the minimization of the completion time of a job and minimization of the resource usage/cost to satisfy a job with a deadline respectively. When the objective is to minimize the completion time, we devise an optimal algorithm for a special type of applications. Furthermore, we propose efficient heuristics to deal with general applications with either optimization objective and demonstrate their good performances via simulation.
UR - https://www.scopus.com/pages/publications/51349095237
U2 - 10.1109/INFOCOM.2007.261
DO - 10.1109/INFOCOM.2007.261
M3 - Conference contribution
AN - SCOPUS:51349095237
SN - 9781424420261
T3 - Proceedings - IEEE INFOCOM
SP - 81
EP - 85
BT - INFOCOM 2008
T2 - INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
Y2 - 13 April 2008 through 18 April 2008
ER -