Skip to main content
Back to USENIX
  • Conferences
  • Students
Sign in

USENIX Conference Policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

A Hierarchical CPU Scheduler for Multimedia Operating Systems

Pawan Goyal, Xingang Guo and Harrick M. Vin, University of Texan, Austin

The need for supporting variety of hard and soft real-time, as well as best effort applications in a multimedia computing environment requires an operating system framework that: (1) enables different schedulers to be employed for different application classes, and (2) provides protection between the various classes of applications. We argue that these objectives can be achieved by hierarchical partitioning of CPU bandwidth, in which an operating system partitions the CPU bandwidth among various application classes, and each application class, in turn, partitions its allocation (potentially using a different scheduling algorithm) among its sub-classes or applications. We present Start-time Fair Queuing (SFQ) algorithm, which enables such hierarchical partitioning. We have implemented a hierarchical scheduler in Solaris 2.4. We describe our implementation, and demonstrate its suitability for multimedia operating systems.

Pawan Goyal, Univesity of Texas at Austin

Xingang Guo, Univesity of Texas at Austin

Harrick M. Vin, Univesity of Texas at Austin

BibTeX
@inproceedings {260689,
author = {Pawan Goyal and Xingang Guo and Harrick M. Vin},
title = {A Hierarchical {CPU} Scheduler for Multimedia Operating Systems},
booktitle = {USENIX 2nd Symposium on OS Design and Implementation (OSDI 96)},
year = {1996},
address = {Seattle, WA},
url = {https://www.usenix.org/conference/osdi-96/hierarchical-cpu-scheduler-multimedia-operating-systems},
publisher = {USENIX Association},
month = oct
}
Download

Links

Paper (HTML): 
http://usenix.org/publications/library/proceedings/osdi96/full_papers/vin/html/index.html
  • Log in or register to post comments

© USENIX
EIN 13-3055038

  • Privacy Policy
  • Contact Us