Sciweavers

103 search results - page 4 / 21
» Online weighted flow time and deadline scheduling
Sort
View
RTCSA
2003
IEEE
15 years 7 months ago
Deterministic and Statistical Deadline Guarantees for a Mixed Set of Periodic and Aperiodic Tasks
Current hard real-time technologies are unable to support a new class of applications that have real-time constraints but with dynamic request arrivals and unpredictable resource r...
Minsoo Ryu, Seongsoo Hong
109
Voted
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 11 months ago
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
Benjamin Moseley, Sungjin Im
SPAA
2005
ACM
15 years 7 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
15 years 8 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
103
Voted
ICC
2007
IEEE
102views Communications» more  ICC 2007»
15 years 8 months ago
Fair Scheduling for On-Demand Time-Critical Data Broadcast
— This paper presents a fair scheduling scheme for on-line scheduling on-demand time-critical data broadcast in the context of real-time information dissemination. The design of ...
Chih-Lin Hu