Implementing dataflow with threads

DOI10.1007/S00446-008-0065-1MaRDI QIDQ2377253zbMATH OpenOpenAlexFDO

Authors Leslie Lamport

Publication date 28 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-008-0065-1

zbMATH Keywords

dataflowmarked graphsmultiprocess synchronization

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Cites work

• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• scientific article; zbMATH DE number 1106703 (Why is no real title available?)
• scientific article; zbMATH DE number 1390334 (Why is no real title available?)
• Marked directed graphs
• On interprocess communication. I: Basic formalism
• Proving the Correctness of Multiprocess Programs

Cited in

(1)

• Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API

This page was built for publication: Implementing dataflow with threads

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