Skip to main navigation Skip to search Skip to main content

Grid scheduling divisible load with load adaptive computing power

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For an initial study in divisible load scheduling, an optimal computing power allocation problem in a distributed parallel computing grid involving two sources and a sink is considered. The objective is to optimally allocate the computing power of the sink in the grid in a such way that the total parallel computing finish time of the entire load is equalized to the sequential computing finish time while utilizing the full computing power. A numerical method to calculate the optimal adaptive computing power via a deterministic analysis is presented under several computing constraints. Performance of the computing power adaptation is modeled and evaluated. For performance evaluation, we define average computing finish time.

Original languageEnglish
Title of host publicationProceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010
PublisherActa Press
Pages9-15
Number of pages7
ISBN (Print)9780889868205
DOIs
StatePublished - 2010
Event9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010 - Innsbruck, Austria
Duration: Feb 16 2010Feb 18 2010

Publication series

NameProceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010

Conference

Conference9th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2010
Country/TerritoryAustria
CityInnsbruck
Period02/16/1002/18/10

Keywords

  • Adaptive computing power
  • Divisible load theory
  • Grid
  • Parallel computing

Fingerprint

Dive into the research topics of 'Grid scheduling divisible load with load adaptive computing power'. Together they form a unique fingerprint.

Cite this