Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints

Pa, Searidang; Rajaraman, Rajmohan; Stalfa, David

doi:10.1137/1.9781611977059.1

Cited by 1 publication

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This research was originally published in [52,80] in collaboration with Hamidreza Jahanjou, Searidang Pa, and Rajmohan Rajaraman.…”

Section: Overview Of Results For Bandwidth Constraintsmentioning

confidence: 99%

“…Finally, Jahanjou et al prove the NP-hardness of constructing an ecfs schedule which minimizes maximum response time. Pa, Rajaraman, and Stalfa [80] extend the results of [52] for ecfs in the online setting, presenting multiple competitive algorithms for the maximum response time objective in various settings that allow for executing jobs over multiple rounds (or not). [80] also demonstrates that no meaningful competitive ratio is possible in the online setting unless the problem is relaxed in some way (e.g.…”

Section: Bandwidth Constraintsmentioning

confidence: 89%

“…This thesis presents work on delay constraints that was originally published in [72,89], and work on bandwidth constraints that was originally published in [52,80]. We include these papers in our summary of related work in order to showcase their place in the development of the these areas.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Scheduling under network communication constraints

Stalfa

View full text Add to dashboard Cite

We study problems in job scheduling in the presence of communication constraints incurred as a result of the underlying machine network. We consider types of communication constraints: delay constraints and bandwidth constraints.In the delay constraints model, jobs represent precedence-constrained tasks to be executed on machines. Communication delays lower bound the time between completiing of a job and executing its successors on different machines.Our objective is to minimize makespan. Duplication of jobs is permitted. When scheduling on related machines with uniform delay, we provide an asymptotic polylogarithmic approximation. We also consider non-uniform delays where the delay between completing a predecessor job on one machine and executing its successor on another machine is given as an summation of the out-delays of the predecessor job and machine, and the in-delays of the successor job and maching.In this setting, we provide polylogarithmic asymptotic approximations for unit size jobs and related machines. For the uniform delay setting and the symmetric in/out-delay setting we convert our asymptotic approximations into true approximations when duplication is not allowed. We also demonstrate lower bounds on the solutions attainable using our LP-based methods, as well as a general lower bound when delays can arbitrarily depend on the job and machine being communicated to.When scheduling with bandwidth constraints, jobs or flows consist of pairs of machine nodes and represent communication requests between machines. Flows have release times and demands, and nodes have a capacity on how much demand can be satisfied from adjacent flows in a given round. We provide algorithms for several different models. Online and offline settings are considered, as well as settings where jobs may be fractionally executed across multiple rounds or must be scheduled all at once. We also consider optimizing maximum and average response times, and the simultaneous optimization of both. We present algorithms for various models, each using resource augmentation in the form of augmenting the capacities of the machine nodes. We also present lower bounds for offline and online approximations.

show abstract

“…This research was originally published in [52,80] in collaboration with Hamidreza Jahanjou, Searidang Pa, and Rajmohan Rajaraman.…”

Section: Overview Of Results For Bandwidth Constraintsmentioning

confidence: 99%