Sciweavers

1531 search results - page 30 / 307
» A performance study of multiprocessor task scheduling algori...
Sort
View
ECRTS
2002
IEEE
14 years 10 days ago
Robustness results concerning EDF scheduling upon uniform multiprocessors
—Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s fo...
Sanjoy K. Baruah
LCTRTS
1995
Springer
13 years 11 months ago
Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
Jongwon Lee, Sungyoung Lee, Hyungill Kim
SIGMETRICS
2009
ACM
103views Hardware» more  SIGMETRICS 2009»
14 years 1 months ago
Restrained utilization of idleness for transparent scheduling of background tasks
A common practice in system design is to treat features intended to enhance performance and reliability as low priority tasks by scheduling them during idle periods, with the goal...
Ningfang Mi, Alma Riska, Xin Li, Evgenia Smirni, E...
SPDP
1991
IEEE
13 years 11 months ago
A decentralized task scheduling algorithm and its performance modeling for computer networks
A dynamic taskschedulingalgorithm,that isstable,decentralized,and adaptivetonetwork topology,ispresented. Theproposedalgorithmisanextensionofnearestneighbor loadbalancingstrategyw...
Ishfaq Ahmad, Arif Ghafoor, Kishan G. Mehrotra
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
14 years 2 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini