800 search results - page 19 / 160 » Understanding Algorithm Performance on an Oversubscribed Sch... |
APPROX
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
SPAA
2005
ACM
14 years 28 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
MOBICOM
2009
ACM
14 years 1 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
IAJIT
2008
13 years 7 months ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...