• Home
  • Search
  • Task scheduling algorithm for optical grid architecture
  • https://doi.org/10.1117/12.691670Copy DOI Icon

Task scheduling algorithm for optical grid architecture

  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

ABSTRACT Optical Grid that provides a way to integrate the geographical distributed resources for large- scale grid applications. This paper mainly focuses on the task scheduling issue in Optical Grid and proposes two task scheduling algorithms to mini-mize the total time or scheduling length required for a given task. A simulated optical grid has been addressed to demon-strate the effectiveness of the schedulin g approach. The performance tests and anal ysis of the two algorithms are investi-gated to show the effect of the routing policy on the schedulin g length. A more flexible policy is able to further improve scheduling length. Keywords: Optical Grid, Task Scheduling Algorithm, Communication Contention I INTRODUCTION Distributed computing, also known as computational Grid, is a technology that makes it possible to utilize the geographi-cal distributed computational resources to solve the intensive computation of large-scale data. Most Grid systems were built over the IP packet switched networks in the past. In the situation when some data-intensive Grid applications re-quire moving Gigabytes or even larger of data, the low speed of the network becomes the bottleneck of Grid system, which could not allow the remote resources to be used efficiently. Nowadays the optical network with Synchronous Digital Hierarchy (SDH), Wavelength-D ivision Multiplexing (WDM), and Automa tic Switched Optical Network (ASON) infrastructure can provide a much larger amount of bandwidth than the electronic network, such as IP packet switched network. Therefore, it is significant to use the optical network as the network infrastructure of the computational Grid. We refer to this infrastructure as Optical Grid, which employs optical network to interconnect grid computational re-sources (e.g. supercomputers, computer clusters, storage and display devices) with dynamically provisioned lightpaths [1]. It has been realized that task scheduling is a fundamental issue in achieving high performance in grid environments [6]. Task scheduling aims to optimize the overall performance of a system, e.g., minimizing the average job response time and maximizing the number of jobs exec uted in certain period of time. Optical grid task scheduling is quite different from classic grid task scheduling model. In Optical Grid system, we can treat the optical network as a kind of resource, the scheduling algorithm in Optical Grid system should schedule the tasks to appropriate resources as we ll as scheduling the communications between tasks to appropriate optical links. The objec-tive of task scheduling is to minimize the completion time (we called it as scheduling length or make span ) of an appli-cation. Usually, this problem is modeled and solved under several assumptions. Unless the assumptions are simplified enough, the problem has been proven to be NP-complete [8]. Therefore, many heuristic algorithms have been proposed. But these heuristics either are based on the assumption that the processors are fully connected, or just don’t take into ac-count the optical network’s characters, es pecially the characters of WDM optical network. While actually, in the Optical Grid system, the computational resources are more likely not fully connected, and the communication contention is an important factor that affects the completion time of a Grid application. Thus, a new heuris tic algorithm that can schedule tasks and also the communications are needed. In this paper, we mainly focus on the static scheduling problem, which means the character of the Grid applica tion, including the task execution times, task dependencies, task communications and synchronization are known a priori.

Similar Papers
  • Conference Article
  • Citations2

QoS agent based framework and algorithm for task scheduling in grid

  • Jan 01, 2014
  • T T Dhivyaprabha
  • Book Chapter
  • Citations1

PHOTONET WDM Supervision

  • Jan 01, 1997
  • Gerald Tobolka +4
  • Conference Article

A distributed optical grid network infrastructure for future easy-to-use innovative network services

  • Nov 19, 2011
  • Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
  • Sugang Xu +2
  • Research Article
  • Citations14

SAAS parallel task scheduling based on cloud service flow load algorithm

  • Oct 30, 2021
  • Computer Communications
  • Jian Zhu +2
  • Conference Article
  • Citations11

The ASON approach to the control plane for optical networks

  • Jul 04, 2004
  • A Jajszczyk
  • Research Article
  • Citations1

(Retracted) Mobile edge computing task scheduling and device cooperation algorithm based on deep learning

  • Aug 27, 2022
  • Journal of Electronic Imaging
  • Manjun Liu
  • Conference Article
  • Citations2

Task Scheduling and Lightpath Establishment in Optical Grids

  • Apr 01, 2008
  • X Liu +6
  • Research Article
  • Citations1

A fast predictive algorithm with idle reduction for heterogeneous system scheduling

  • Mar 09, 2016
  • Simulation Modelling Practice and Theory
  • Anan Niyom +2
  • Conference Article
  • Citations4

Quasi-CWDM optical network: cost effective and spectrum efficient architecture for future optical networks (invited)

  • May 01, 2015
  • Gangxiang Shen +2
  • Conference Article
  • Citations1

Rugged optical data distribution network for avionics

  • Sep 01, 2010
  • Matthias Gross +1
  • Conference Article
  • Citations3

Online Joint Scheduling of Delay-Sensitive and Computation-Oriented Tasks in Edge Computing

  • Dec 01, 2019
  • Fuming Zhang +3
  • Conference Article
  • Citations4

A survey of Optical Networks and its visual management and control

  • Jan 01, 2011
  • Zhan Mei +2
  • Research Article
  • Citations2

WDM Network Issues: QOT Impairments, Dynamic Bandwidth Allocation, Modeling and Monitoring Schemes based on ML

  • Jan 01, 2021
  • SSRN Electronic Journal
  • Saloni Rai +1
  • Book Chapter
  • Citations9

Application of Discrete Particle Swarm Optimization for Grid Task Scheduling Problem

  • Feb 28, 2011
  • Ruey-Maw Chen
  • Conference Article

Bandwidth allocation in WDM tree networks

  • Apr 23, 2001
  • C Kaklamanis
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.