OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Keren Bergman
  • Vol. 7, Iss. 11 — Nov. 1, 2008
  • pp: 947–957

Task scheduling considering fault probability for distributed computing applications over an optical network

Wei Guo, Zheng Liang, Zhenyu Sun, Shilin Xiao, Yaohui Jin, Weiqiang Sun, and Weisheng Hu  »View Author Affiliations


Journal of Optical Networking, Vol. 7, Issue 11, pp. 947-957 (2008)
http://dx.doi.org/10.1364/JON.7.000947


View Full Text Article

Acrobat PDF (489 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

The optical network integrated computing environment has been thought of as a promising technology to support large-scale data-intensive distributed computing applications. For such an environment involving so many heterogeneous resources, such as high-performance processors and optical links, faults seem to be inevitable. The faults will lead to the failure of the applications or highly delay the applications' finish times. Therefore, it is necessary to analyze resources' fault probability and then to better schedule the tasks of the application onto the appropriate resources so as to minimize the fault probability of the application. We address the task-scheduling problem based on the fault probability analysis for distributed computing applications over an optical network. We quantitatively analyze the fault probability of the processors and optical links in a given interval and propose a minimal fault probability (MFP) task-scheduling algorithm to minimize the fault probability of the application. We develop a simulator to evaluate the performance of the MFP algorithm. The simulation results prove the efficiency of the MFP algorithm.

© 2008 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(200.4960) Optics in computing : Parallel processing

ToC Category:
Research Papers

History
Original Manuscript: April 29, 2008
Revised Manuscript: August 5, 2008
Manuscript Accepted: September 26, 2008
Published: October 31, 2008

Citation
Wei Guo, Zheng Liang, Zhenyu Sun, Shilin Xiao, Yaohui Jin, Weiqiang Sun, and Weisheng Hu, "Task scheduling considering fault probability for distributed computing applications over an optical network," J. Opt. Netw. 7, 947-957 (2008)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-7-11-947


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. D. Simeonidou, C. Nejabati, G. Zervas, D. Klonidis, A. Tzanakaki, and M. J. O'Mahony, “Dynamic optical network architectures and technologies for existing and emerging grid services,” J. Lightwave Technol. 23, 3347-3357 (2005). [CrossRef]
  2. A. Jukan and G. Karmous-Edwards, “Optical control plane for the grid community,” IEEE Commun. Surv. Tutorials 9, 30-44 (2007).
  3. W. Guo, Y. Jin, W. Sun, W. Hu, X. LinM.-Y. Wu, H. Liu, S. Fu, and J. Yuan, “Distributed computing over optical networks (invited paper),” in Optical Fiber Communication Conference and Exposition and the National Fiber Optics Engineers Conference, OSA Technical Digest (CD) (Optical Society of America, 2008), paper OWF1.
  4. J. D. Ullman, “NP-complete scheduling problems,” J. Comput. Syst. Sci. 10, 384-393 (1975).
  5. A. Gerasoulis and T. Yang, “A comparison of clustering heuristics for scheduling directed acyclic graphs onto multiprocessors,” J. Parallel Distrib. Comput. 16, 276-291 (1992). [CrossRef]
  6. H. Topcuoglu, S. Hariri, and M. Y. Wu, “Performance-effective and low-complexity task scheduling for heterogeneous computing,” IEEE Trans. Parallel Distrib. Syst. 13, 260-274 (2002). [CrossRef]
  7. G. C. Sih and E. A. Lee, “A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures,” IEEE Trans. Parallel Distrib. Syst. 4, 175-187 (1993). [CrossRef]
  8. O. Sinnen and L. Sousa, “Communication contention in task scheduling,” IEEE Trans. Parallel Distrib. Syst. 16, 503-515 (2005). [CrossRef]
  9. Y. Wang, Y. H. Jin, W. Guo, W. Q. Sun, W. S. Hu, and M. Y. Wu, “Joint scheduling for optical grid applications,” J. Opt. Netw. 6, 304-318 (2007). [CrossRef]
  10. Z. Sun, W. Guo, Z. Wang, Y. Jin, W. Sun, W. Hu, and C. Qiao, “Scheduling algorithm for workflow-based applications in optical grid,” J. Lightwave Technol. (to be published).
  11. X. Liu and C. Qiao, “Survivable optical grids,” in Optical Fiber Communication Conference, and Exposition and the National Fiber Optics Engineers Conference, OSA Technical Digest (CD) (Optical Society of America, 2008), paper OWN1.
  12. S. Hwang and C. Kesselman, “A flexible framework for fault tolerance in the grid,” J. Grid. Comput. 1, 251-272 (2003).
  13. F. C. Gartner, “Fundamentals of fault-tolerant distributed computing in asynchronous environments,” ACM Comput. Surv. 31, 1-26 (1999).
  14. J. Zhang and B. Mukherjee, “A review of fault management in WDM mesh networks: basic concepts and research challenges,” IEEE Networks 18(2), 41-48 (2004).
  15. O. Sinnen and L. A. Sousa, “List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures,” Parallel Comput. 30, 81-101 (2004).
  16. N. Wirth, Algorithms and Data Structures (Oberon, 2004).
  17. B. Mikac and R. Inkret, “Availability model of WDM optical networks,” in Proceedings of the Second International Workshop on the Design of Reliable Communication Networks (2000), pp. 80-85.
  18. J. Li, Y. Fan, and M. Zhou, “Performance modeling and analysis of workflow,” IEEE Trans. Syst. Man Cybern., Part A Syst. Humans 34, 229-242 (2004).
  19. L. Zhou, M. Held, and U. Sennhauser, “Connection availability analysis of shared backup path-protected mesh networks,” J. Lightwave Technol. 25, 1111-1119 (2007). [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited