Sciweavers

1673 search results - page 153 / 335
» Generalized Elastic Scheduling
Sort
View
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 years 12 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
COR
2007
80views more  COR 2007»
15 years 6 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
INFOCOM
2010
IEEE
15 years 4 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
RTAS
2010
IEEE
15 years 4 months ago
DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling
—Hardware-managed caches introduce large amounts of timing variability, complicating real-time system design. One alternative is a memory system with scratchpad memories which im...
Sangyeol Kang, Alexander G. Dean
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
15 years 4 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li