Adaptive CPU Scheduling Policies for Mixed Multimedia and Best-Effort Workloads
نویسندگان
چکیده
As multimedia applications with real-time constraints rapidly invade today’s desktops, it becomes increasingly important for the operating system to provide robust resource allocation mechanisms for both multimedia and traditional best-effort workloads. We present a flexible CPU scheduling policy that adjusts the CPU proportion allocated to each application class using recent history as a feedback mechanism. The algorithm quickly adapts to varying workload conditions and compares favorably with static proportional scheduling schemes for mixed workloads.
منابع مشابه
The BEST Desktop Soft Real-Time Scheduler
Best-effort CPU scheduling is an attractive model for desktop computing because it is simple to use. However, best-effort models do not provide support for applications with deadlines. Soft real-time schedulers allocate the CPU for workloads containing soft deadlines by relying on developers and users to supply timing requirements to the system. BEST is an enhanced best-effort scheduler designe...
متن کاملMedia Applications on Hyper-Threading Technology
This paper characterizes selected workloads of multimedia applications on current superscalar architectures, and then it characterizes the same workloads on Intel HyperThreading Technology. The workloads, including video encoding, decoding, and watermark detection, are optimized for the Intel Pentium 4 processor. One of the workloads is even commercially available and it performs best on the Pe...
متن کاملOperating system support for multimedia systems
Distributed multimedia applications will be an important part of tomorrow’s application mix and require appropriate operating system (OS) support. Neither hard real-time solutions nor best-effort solutions are directly well suited for this support. One reason is the coexistence of real-time and best effort requirements in future systems. Another reason is that the requirements of multimedia app...
متن کاملBetter Real-Time Response for Time-Share Scheduling
Time-share CPU schedulers permeate general-purpose computer systems, yet provide little support for real-time constraints. We demonstrate that by making inferences from the behavior of applications, soft real-time scheduling performance is achievable using a best-effort policy in which the scheduler has no a priori knowledge of application resource needs. In a typical time-share scheduler, rece...
متن کاملCHAMELEON: A Self-Evolving, Fully-Adaptive Resource Arbitrator for Storage Systems
Enterprise applications typically depend on guaranteed performance from the storage subsystem, lest they fail. However, unregulated competition is unlikely to result in a fair, predictable apportioning of resources. Given that widespread access protocols and scheduling policies are largely best-effort, the problem of providing performance guarantees on a shared system is a very difficult one. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999