Ramesh Govindan and David P. Anderson

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-91-622
March 1991

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/CSD-91-622.pdf

Next-generation workstations will have hardware support for digital "continuous media" (CM) such as audio and video. CM applications handle data at high rates, with strict timing requirements, and often in small "chunks". If such applications are to run efficiently and predictably as user-level programs, an operating system must provide scheduling and IPC mechanisms that reflect those needs. We propose two such mechanisms: split-level CPU scheduling of lightweight processes in multiple address spaces, and memory-mapped streams for data movement between address spaces. These techniques reduce the number of user/kernel interactions (system calls, signals, and preemptions). Compared with existing mechanisms, they can reduce scheduling and I/O overhead by a factor of 4 to 6.

BibTeX citation:

@techreport{Govindan:CSD-91-622,
    Author = {Govindan, Ramesh and Anderson, David P.},
    Title = {Scheduling and IPC Mechanisms for Continuous Media},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1991},
    Month = {Mar},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/5559.html},
    Number = {UCB/CSD-91-622},
    Abstract = {Next-generation workstations will have hardware support for digital "continuous media" (CM) such as audio and video. CM applications handle data at high rates, with strict timing requirements, and often in small "chunks". If such applications are to run efficiently and predictably as user-level programs, an operating system must provide scheduling and IPC mechanisms that reflect those needs. We propose two such mechanisms: split-level CPU scheduling of lightweight processes in multiple address spaces, and memory-mapped streams for data movement between address spaces. These techniques reduce the number of user/kernel interactions (system calls, signals, and preemptions). Compared with existing mechanisms, they can reduce scheduling and I/O overhead by a factor of 4 to 6.}
}

EndNote citation:

%0 Report
%A Govindan, Ramesh
%A Anderson, David P.
%T Scheduling and IPC Mechanisms for Continuous Media
%I EECS Department, University of California, Berkeley
%D 1991
%@ UCB/CSD-91-622
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/5559.html
%F Govindan:CSD-91-622