Optimal randomized scheduling by replacement
In the replacement scheduling problem, a system is composed of n processors drawn from a pool of p. The processors can become faulty while in operation and faulty processors never recover. A report is issued whenever a fault occurs. This report states only the existence of a fault but does not indicate its location. Based on this report, the scheduler can reconfigure the system and choose another set of n processors. The system operates satisfactorily as long as, upon report of a fault, the scheduler chooses n non-faulty processors. We provide a randomized protocol maximizing the expected number of faults the system can sustain before the occurrence of a crash. The optimality of the protocol is established by considering a closely related dual optimization problem. The game-theoretic technical difficulties that we solve in this paper are very general and encountered whenever proving the optimality of a randomized algorithm in parallel and distributed computation.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-36
- OSTI ID:
- 228499
- Report Number(s):
- LA-UR-96-0353; CONF-9606169-1; ON: DE96008141
- Resource Relation:
- Conference: 8. Association for Computing Machinery (ACM) symposium on parallel algorithms and architectures (SPAA), Padua (Italy), 24-26 Jun 1996; Other Information: PBD: [1996]
- Country of Publication:
- United States
- Language:
- English
Similar Records
FTN topology and protocols
Improved task scheduling for parallel simulations. Master's thesis