1095 search results - page 60 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
91
Voted
ICPADS
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
PDPTA
2004
14 years 11 months ago
2004
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
92
Voted
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
87
Voted
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
ESA
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...