82 search results - page 1 / 17 » An Improved Competitive Algorithm for Reordering Buffer Mana... |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
STOC
2007
ACM
14 years 7 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...
ICPP
1998
IEEE
13 years 11 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
ESA
2009
Springer
14 years 7 hour ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...