This paper presents dynamic load-sharing heuristics which are novel in that they use predicted resource requirements of processes to manage workload in a distributed system. A previously developed statistical pattern-recognition method is employed for resource prediction. While nonprediction based heuristics depend on rapidly changing system status (e.g., load levels), the new heuristics depend on slowly changing program resource usage patterns. Furthermore prediction-based heuristics can be more effective since they use “future” requirements rather than just current system state. Four prediction-based heuristics, two centralized and two distributed, are presented here. Using trace driven simulations, they are compared against random scheduling and two effective nonprediction based heuristics. Results show that the prediction-based, centralized heuristics achieve up to 30% better response time than the nonprediction, centralized heuristic, and that the prediction-based, distributed heuristics achieve even better (up to 50%) improvement relative to their nonprediction counterpart.

Original languageEnglish (US)
Pages (from-to)638-648
Number of pages11
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number6
StatePublished - Jun 1993


  • Distributed systems
  • load sharing
  • performance evaluation
  • predicted process resource requirements
  • prediction-based dynamic heuristics
  • resource scheduling
  • trace-driven simulation

ASJC Scopus subject areas

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


Dive into the research topics of 'Prediction-Based Dynamic Load-Sharing Heuristics'. Together they form a unique fingerprint.

Cite this