Complexity of Task Graph Scheduling with Fixed Communication Capacity

DOI10.1142/S0129054197000045zbMath0870.68026OpenAlexW2126365117MaRDI QIDQ4341041

Zhen Liu, Lucian Finta

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

parallel computationsmultiprocessor systemsscheduling problem

Mathematics Subject Classification ID

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

Related Items (1)

Scheduling in the presence of processor networks : complexity and approximation

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