1420 search results - page 115 / 284 » A Framework for Scheduler Synthesis |
152
click to vote
IPPS
2009
IEEE
16 years 28 days ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
155
click to vote
EMSOFT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
144
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
179
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
159
click to vote
ICMCS
2005
IEEE
15 years 12 months ago
2005
IEEE
The loss and delay experienced by packets travelling along an Internet network path are mainly governed by the characteristics of a bottleneck link, such as available data rate an...