Sciweavers

57 search results - page 3 / 12
» Improved multiprocessor global schedulability analysis
Sort
View
RTSS
2005
IEEE
14 years 4 months ago
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
We consider the scheduling of a sporadic real-time task system on an identical multiprocessor. Though Pfair algorithms are theoretically optimal for such task systems, in practice...
UmaMaheswari C. Devi, James H. Anderson
ECRTS
2008
IEEE
14 years 5 months ago
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal sch...
Insik Shin, Arvind Easwaran, Insup Lee
ECRTS
2010
IEEE
13 years 11 months ago
Improved Tardiness Bounds for Global EDF
The Earliest Deadline First scheduling algorithm (EDF) is known to not be optimal under global scheduling on multiprocessor platforms. Results have been obtained that bound the ma...
Jeremy P. Erickson, UmaMaheswari Devi, Sanjoy K. B...
CORR
2010
Springer
217views Education» more  CORR 2010»
13 years 5 months ago
Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms
Algorithms based on semi-partitioned scheduling have been proposed as a viable alternative between the two extreme ones based on global and partitioned scheduling. In particular, ...
François Dorin, Patrick Meumeu Yomsi, Jo&eu...
DATE
2009
IEEE
115views Hardware» more  DATE 2009»
14 years 5 months ago
Response-time analysis of arbitrarily activated tasks in multiprocessor systems with shared resources
—As multiprocessor systems are increasingly used in real-time environments, scheduling and synchronization analysis of these platforms receive growing attention. However, most kn...
Mircea Negrean, Simon Schliecker, Rolf Ernst