Sciweavers

82 search results - page 11 / 17
» Maximizing Job Completions Online
Sort
View
ICS
2005
Tsinghua U.
14 years 1 months ago
Power-aware resource allocation in high-end systems via online simulation
Traditionally, scheduling in high-end parallel systems focuses on how to minimize the average job waiting time and on how to maximize the overall system utilization. Despite the d...
Barry Lawson, Evgenia Smirni
CORR
2010
Springer
156views Education» more  CORR 2010»
13 years 6 months ago
Scheduling Periodic Real-Time Tasks with Heterogeneous Reward Requirements
—We study the problem of scheduling periodic real-time tasks which have individual minimum reward requirements. We consider situations where tasks generate jobs that can be provi...
I-Hong Hou, P. R. Kumar
RTSS
2005
IEEE
14 years 1 months ago
Energy-Aware Modeling and Scheduling of Real-Time Tasks for Dynamic Voltage Scaling
Abstract— Dynamic voltage scaling (DVS) is a promising technique for battery-powered systems to conserve energy consumption. Most existing DVS algorithms assume information about...
Xiliang Zhong, Cheng-Zhong Xu
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 1 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
11 years 10 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...