Scheduling with Implicit Information in Distributed Systems (1998)
Cached
Download Links
- [www.cs.ucsb.edu]
- [sys192.cs.washington.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 1998 ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems |
| Citations: | 62 - 4 self |
BibTeX
@INPROCEEDINGS{Arpaci-Dusseau98schedulingwith,
author = {Andrea Arpaci-Dusseau and David E. Culler and Alan M. Mainwaring},
title = {Scheduling with Implicit Information in Distributed Systems},
booktitle = {In Proceedings of the 1998 ACM Sigmetrics International Conference on Measurement and Modeling of Computer Systems},
year = {1998},
pages = {233--243}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Implicit coscheduling is a distributed algorithm for time-sharing communicating processes in a cluster of workstations. By observing and reacting to implicit information, local schedulers in the system make independent decisions that dynamically coordinate the scheduling of communicating processes. The principal mechanism involved is two-phase spin-blocking: a process waiting for a message response spins for some amount of time, and then relinquishes the processor if the response does not arrive. In this paper, we describe our experience implementing implicit coscheduling on a cluster of 16 UltraSPARC I workstations; this has led to contributions in three main areas. First, we more rigorously analyze the two-phase spin-block algorithm and show that spin time should be increased when a process is receiving messages. Second, we present performance measurements for a wide range of synthetic benchmarks and for seven Split-C parallel applications. Finally, we show how implicit coscheduling ...
