SwePub - sökning: id:"swepub:oai:research.chalme...

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:cb45b3d4-e7a6-48ef-aa2e-a2e12eab7246" "

Sökning: id:"swepub:oai:research.chalmers.se:cb45b3d4-e7a6-48ef-aa2e-a2e12eab7246"

Sortera/gruppera träfflistan

Sortering: Träffar per sida:

Numrering	Referens	Omslagsbild	Hitta
1.	Andersson, Björn, 1974, et al. (författare) Global Priority-Driven Aperiodic Scheduling on Multiprocessors 2003 Ingår i: Proceedings. International Parallel and Distributed Processing Symposium, 2003. - 1530-2075. - 0769519261 Konferensbidrag (refereegranskat)abstract This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.

Skapa referenser, mejla, bekava och länka

Träfflista för sökning "id:"swepub:oai:research.chalmers.se:cb45b3d4-e7a6-48ef-aa2e-a2e12eab7246" "