Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources

Debasish Ghose, Hyoung Joong Kim, Tae Hoon Kim

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


Conventional divisible load scheduling algorithms attempt to achieve optimal partitioning of massive loads to be distributed among processors in a distributed computing system in the presence of communication delays in the network. However, these algorithms depend strongly upon the assumption of prior knowledge of network parameters and cannot handle variations or lack of information about these parameters. In this paper, we present an adaptive strategy that estimates network parameter values using a probing technique and uses them to obtain optimal load partitioning. Three algorithms, based on the same strategy, are presented in the paper, incorporating the ability to cope with unknown network parameters. Several illustrative numerical examples are given. Finally, we implement the adaptive algorithms on an actual network of processor nodes using MPI implementation and demonstrate the feasibility of the adaptive approach.

Original languageEnglish
Pages (from-to)897-907
Number of pages11
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number10
Publication statusPublished - 2005 Oct


  • Distributed applications
  • Divisible loads
  • Multiprocessor systems
  • Scheduling and task partitioning
  • Workstations

ASJC Scopus subject areas

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Adaptive divisible load scheduling strategies for workstation clusters with unknown network resources'. Together they form a unique fingerprint.

Cite this