Centralized and Distributed Dynamic Scheduling for Adaptive, Parallel Algorithms
Abstract
We examine a set of dynamic scheduling techniques for parallel adaptive algorithms in a distributed computational environment. We consider three basic scheduling approaches: centralized scheduling, which uses a master- slave model of computation; distributed scheduling, which uses local information about processor workload to determine when tasks should be requested from or sent to other processors; and a new approach that we refer to as centralized mediation, that uses aspects of both centralized and distributed scheduling. We use both distributed implementation and simulation to examine the performance and scalability of these three scheduling and simulation to examine the performance and scalability of these three scheduling approaches when applied to a parallel adaptive algorithm for solving the global optimization problem. In these experiments, the new centralized mediation approach appears to provide the best combination of robustness, efficiency, and ease of implementation.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 14, 1991
- Accession Number
- ADA233557
Entities
People
- Robert B. Schnabel
- Sharon L. Smith
Organizations
- University of Colorado Boulder