Task Scheduling and Lightpath Establishment in Optical Grids

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.

[1]  Bin Wang,et al.  On service provisioning under a scheduled traffic model in reconfigurable WDM optical networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[2]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[3]  Emmanuel Dotaro,et al.  Routing and wavelength assignment of scheduled lightpath demands , 2003, IEEE J. Sel. Areas Commun..

[4]  Martine Labbé,et al.  Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics , 1999 .

[5]  Hesham H. Ali,et al.  Task scheduling in parallel and distributed systems , 1994, Prentice Hall series in innovative technology.

[6]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[7]  Wei Guo,et al.  Joint scheduling for optical grid applications , 2007 .

[8]  Dharma P. Agrawal,et al.  Optimal Scheduling Algorithm for Distributed-Memory Machines , 1998, IEEE Trans. Parallel Distributed Syst..

[9]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[10]  Leonel Sousa,et al.  Communication contention in task scheduling , 2005, IEEE Transactions on Parallel and Distributed Systems.

[11]  Tao Yang,et al.  A Comparison of Clustering Heuristics for Scheduling Directed Acycle Graphs on Multiprocessors , 1992, J. Parallel Distributed Comput..

[12]  Bruno Volckaert,et al.  A view on enabling-consumer oriented grids through optical burst switching , 2006, IEEE Communications Magazine.

[13]  Yong Zhao,et al.  Grid middleware services for virtual data discovery, composition, and integration , 2004, MGC '04.

[14]  M.J. O'Mahony,et al.  Dynamic optical-network architectures and technologies for existing and emerging grid services , 2005, Journal of Lightwave Technology.

[15]  Chunming Qiao,et al.  Approaches to Support Various Types of Traffic in WDM Networks , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[16]  Shahid H. Bokhari,et al.  A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System , 1981, IEEE Transactions on Software Engineering.

[17]  R. Nejabati,et al.  A Fully Functional Application-aware Optical Burst Switched Network Test-bed , 2007, OFC/NFOEC 2007 - 2007 Conference on Optical Fiber Communication and the National Fiber Optic Engineers Conference.

[18]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[19]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[21]  Leonel Sousa,et al.  List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures , 2004, Parallel Comput..