265 citations · 441 across the 39 of their papers we have counts for
4 papers · 1 filter
Tight Bounds for Online Vector Scheduling
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni +1
Modern data centers face a key challenge of effectively serving user requests that arrive online. Such requests are inherently multi-dimensional and characterized by demand vectors…
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 …
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…
Minimizing Flow-Time on Unrelated Machines
Nikhil Bansal, Janardhan Kulkarni
We consider some flow-time minimization problems in the unrelated machines setting. In this setting, there is a set of machines and a set of jobs, and each job has a ma…