841 search results - page 76 / 169 » Job Scheduling in Rings |
171
click to vote
DSN
2008
IEEE
16 years 25 days ago
2008
IEEE
Temporal locality in workloads creates conditions in which a server, in order to remain available, should quickly process bursts of requests with large service requirements. In th...
179
click to vote
CEC
2007
IEEE
16 years 22 days ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
166
click to vote
TPDS
2008
15 years 6 months ago
2008
Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever pos...
162
click to vote
ISCA
1999
IEEE
15 years 10 months ago
1999
IEEE
State of the art microprocessors achieve high performance by executing multiple instructions per cycle. In an out-oforder engine, the instruction scheduler is responsible for disp...
260
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...