Scheduling and IPC mechanisms for continuous media
- 1 September 1991
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 25 (5), 68-80
- https://doi.org/10.1145/121132.121147
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 these 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 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.Keywords
This publication has 6 references indexed in Scilit:
- The performance of message‐passing using restricted virtual memory remappingSoftware: Practice and Experience, 1991
- Performance of the Firefly RPCACM Transactions on Computer Systems, 1990
- Remote pipes and procedures for efficient distributed communicationACM Transactions on Computer Systems, 1988
- Machine-independent virtual memory management for paged uniprocessor and multiprocessor architecturesIEEE Transactions on Computers, 1988
- Task communication in DEMOSPublished by Association for Computing Machinery (ACM) ,1977
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973