Sciweavers

3934 search results - page 168 / 787
» Approximate Schedulability Analysis
Sort
View
ICPADS
2006
IEEE
16 years 14 days ago
Flexible, Low-overhead Event Logging to Support Resource Scheduling
Flexible resource management and scheduling policies require detailed system-state information. Traditional, monolithic operating systems with a centralized kernel derive the requ...
Jan Stoess, Volkmar Uhlig
RTAS
2010
IEEE
15 years 4 months ago
Reservation-Based Interrupt Scheduling
Abstract—Some real-time kernels (such as a recent realtime version of Linux) permit to execute interrupt handlers in dedicated threads, to control their interference on realtime ...
Nicola Manica, Luca Abeni, Luigi Palopoli
STOC
2002
ACM
118views Algorithms» more  STOC 2002»
16 years 6 months ago
On the advantage over a random assignment
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
Johan Håstad, Srinivasan Venkatesh
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
16 years 1 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
STOC
1998
ACM
89views Algorithms» more  STOC 1998»
15 years 10 months ago
Minimizing Stall Time in Single and Parallel Disk Systems
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...
Susanne Albers, Naveen Garg, Stefano Leonardi