790 search results - page 18 / 158 » Limits of Work-Stealing Scheduling |
94
Voted
ICPP
2003
IEEE
15 years 5 months ago
2003
IEEE
The bus that connects processors to memory is known to be a major architectural bottleneck in SMPs. However, both software and scheduling policies for these systems generally focu...
106
click to vote
ECRTS
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
111
click to vote
ISSS
1999
IEEE
15 years 4 months ago
1999
IEEE
Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity o...
RTCSA
2000
IEEE
15 years 4 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...