28 search results - page 5 / 6 » Preemptive Online Scheduling with Reordering |
150
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
187
Voted
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
Computational grids offer users a simple access to tremendous computer resources for solving large scale computing problems. Traditional performance analysis of scheduling algorit...
148
click to vote
LCTRTS
1995
Springer
15 years 9 months ago
1995
Springer
In this paper, we present a preemptive joint scheduling of hard deadline periodic and hard deadline aperiodic tasks on a uniprocessor real-time system. The scheduling has extended...
169
Voted
RTAS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of energy minimization for periodic preemptive hard real-time tasks that are scheduled on an identical multiprocessor platform with dynamic voltage scaling...
142
click to vote
HPDC
2007
IEEE
15 years 12 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...