Sciweavers

402 search results - page 3 / 81
» Gang EDF Scheduling of Parallel Task Systems
Sort
View
ANSS
2002
IEEE
14 years 19 days ago
Gang Scheduling Performance on a Cluster of Non-Dedicated Workstations
Clusters of workstations have emerged as a costeffective solution to high performance computing problem. To take advantage of any opportunities, however, effective scheduling tech...
Helen D. Karatza
ECRTS
2009
IEEE
13 years 5 months ago
Implementation of a Speedup-Optimal Global EDF Schedulability Test
A recent result in [13] has demonstrated the existence of a sufficient global EDF schedulability test for sporadic task systems that makes the following guarantee: any task system...
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto March...
RTS
2008
155views more  RTS 2008»
13 years 7 months ago
An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...
RTAS
2008
IEEE
14 years 2 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
Sanjoy K. Baruah, Nathan Fisher
ECRTS
2005
IEEE
14 years 1 months ago
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
Multiprocessor hardware platforms are now being considered for embedded systems, due to their high computational power and little additional cost when compared to single processor...
Marko Bertogna, Michele Cirinei, Giuseppe Lipari