Efficient scheduling algorithm for component-based networks

  • Authors:

  • Seokcheon Lee;Soundar Kumara;Natarajan Gautam

  • Affiliations:

  • School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA;Department of Industrial Engineering, The Pennsylvania State University, University Park, PA 16802, USA;Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX 77843, USA

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a grid computing environment, it is important to be capable of agilely quantifying the quality of service achievable by each alternative composition of resources. This capability is an essential driver to not only efficiently utilizing the resources but also promoting the virtual economy. In this paper, we design an efficient scheduling algorithm of minimizing completion time for component-based networks. The performance of the network is a function of resource assignment and resource allocation. Resource assignment assigns components to available machines and resource allocation allocates the resources of each machine to the residing components. Though similar problems can be found in the multiprocessor scheduling literature, our problem is different especially because the components in our networks process multiple tasks in parallel with their successor or predecessor components. The designed algorithm is simple but effective since it incorporates the fact that the components in a network can be considered independent under a certain resource allocation policy.