NDLI: Fair and timely scheduling via cooperative polling

Please wait, while we are loading the content...

SnowFlock: rapid virtual machine cloning for cloud computing

Orchestra: intrusion detection using parallel execution and monitoring of program variants in user-space

Memory resource allocation for file system prefetching: from a supply chain management perspective

SCAN-Lite: enterprise-wide analysis on the cheap

First-aid: surviving and preventing memory management bugs during production runs

Tralfamadore: unifying source code and execution experience

User interactions in social networks and their implications

xCalls: safe I/O in memory transactions

Koala: a platform for OS-level power management

Automated control of multiple virtualized resources

Multi-aspect profiling of kernel rootkit behavior

Towards practical page coloring-based multicore cache management

Effective and efficient compromise recovery for weakly consistent replication

Transparent checkpoints of closed distributed systems in Emulab

Isolating web programs in modern browser architectures

A runtime system for software lock elision

Predicting replicated database scalability from standalone database profiling

Improving the responsiveness of internet services with automatic cache placement

Pointless tainting?: evaluating the practicality of pointer tainting

Fair and timely scheduling via cooperative polling

Migrating server storage to SSDs: analysis of tradeoffs

Ksplice: automatic rebootless kernel updates

Privacy-preserving browser-side scripting with BFlow

Dingo: taming device drivers

Statistical profiling-based techniques for effective power provisioning in data centers

Fair and timely scheduling via cooperative polling

Content Provider	ACM Digital Library
Author	Sinha, Anirban Goel, Ashvin Saubhasik, Mayukh Krasic, Charles
Abstract	Advances in hardware capacity, especially I/O devices such as cameras and displays, are driving the development of applications like high-definition video conferencing that have tight timing and CPU requirements. Unfortunately, current operating systems do not adequately provide the timing response needed by these applications. In this paper, we present a hierarchical scheduling model that aims to provide these applications with tight timing response, while at the same time preserve the strengths of current schedulers, namely fairness and efficiency. Our approach, called cooperative polling, consists of an application-level event scheduler and a kernel thread scheduler that cooperate to dispatch time-constrained application events accurately and with minimal kernel preemption, while still ensuring rigorously that all applications share resources fairly. Fairness is enforced in a flexible manner, allowing sharing according to a mixture of both traditional resource-centric metrics and new application-centric metrics, the latter being critical to support graceful application-level adaptation in overload. Unlike traditional real-time systems, our model does not require specification or estimation of resource requirements, simplifying its usage dramatically. Our evaluation, using an adaptive video application and a graphics server, shows that our system has event dispatch accuracies that are one to two orders of magnitude smaller than are achieved by existing schedulers. At the same time, our scheduler still maintains fairness and has low overhead.
Starting Page	103
Ending Page	116
Page Count	14
File Format	PDF
ISBN	9781605584829
DOI	10.1145/1519065.1519077
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-04-01
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Timeliness Fairness
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fair and timely scheduling via cooperative polling.

Achieving predictable timing and fairness through cooperative polling (2007).

Non-monetary fair scheduling: a cooperative game theory approach

On timeliness of a fair non-repudiation protocol

Fair share is not enough: measuring fairness in scheduling with cooperative game theory

Cooperative proportional fairness scheduling for wireless transmissions

Achieving predictable timing and fairness through cooperative polling.

Achieving predictable timing and fairness through cooperative polling

Fair-Share Scheduling for Performance-Asymmetric Multicore Architecture via Scaled Virtual Runtime

Fair and timely scheduling via cooperative polling

Similar Documents

Fair and timely scheduling via cooperative polling.

Achieving predictable timing and fairness through cooperative polling (2007).

Non-monetary fair scheduling: a cooperative game theory approach

On timeliness of a fair non-repudiation protocol

Fair share is not enough: measuring fairness in scheduling with cooperative game theory

Cooperative proportional fairness scheduling for wireless transmissions

Achieving predictable timing and fairness through cooperative polling.

Achieving predictable timing and fairness through cooperative polling

Fair-Share Scheduling for Performance-Asymmetric Multicore Architecture via Scaled Virtual Runtime

Fair and timely scheduling via cooperative polling