1 citations · 1 across the 3 of their papers we have counts for
5 papers
Scheduling Splittable Jobs on Configurable Machines
Matthew Casey, Rajmohan Rajaraman, David Stalfa
Motivated by deep neural network applications, we study the problem of scheduling splittable jobs (e.g., neural network inference tasks) on configurable machines (e.g., multi-insta…
Scheduling under Non-Uniform Job and Machine Delays
Rajmohan Rajaraman, David Stalfa, Sheng Yang
We study the problem of scheduling precedence-constrained jobs on heterogenous machines in the presence of non-uniform job and machine communication delays. We are given as input $…
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints
Searidang Pa, Rajmohan Rajaraman, David Stalfa
We study flow scheduling under node capacity constraints. We are given capacitated nodes and an online sequence of jobs, each with a release time and a demand to be routed between…
Scheduling Flows on a Switch to Optimize Response Times
Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa
We study the scheduling of flows on a switch with the goal of optimizing metrics related to the response time of the flows. The input to the problem is a sequence of flow requests…
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa +2
We consider the problem of scheduling precedence-constrained jobs on uniformly-related machines in the presence of an arbitrary, fixed communication delay . We consider…