Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler

  • Authors:
  • Kenneth J. Duda;David R. Cheriton

  • Affiliations:
  • Computer Science Department, Stanford University;Computer Science Department, Stanford University

  • Venue:
  • Proceedings of the seventeenth ACM symposium on Operating systems principles
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.