Sciweavers

82 search results - page 7 / 17
» Maximizing Job Completions Online
Sort
View
NSDI
2010
13 years 9 months ago
MapReduce Online
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, many implementations of MapReduce materialize the entire outp...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
ISLPED
2009
ACM
184views Hardware» more  ISLPED 2009»
14 years 2 months ago
Online work maximization under a peak temperature constraint
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
Thidapat Chantem, Xiaobo Sharon Hu, Robert P. Dick
AUSAI
2005
Springer
14 years 1 months ago
Adaptive Utility-Based Scheduling in Resource-Constrained Systems
This paper addresses the problem of scheduling jobs in soft real-time systems, where the utility of completing each job decreases over time. We present a utility-based framework fo...
David Vengerov
COCOA
2008
Springer
13 years 9 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
HICSS
2009
IEEE
104views Biometrics» more  HICSS 2009»
14 years 2 months ago
Celebrating Diversity in Volunteer Computing
The computing resources in a volunteer computing system are highly diverse in terms of software and hardware type, speed, availability, reliability, network connectivity, and othe...
David P. Anderson, Kevin Reed