Messages versus messengers in distributed programming

DOI10.1006/JPDC.1999.1533zbMATH Open0929.68019OpenAlexW1974384434MaRDI QIDQ1291015FDOQ1291015

Authors: Munehiro Fukuda, Lubomir F. Bic, Michael B. Dillencourt, Jason M. Cahill 

Publication date: 25 January 2000

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

Full work available at URL: https://semanticscholar.org/paper/1c575e92687dbc06acec75ae66a7a2f9174cb31c

Recommendations

• scientific article; zbMATH DE number 1706422
• Generative communication in Linda
• Message passing without send–receive
• Using message passing for distributed programming: proof rules and disciplines
• An overview of message passing environments

zbMATH Keywords

PVMmessengers

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited In (4)

• Modeling distributed system entities which communicate asynchronous via message passing in Java
• Elimination of redundant messages with a two-pass static analysis algorithm
• Local Maps: New Insights into Mobile Agent Algorithms
• Exception handling for copyless messaging

This page was built for publication: Messages versus messengers in distributed programming

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