641 search results - page 12 / 129 » On robust online scheduling algorithms |
182
click to vote
VLSID
2002
IEEE
15 years 9 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
150
click to vote
FPL
2000
Springer
15 years 8 months ago
2000
Springer
Message sequencing and channel assignment are two important aspects to consider in optimizing the performance of Wavelength Division Multiplexing (WDM) networks. A scheduling techn...
140
click to vote
SWAT
2004
Springer
15 years 9 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...
128
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
157
click to vote
HPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...