Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Meta-Scheduling For Distributed Continuous Media

David P. Anderson

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-90-599
October 1990

http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/CSD-90-599.pdf

Next-generation distributed systems will support continuous media (digital audio and video) in the same hardware/software framework as other data. Many applications that use continuous media (CM) have end-to-end performance requirements such as minimum throughput or maximum delay. To reliably support these requirements, system components such as CPU schedulers, networks, and file systems must offer realtime semantics. A meta-scheduler 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 meta-scheduler. The model defines a workload parameterization, an abstract interface to resources, and an end-to-end algorithm for negotiated reservation of multiple resources; the division of delay is based on an economic model. Clients make reservations for worst-case workload and resources offer hard delay bounds. However, system components may "work ahead" within limits, increasing the responsiveness of bursty non-realtime workload.


BibTeX citation:

@techreport{Anderson:CSD-90-599,
    Author = {Anderson, David P.},
    Title = {Meta-Scheduling For Distributed Continuous Media},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1990},
    Month = {Oct},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/5788.html},
    Number = {UCB/CSD-90-599},
    Abstract = {Next-generation distributed systems will support continuous media (digital audio and video) in the same hardware/software framework as other data. Many applications that use continuous media (CM) have end-to-end performance requirements such as minimum throughput or maximum delay. To reliably support these requirements, system components such as CPU schedulers, networks, and file systems must offer realtime semantics. A meta-scheduler 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 meta-scheduler. The model defines a workload parameterization, an abstract interface to resources, and an end-to-end algorithm for negotiated reservation of multiple resources; the division of delay is based on an economic model. Clients make reservations for worst-case workload and resources offer hard delay bounds. However, system components may "work ahead" within limits, increasing the responsiveness of bursty non-realtime workload.}
}

EndNote citation:

%0 Report
%A Anderson, David P.
%T Meta-Scheduling For Distributed Continuous Media
%I EECS Department, University of California, Berkeley
%D 1990
%@ UCB/CSD-90-599
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1990/5788.html
%F Anderson:CSD-90-599