• DocumentCode
    1995325
  • Title

    A Tabu Search Approach for Joint Scheduling of Resources in a Lambda Grid Network

  • Author

    Ravula, Anusha ; Ramamurthy, Byrav

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Univ. of Nebraska-Lincoln, Lincoln, NE, USA
  • fYear
    2010
  • fDate
    6-10 Dec. 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    Advanced distributed applications in engineering, scientific and business domains that are highly data-intensive demand high-performance computing platforms. Grid networks based on optical technology provide a promising approach to create efficient infrastructure to support such applications. These networks, termed in general as Lambda Grid networks, are based on optical circuit switching and employ wavelength division multiplexing and optical lightpaths. In this paper, we propose an approach based on Tabu Search heuristic for joint scheduling of computing, network and storage resources in a Lambda Grid network. The objectives are to minimize cost by efficient usage of resources and to minimize total completion time of job execution. The results are compared to a Greedy approach. Simulation results from both the methods show that the Tabu search heuristic performed better than the greedy approach in optimizing both the cost and completion time objectives.
  • Keywords
    circuit switching; greedy algorithms; grid computing; optical switches; search problems; wavelength division multiplexing; Lambda grid network; greedy approach; high-performance computing; optical circuit switching; optical lightpath; resource scheduling; tabu search; wavelength division multiplexing; Joints; Optical fiber networks; Peer to peer computing; Processor scheduling; Program processors; Scheduling; Search problems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE
  • Conference_Location
    Miami, FL
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-5636-9
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2010.5683836
  • Filename
    5683836