6th International ICST Conference on Broadband Communications, Networks, and Systems

Research Article

An Efficient Superscheduler Architecture and Job Migration Algorithm for Computational Grids over Light-trail WDM Networks: Invited Paper

Download150 downloads
  • @INPROCEEDINGS{10.4108/ICST.BROADNETS2009.7593,
        author={Ashwin Gumaste and Shakesh Jain and  Arun K. Somani},
        title={An Efficient Superscheduler Architecture and Job Migration Algorithm for Computational Grids over Light-trail WDM Networks: Invited Paper},
        proceedings={6th International ICST Conference on Broadband Communications, Networks, and Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2009},
        month={11},
        keywords={Bandwidth Computer applications Computer architecture Computer networks Distributed computing Grid computing Merging Optical fiber networks Pervasive computing WDM networks},
        doi={10.4108/ICST.BROADNETS2009.7593}
    }
    
  • Ashwin Gumaste
    Shakesh Jain
    Arun K. Somani
    Year: 2009
    An Efficient Superscheduler Architecture and Job Migration Algorithm for Computational Grids over Light-trail WDM Networks: Invited Paper
    BROADNETS
    IEEE
    DOI: 10.4108/ICST.BROADNETS2009.7593
Ashwin Gumaste1,2, Shakesh Jain3, Arun K. Somani2
  • 1: Indian Institute of Technology, lIT Bombay, India 400 076
  • 2: Iowa State University, Ames lA, USA
  • 3: Akamai Inc. Santa Clara, CA. USA

Abstract

The merging, management and utilization of pervasive, idle computing devices using a dynamic communication infrastructure leads to the concept of computational grids. A computational grid enables enterprises to efficiently use distributed computing entities in a cost-effective setup for emerging compute-intensive applications. From a network perspective, the key requirement for a computational grid is the associated ability to provide dynamic bandwidth (on-demand). An optical networking solution based on the light-trail concept readily adapts to the requirement of dynamic provisioning of bandwidth, in addition to being a low-cost solution and providing for optical multicasting – the key to distribution of jobs amongst multiple nodes without the overhead of processing. We investigate a protocol based on a double auction mechanism for converting a light-trail based network into a computational grid using superschedulers at each node. It allows job migration to idle processors. We show how the auction scheme works for bandwidth assignment and in the technique of computing bids, as well as alterations in the virtual topology of the light-trail network. Results of simulation study show the methods’ effectiveness.