Sciweavers

1095 search results - page 9 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Scheduling in mapreduce-like systems for fast completion time
Abstract—Large-scale data processing needs of enterprises today are primarily met with distributed and parallel computing in data centers. MapReduce has emerged as an important p...
Hyunseok Chang, Murali S. Kodialam, Ramana Rao Kom...
69
Voted
HPCA
2006
IEEE
15 years 10 months ago
Efficient instruction schedulers for SMT processors
We propose dynamic scheduler designs to improve the scheduler scalability and reduce its complexity in the SMT processors. Our first design is an adaptation of the recently propos...
Joseph J. Sharkey, Dmitry V. Ponomarev
ALT
1997
Springer
15 years 1 months ago
Learning One-Variable Pattern Languages Very Efficiently on Average, in Parallel, and by Asking Queries
A pattern is a string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from by substituti...
Thomas Erlebach, Peter Rossmanith, Hans Stadtherr,...
BIRTHDAY
2009
Springer
15 years 1 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
85
Voted
COR
2007
80views more  COR 2007»
14 years 9 months ago
Scheduling with tool changes to minimize total completion time under controllable machining conditions
Scheduling under controllable machining conditions has been studied for some time. Scheduling with tool changes, particularly due to tool wear, has just begun to receive attention...
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan