Sciweavers

402 search results - page 5 / 81
» Gang EDF Scheduling of Parallel Task Systems
Sort
View
ICPPW
2009
IEEE
14 years 2 months ago
Evaluation of Existing Schedulability Tests for Global EDF
—The increasing attention on global scheduling algorithms for identical multiprocessor platforms produced different, independently developed, schedulability tests. However, the e...
Marko Bertogna
ECRTS
2010
IEEE
13 years 7 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...
CCGRID
2005
IEEE
14 years 1 months ago
GangSim: a simulator for grid scheduling studies
Large distributed Grid systems pose new challenges in job scheduling due to complex workload characteristics and system characteristics. Due to the numerous parameters that must b...
Catalin Dumitrescu, Ian T. Foster
IPPS
2007
IEEE
14 years 2 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
ANSS
2002
IEEE
14 years 20 days ago
Scheduling a Job Mix in a Partitionable Parallel System
Efficient scheduling of jobs on parallel processors is essential for good performance. However, design of such schedulers is challenging because of the complex interaction between...
Helen D. Karatza, Ralph C. Hilzer Jr.