Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
From MaRDI portal
Publication:3833608
DOI10.1137/0218016zbMath0677.68026OpenAlexW2065689629MaRDI QIDQ3833608
Frank D. Anger, Chung-Yee Lee, Yuan-Chieh Chow, Jing-Jang Hwang
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7dad526fc681a0808b0163c29d8e4bd92785b952
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (32)
Scheduling in the presence of processor networks : complexity and approximation ⋮ CRITICAL PATH SCHEDULING PARALLEL PROGRAMS ON AN UNBOUNDED NUMBER OF PROCESSORS ⋮ Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays ⋮ On the Complexity of Scheduling to Optimize Average Response Time ⋮ Parallel Machine Scheduling with Uncertain Communication Delays ⋮ Entropic grid scheduling ⋮ Trusted dynamic level scheduling based on Bayes trust model ⋮ Reducing the solution space of optimal task scheduling ⋮ Satisfiability modulo theory (SMT) formulation for optimal scheduling of task graphs with communication delay ⋮ A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS ⋮ Decentralized list scheduling ⋮ Open shop scheduling with delays ⋮ Scheduling malleable tasks with precedence constraints ⋮ A comparison of multiprocessor task scheduling algorithms with communication costs ⋮ Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks ⋮ SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS ⋮ An EPTAS for scheduling fork-join graphs with communication delay ⋮ An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays ⋮ Scheduling with uncertainties on new computing platforms ⋮ Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage ⋮ Scheduling \(UET\)-tasks on a star network: complexity and approximation ⋮ Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems ⋮ List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity ⋮ Algorithms for hierarchical and semi-partitioned parallel scheduling ⋮ A bipartite genetic algorithm for multi-processor task scheduling ⋮ Task scheduling with and without communication delays: A unified approach ⋮ On-line Scheduling with Optimal Worst-Case Response Time ⋮ Scheduling Precedence Task Graphs with Disturbances ⋮ Scheduling 2-dimensional grids with large communication delays ⋮ CLUSTER-BASED TASK SCHEDULING FOR THE LOGP MODEL ⋮ A standard task graph set for fair evaluation of multiprocessor scheduling algorithms ⋮ Two-way dominant sequence clustering for processor scheduling
This page was built for publication: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
