ACM Home Page
Please provide us with feedback. Feedback
Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler
Full text pdf formatPdf (1.81 MB)
Source ACM SIGOPS Operating Systems Review archive
Volume 33 ,  Issue 5  (December 1999) table of contents
Pages: 261 - 276  
Year of Publication: 1999
ISSN:0163-5980
Also published in ...
Authors
Kenneth J. Duda  Computer Science Department, Stanford University
David R. Cheriton  Computer Science Department, Stanford University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 143,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/319344.319169
What is a DOI?

ABSTRACT

Systems need to run a larger and more diverse set of applications, from real-time to interactive to batch, on uniprocessor and multiprocessor platforms. However, most schedulers either do not address latency requirements or are specialized to complex real-time paradigms, limiting their applicability to general-purpose systems.In this paper, we present Borrowed-Virtual-Time (BVT) Scheduling, showing that it provides low-latency for real-time and interactive applications yet weighted sharing of the CPU across applications according to system policy, even with thread failure at the real-time level, all with a low-overhead implementation on multiprocessors as well as uniprocessors. It makes minimal demands on application developers, and can be used with a reservation or admission control module for hard real-time applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Brin. Personal communication. www. google, corn, 1999.
2
 
3
K. J. Duda and D. R. Cheriton. Borrowedvirtual-time (BVT) scheduling, ht t p: / / wwwdsg. stanford, edu/pub/bvt, html, 2000.
 
4
5
 
6
M. Jones, J. Barrera, A. Forin, P. Leach, D. Rosu, and M. Rosu. An overview of the Rialto real-time architecture. Microsoft Research Technical Report MSR-TR- 96-13, July 1996. Microsoft Inc., Redmond, WA.
7
 
8
C. W. Mercer, S. Savage, and H. Tokuda. Processor capacity reserves for multimedia operating systems. Proceedings of the IEEE International Conference on Multimedia Computing and Systems, pages 90-99, May 1994.
9
 
10
11
12
 
13
 
14
C. Waldspurger and W. Weihl. Lottery scheduling: Flexible proportional-share resource mangement. Proceedings of the First Symposium on Operating System Design and Implementation, pages 1-11, November 1994.

CITED BY  26
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Kenneth J. Duda: colleagues
David R. Cheriton: colleagues

Peer to Peer - Readers of this Article have also read: