Complexity of Task Graph Scheduling with Fixed Communication Capacity

DOI10.1142/S0129054197000045MaRDI QIDQ4341041zbMATH OpenOpenAlexFDO

Authors Lucian Finta, Zhen Liu

Publication date 16 June 1997

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054197000045

zbMATH Keywords

multiprocessor systemsparallel computationsscheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Scheduling with interjob communication on parallel processors
• Complexity of Scheduling Parallel Task Systems
• Scheduling in the presence of processor networks : complexity and approximation
• scientific article; zbMATH DE number 1424438
• Task scheduling with interprocessor communication delays

Cited in

(10)

• Task scheduling with interprocessor communication delays
• Scheduling with interjob communication on parallel processors
• Complexity of master-slave tasking on heterogeneous trees
• Unconstrained static scheduling with communication weights
• Scheduling in the presence of processor networks : complexity and approximation
• Scheduling with interjob communication on parallel processors
• Task ordering and memory management problem for degree of parallelism estimation
• Scheduling on Two Unbounded Resources with Communication Costs
• scientific article; zbMATH DE number 2081021 (Why is no real title available?)
• scientific article; zbMATH DE number 1424463 (Why is no real title available?)

This page was built for publication: Complexity of Task Graph Scheduling with Fixed Communication Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341041)