Sciweavers

1758 search results - page 87 / 352
» Schedule processes, not VCPUs
Sort
View
FAST
2011
14 years 10 months ago
A Scheduling Framework That Makes Any Disk Schedulers Non-Work-Conserving Solely Based on Request Characteristics
Exploiting spatial locality is critical for a disk scheduler to achieve high throughput. Because of the high cost of disk head seeks and the non-preemptible nature of request serv...
Yuehai Xu, Song Jiang
RTAS
1999
IEEE
15 years 11 months ago
User Level Scheduling of Communicating Real-Time Tasks
Unique challenges are present when one tries to build distributed real-time applications using standard o -the-shelf systems which are in common use but are not necessarily design...
Chia Shen, Oscar González, Krithi Ramamrith...
SOSP
2001
ACM
16 years 3 months ago
Anticipatory scheduling: A disk scheduling framework to overcome deceptive idleness in synchronous I/O
Disk schedulers in current operating systems are generally work-conserving, i.e., they schedule a request as soon as the previous request has finished. Such schedulers often requ...
Sitaram Iyer, Peter Druschel
RTCSA
1998
IEEE
15 years 11 months ago
Partition Scheduling in APEX Runtime Environment for Embedded Avionics Software
Advances in the computer technology encouraged the avionics industry to replace the federated design of control units with an integrated suite of control modules that share the co...
Yann-Hang Lee, Daeyoung Kim, Mohamed F. Younis, Je...
IOR
2010
161views more  IOR 2010»
15 years 5 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz