On the interconnection of message passing systems

DOI10.1016/J.IPL.2007.09.006MaRDI QIDQ2380084zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 24 March 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2007.09.006

zbMATH Keywords

design of algorithmsdistributed systemsformal methodsinterconnection networks

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Principles of Distributed Systems
• Using message passing for distributed programming: proof rules and disciplines
• Handling message semantics with Generic Broadcast protocols
• On the interconnection of causal memory systems
• Bounds on the Efficiency of Message-Passing Protocols for Parallel Computers

Cites work

• Bounded concurrent timestamp systems using vector clocks
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• The causal ordering abstraction and a simple way to implement it
• Time, clocks, and the ordering of events in a distributed system

Cited in

(4)

• An overview of message passing environments
• Constructing regular variables in message passing systems
• Message passing on networks with loops
• Distributed Computing – IWDC 2005

Describes a project that uses

Uses Software

• Horus

This page was built for publication: On the interconnection of message passing systems

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