42 citations · 252 across the 52 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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.DS2014★ 9 cited
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
We introduce and study a general scheduling problem that we term the Packing Scheduling problem. In this problem, jobs can have different arrival times and sizes; a scheduler can p…