Metascheduling for continuous media (1993)
Cached
Download Links
- [www.cs.berkeley.edu]
- [www.eecs.berkeley.edu]
- [cs.ucsb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 146 - 3 self |
BibTeX
@ARTICLE{Anderson93metaschedulingfor,
author = {David P. Anderson},
title = {Metascheduling for continuous media},
journal = {ACM Transactions on Computer Systems},
year = {1993},
volume = {11},
pages = {226--252}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Next-generation distributed systems will support corLtLzLzLous medLa (digztal audio and video) in the same framework as other data. Many applications that use continuous media need guaran-teed end-to-end performance (bounds on throughput and delay). To reliably support these requirements, system components such as CPU schedulers, networks, and file systems must offer performance guarantees. A rnetasclzedtder coordinates these components, negotiating end-to-end guarantees on behalf of clients. The CM-resource model, described in this paper, provides a basis for such a metascheduler. It defines a workload parameterizatlon, an abstract interface to resources, and an algorithm for reserving multiple resources. The model uses an economic approach to dividing end-to-end delay, and it allows system components to “work ahead,” improving the performance of nonreal-time workload.
