Communication Contention Reduction in Joint Scheduling for Optical Grid Computing

Optical network, which can provide guaranteed quality of service (QoS) connections, is considered as a promising infrastructure for grid computing to solve more and more complex scientific problems. When optical links are regarded as resources and jointly scheduled with other grid resources, communication contention must be taken into consideration for efficient task scheduling. This paper models the optical grid computing as a communication-aware Directed Acyclic Graph (DAG) scheduling problem. To reduce the communication contention, we propose to use hop-bytes metric (HBM) heuristic to select computing resource. Simulation results show that the HBM approach combined with the adaptive routing scheme can achieve better performance in terms of normalized schedule length and link utilization.

[1]  Bijan Jabbari,et al.  DRAGON: a framework for service provisioning in heterogeneous grid networks , 2006, IEEE Communications Magazine.

[2]  Xi Wang,et al.  CAM03-6: AR-PIN/PDC: Flexible Advance Reservation of Intradomain and Interdomain Lightpaths , 2006, IEEE Globecom 2006.

[3]  Vivek Sarkar,et al.  Partitioning and scheduling parallel programs for execution on multiprocessors , 1987 .

[4]  Chase Qishi Wu,et al.  CHEETAH: circuit-switched high-speed end-to-end transport architecture testbed , 2005, IEEE Communications Magazine.

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

[6]  Daniel Gajski,et al.  Hypertool: A Programming Aid for Message-Passing Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[7]  Andrew A. Chien,et al.  The OptIPuter , 2003, CACM.

[8]  Rami G. Melhem,et al.  On the Feasibility of Optical Circuit Switching for High Performance Computing Systems , 2005, ACM/IEEE SC 2005 Conference (SC'05).

[9]  Biswanath Mukherjee,et al.  Dynamic lightpath establishment in wavelength-routed WDM networks , 2001, IEEE Commun. Mag..

[10]  Laxmikant V. Kalé,et al.  Topology-aware task mapping for reducing communication contention on large parallel machines , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[11]  Malathi Veeraraghavan,et al.  On the use of connection-oriented networks to support grid computing , 2006, IEEE Communications Magazine.

[12]  Franco Travostino,et al.  DWDM-RAM: enabling Grid services with dynamic optical networks , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[13]  Ishfaq Ahmad,et al.  Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors , 1999, Proceedings of the 1999 International Conference on Parallel Processing.

[14]  Yves Robert,et al.  A realistic model and an efficient heuristic for scheduling with heterogeneous processors , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[15]  Robert L. Grossman,et al.  Data integration in a bandwidth-rich world , 2003, CACM.

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

[17]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[18]  Alan M. MacEachren,et al.  Supporting visual analysis of federal geospatial statistics , 2003, CACM.

[19]  Celia Desmond.  Society News - Candidates announced for board of governors , 2005, IEEE Commun. Mag..

[20]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[21]  P. Castoldi,et al.  A service oriented network architecture suitable for global grid computing , 2005, Conference onOptical Network Design and Modeling, 2005..