13 citations · 60 across the 31 of their papers we have counts for
Showing 2017 · cs.DSShow all
3 papers · 2 filters
cs.DS2017
Online Load Balancing for Related Machines
Sungjin Im, Nathaniel Kell, Debmalya Panigrahi +1
In the load balancing problem, introduced by Graham in the 1960s (SIAM J. of Appl. Math. 1966, 1969), jobs arriving online have to be assigned to machines so to minimize an objecti…
cs.DS2017★ 2 cited
An O(log log m)-competitive Algorithm for Online Machine Minimization
Sungjin Im, Benjamin Moseley, Kirk Pruhs +1
This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where eac…
cs.DS2017
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time
Sungjin Im, Manish Purohit
Co-flows model a modern scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. In co-flow scheduling, there are input ports…