By Topic

Availability-Driven Scheduling for Real-Time Directed Acyclic Graph Applications in Optical Grids

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Min Zhu ; Shanghai Jiao Tong University ; Wei Guo ; Shilin Xiao ; Anne Wei
more authors

Optical grid systems have been viewed as a promising virtual computing environment to support distributed real-time directed acyclic graph (DAG) applications. For such a system involving many heterogeneous computing and network resources, faults seem to be inevitable. Therefore, a fault-tolerant DAG scheduling scheme is necessary to improve the performance of the optical grid system. However, existing joint task scheduling schemes for real-time DAG applications generally do not consider the availability issues when making scheduling decisions. We develop an availability-driven scheduling scheme that improves the DAG availability iteratively by allocating two copies of one communication task to two disjoint lightpaths for data transfer while satisfying application deadline requirements. Extensive simulation results demonstrate the effectiveness and the feasibility of the proposed scheduling scheme.

Published in:

IEEE/OSA Journal of Optical Communications and Networking  (Volume:2 ,  Issue: 7 )