Sciweavers

84 search results - page 9 / 17
» Online real-time preemptive scheduling of jobs with deadline...
Sort
View
RTCSA
2005
IEEE
14 years 1 months ago
Quasi-Static Scheduling for Multiprocessor Real-Time Systems with Hard and Soft Tasks
We address in this paper the problem of scheduling for multiprocessor real-time systems with hard and soft tasks. Utility functions are associated to soft tasks to capture their r...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
14 years 8 days ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
RTSS
1992
IEEE
13 years 11 months ago
Scheduling Sporadic Tasks with Shared Resources in Hard-Real-Time Systems
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
Kevin Jeffay
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 5 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
ICCD
2006
IEEE
126views Hardware» more  ICCD 2006»
14 years 4 months ago
Task Merging for Dynamic Power Management of Cyclic Applications in Real-Time Multi-Processor Systems
—In this paper we propose the method of task merging and idle period clustering for dynamic power management (DPM) in a real-time system with multiple processing elements. We sho...
Shaobo Liu, Qinru Qiu, Qing Wu