Scheduling with Communication Delay in Near-Linear Time

@inproceedings{Liu2021SchedulingWC,
  title={Scheduling with Communication Delay in Near-Linear Time},
  author={Quanquan C. Liu and Manish Purohit and Zoya Svitkina and Erik Vee and Joshua R. Wang},
  booktitle={Symposium on Theoretical Aspects of Computer Science},
  year={2021}
}
We consider the problem of efficiently scheduling jobs with precedence constraints on a set of identical machines in the presence of a uniform communication delay. Such precedence-constrained jobs can be modeled as a directed acyclic graph, G = ( V, E ). In this setting, if two precedence-constrained jobs u and v , with v dependent on u ( u ≺ v ), are scheduled on different machines, then v must start at least ρ time units after u completes. The scheduling objective is to minimize makespan, i.e… 
[PDF] Semantic Reader
3 Citations

Figures and Tables from this paper

3 Citations

Approximation Algorithms for Scheduling under Non-Uniform Machine-Dependent Delays

The results represent the first polylogarithmic approximation algorithms for scheduling with non-uniform communication delays and include schedules which allow duplication of jobs as well as schedules which do not.

Scheduling under Non-Uniform Job and Machine Delays

An approximation-preserving reduction from the Unique Machines Precedence-constrained Scheduling ( UMPS) problem is presented, and the best approximation for non-uniform delays is provided for the setting with uniform speeds, uniform sizes, and no job delays.

DAG Scheduling in the BSP Model

A detailed taxonomy of simpler scheduling models that can be understood as variants or special cases of BSP, and discuss the properties of the problem and the optimum cost in these models, and how they differ from BSP.

References

SHOWING 1-10 OF 28 REFERENCES

Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay

This work considers the problem of scheduling precedence-constrained jobs on uniformly-related machines in the presence of an arbitrary, fixed communication delay and presents a polynomial time algorithm to transform any schedule to a schedule without duplication at the cost of an increase in makespan polylogarithmic in the number of jobs and machines.

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints

It is shown that there exists a $(1+\epsilon)$-approximation algorithm (with similar running time) for the non-migratory setting: when every job has to be scheduled entirely on a single machine, but within a machine the job need not be scheduled during consecutive time steps.

OR scheduling algorithms.

A schedule is proposed which minimizes the makespan, the time when the last job is completed, and the constraints are that a job can only be scheduled after its release time, and preemption is not allowed.

Optimal Scheduling Algorithm for Distributed-Memory Machines

A Task Duplication based Scheduling (TDS) algorithm which can schedule directed acyclic graphs (DAGs) with a complexity of O(|V|/sup 2/), where |V| is the number of tasks in the DAG.

UET scheduling with unit interprocessor communication delays

On the complexity of scheduling with large communication delays

Compaction of Schedules and a Two-Stage Approach for Duplication-Based DAG Scheduling

This work proposes a generic algorithm, SC, to minimize the processor requirement of any given valid schedule, which preserves the schedule length of the original schedule and reduces processor count by merging processor schedules and removing redundant duplicate tasks.

Three, four, five, six, or the complexity of scheduling with communication delays

On Exploiting Task Duplication in Parallel Program Scheduling

This paper describes some of the essential principles for exploiting duplication in a more useful manner and, based on these principles, proposes an algorithm which outperforms the previous algorithms and generates optimal solutions for a number of task graphs.

An optimal algorithm for the distinct elements problem

The first optimal algorithm for estimating the number of distinct elements in a data stream is given, closing a long line of theoretical research on this problem, and has optimal O(1) update and reporting times.