1792 search results - page 13 / 359 » Improved scheduling in rings |
SSS
2007
Springer
14 years 1 months ago
2007
Springer
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms, and presented three such algorithms for the problem of mutual exclusion on a ring of processors. The thir...
AIPS
2004
13 years 8 months ago
2004
In this paper we analyze and extend a recently developed "task-swapping procedure" for improving schedules in oversubscribed situations. In such situations, there are ta...
ECRTS
2005
IEEE
14 years 1 months ago
2005
IEEE
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...
CGO
2003
IEEE
14 years 20 days ago
2003
IEEE
Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and