1095 search results - page 3 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
: A new technique is presented in this paper to improve the efficiency of data scheduling for multi-context reconfigurable architectures targeting multimedia and DSP applications. ...
106
click to vote
SCHEDULING
2008
14 years 9 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
SIGCOMM
1996
ACM
15 years 1 months ago
1996
ACM
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
73
Voted
IROS
2007
IEEE
15 years 4 months ago
2007
IEEE
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
ECRTS
2000
IEEE
15 years 2 months ago
2000
IEEE
We present a variant of Pfair scheduling, which we call early-release fair (ERfair) scheduling. Like conventional Pfair scheduling, ERfair scheduling algorithms can be applied to ...