3 papers
cs.DS2020
Dynamic Weighted Fairness with Minimal Disruptions
Sungjin Im, Benjamin Moseley, Kamesh Munagala +1
In this paper, we consider the following dynamic fair allocation problem: Given a sequence of job arrivals and departures, the goal is to maintain an approximately fair allocation…
cs.DS2014
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala +1
We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \emph{non-clairvoyant} setting. In this problem, a set of jobs …
cs.DS2010
The Geometry of Scheduling
Nikhil Bansal, Kirk Pruhs
We consider the following general scheduling problem: The input consists of n jobs, each with an arbitrary release time, size, and a monotone function specifying the cost incurred…