Communication contention in APN list scheduling algorithm

DOI10.1007/s11432-009-0010-3zbMath1181.90127OpenAlexW2129931266MaRDI QIDQ2267003

Xiaoyong Tang, Divid Padua, KenLi Li

Publication date: 26 February 2010

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-009-0010-3

zbMATH Keywords

list schedulingparallel algorithmDAGcommunication contentionarbitrary processor network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

List scheduling with duplication for heterogeneous computing systems ⋮ Reliability-aware scheduling strategy for heterogeneous distributed computing systems ⋮ Advanced list scheduling heuristic for task scheduling with communication contention for parallel embedded systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• A two-pass scheduling algorithm for parallel programs
• An analysis of parallel heuristics for task allocation in multicomputers
• Iterative list scheduling for heterogeneous computing
• An integrated technique for task matching and scheduling onto distributed heterogeneous computing systems.
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Optimal Scheduling Strategies in a Multiprocessor System

This page was built for publication: Communication contention in APN list scheduling algorithm