Grid scheduling divisible loads from multiple sources via linear programming

Mequanint A. Moges, Dantong Yu, Thomas G. Robertazzi

Research output: Contribution to journalConference articlepeer-review

14 Scopus citations

Abstract

To date solutions for optimal finish time and job allocation in divisible load theory are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for tree networks with two load originating processors. Solutions for an optimal allocation of fraction of loads to nodes in single level tree networks are obtained via linear programming. Performance evaluation of a two source homogeneous single level tree network with concurrent communication strategy is presented.

Original languageEnglish (US)
Article number439-153
Pages (from-to)423-428
Number of pages6
JournalProceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Volume16
StatePublished - Dec 1 2004
Externally publishedYes
EventProceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems - Cambridge, MA, United States
Duration: Nov 9 2004Nov 11 2004

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Keywords

  • Divisible Loads
  • Linear Programming
  • Multiple Source
  • Scheduling
  • Tree Networks

Fingerprint

Dive into the research topics of 'Grid scheduling divisible loads from multiple sources via linear programming'. Together they form a unique fingerprint.

Cite this