Sciweavers

706 search results - page 40 / 142
» Online Interval Scheduling
Sort
View
MM
1996
ACM
150views Multimedia» more  MM 1996»
13 years 11 months ago
Adaptive Rate-Controlled Scheduling for Multimedia Applications
We present a framework for integrated scheduling of continuous media (CM) and other applications. The framework, called ARC scheduling, consists of a rate-controlled on-line CPU sc...
David K. Y. Yau, Simon S. Lam
SWAT
2004
Springer
125views Algorithms» more  SWAT 2004»
14 years 1 months ago
The Optimal Online Algorithms for Minimizing Maximum Lateness
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
Patchrawat Uthaisombut
INFOCOM
2007
IEEE
14 years 2 months ago
Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements
—We consider the problem of uplink/downlink scheduling in a multichannel wireless access point network where channel states differ across channels as well as users, vary with tim...
Koushik Kar, Xiang Luo, Saswati Sarkar
RTSS
1995
IEEE
13 years 11 months ago
Enhancing Real-Time Schedules to Tolerate Transient Faults
We present a scheme to guarantee that the execution of real-time tasks can tolerate transient and intermittent faults assuming any queue- based scheduling technique. The scheme is...
Sunondo Ghosh, Rami G. Melhem, Daniel Mossé
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini