254 search results - page 31 / 51 » Approximation Algorithms for Scheduling Parallel Jobs |
117
click to vote
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
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...
FPGA
2009
ACM
15 years 5 months ago
2009
ACM
Reconfigurable high-performance computing systems (RHPC) have been attracting more and more attention over the past few years. RHPC systems are a promising solution for accelerati...
117
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...
92
Voted
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
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...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...