Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling

DOI10.1016/0743-7315(92)90020-NzbMath0768.68004OpenAlexW1985292869MaRDI QIDQ1208593

Virginia M. Lo

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90020-n

zbMATH Keywords

schedulingparallel computationparallel algorithmparallel programmingLamport's process- time graphsstatic task graphtemporal communication graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

This page was built for publication: Temporal communication graphs: Lamport's process-time graphs augmented for the purpose of mapping and scheduling