Task Scheduling and Lightpath Establishment in Optical Grids
Authors:
- X. LiuXLX. Liu
- W. WeiWWW. Wei
- C. QiaoCQC. Qiao
- T. WangTWT. Wang
- W. HuWHW. Hu
- W. GuoWGW. Guo
- M.-Y. WuMWM.-Y. Wu
- 1 April 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0743166X,p. 1966-1974
Abstract
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.Keywords
This publication has 10 references indexed in Scilit:
- Task Scheduling and Lightpath Establishment in Optical Grids2008
- Joint scheduling for optical grid applicationsJournal of Optical Networking, 2007
- A view on enabling-consumer oriented grids through optical burst switchingIEEE Communications Magazine, 2006
- Dynamic optical-network architectures and technologies for existing and emerging grid servicesJournal of Lightwave Technology, 2005
- Communication contention in task schedulingIEEE Transactions on Parallel and Distributed Systems, 2005
- List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architecturesParallel Computing, 2004
- Grid middleware services for virtual data discovery, composition, and integration2004
- A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor SystemIEEE Transactions on Software Engineering, 1981
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974