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

DOI10.1016/0743-7315(92)90020-NMaRDI QIDQ1208593zbMATH OpenOpenAlexFDO

Authors 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

Lamport's process- time graphsparallel algorithmparallel computationparallel programmingschedulingstatic task graphtemporal communication graph

Mathematics Subject Classification ID

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

Recommendations

• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• A Graph-Theoretic Approach for Timing Analysis and its Implementation
• Approximating schedules for dynamic process graphs efficiently
• Assigning times to minimise reachability in temporal graphs
• scientific article; zbMATH DE number 3956422
• Relevant timed schedules/clock vectors for constructing time Petri net reachability graphs
• Mengerian temporal graphs revisited
• scientific article; zbMATH DE number 4053016

Cited in

(2)

• scientific article; zbMATH DE number 1844562 (Why is no real title available?)
• Graph-based communication in Eden

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

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