1095 search results - page 40 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
126
Voted
DAC
2000
ACM
16 years 5 months ago
2000
ACM
Memory delays represent a major bottleneck in embedded systems performance. Newer memory modules exhibiting efficient access modes (e.g., page-, burst-mode) partly alleviate this ...
115
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper introduces an efficient multithreaded synchronous dataflow (SDF) scheduler that can significantly reduce the running time of multi-rate SDF simulations on multiprocesso...
114
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...
180
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
153
click to vote
IPPS
2009
IEEE
15 years 10 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...