Sciweavers

7 search results - page 1 / 2
» Cost sharing in a job scheduling problem using the Shapley v...
Sort
View
SIGECOM
2005
ACM
109views ECommerce» more  SIGECOM 2005»
13 years 10 months ago
Cost sharing in a job scheduling problem using the Shapley value
A set of jobs need to be served by a single server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The j...
Debasis Mishra, Bharath Rangarajan
ISPDC
2007
IEEE
13 years 11 months ago
Divisible Load Scheduling: An Approach Using Coalitional Games
Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling ...
Thomas E. Carroll, Daniel Grosu
PVLDB
2010
179views more  PVLDB 2010»
13 years 3 months ago
MRShare: Sharing Across Multiple Queries in MapReduce
Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrast...
Tomasz Nykiel, Michalis Potamias, Chaitanya Mishra...
SOSP
2009
ACM
14 years 1 months ago
Quincy: fair scheduling for distributed computing clusters
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
Michael Isard, Vijayan Prabhakaran, Jon Currey, Ud...
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
13 years 11 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...