SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS

DOI10.1080/01495739708941420zbMath0886.68013OpenAlexW1973753091MaRDI QIDQ4366900

Cheng Chen, Guan-Joe Lai

Publication date: 25 November 1997

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01495739708941420

zbMATH Keywords

scheduling algorithmsnon-uniform memory accessshared-memory multiprocessor systems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• UET scheduling with unit interprocessor communication delays
• A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times

This page was built for publication: SCHEDULING PARALLEL PROGRAM TASKS WITH NON-NEGLIGIBLE INTERTASK COMMUNICATIONS ON TO NUMA MULTIPROCESSOR SYSTEMS