Skip to main content
SpringerLink
Log in

Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines

  • Conference paper
  • First Online:
Book cover Parallel Computing Technologies (PaCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1662))

Included in the following conference series:

Abstract

Communication is Logically Instantaneous (LI) if it is possi- ble to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same times- tamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. li is stronger than Causally Ordered (CO) communication, but weaker than Rendezvous (RDV) communication. This paper explores Logically Instantaneous communication and provides a simple and efficient pro- tocol that implements LI on top of asynchronous distributed systems. LI is attractive as it includes CO and provides more concurrency than RDV. Moreover it allows to adopt the following approach: first design a distributed application assuming Rendezvous communication, and then run it on top of an asynchronous distributed system providing only LI communication.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahuja M. and Raynal M., An implementation of Global Flush Primitives Using Counters. Parallel Processing Letters, Vol. 5(2):171–178, (1995).

    Article  Google Scholar 

  2. Bagrodia R., Process Synchronization: Design and Performance Evaluation for Distributed Algorithms. IEEE TSE, SE15(9):1053–1065, (1989).

    Google Scholar 

  3. Bagrodia R., Synchronization of Asynchronous Processes in CSP. ACM TOPLAS, 11(4):585–597, (1989).

    Article  Google Scholar 

  4. Birman K. P. and Joseph T. A., Reliable Communication in the Presence of Failures. ACM TOCS, 5(1):47–76, (1987).

    Article  Google Scholar 

  5. Bougé L., Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP. Theoretical Computer Science, 49:145–169, (1987).

    Article  MATH  MathSciNet  Google Scholar 

  6. Brinch Hansen P., Distributed Processes: A Concurrent Programming Concept. Communications of the ACM, 21(11):934–941, (1978).

    Article  MATH  Google Scholar 

  7. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(1):225–267, (1996).

    Article  MATH  MathSciNet  Google Scholar 

  8. Charron-Bost B., Mattern F. and Tel G., Synchronous, Asynchronous and Causally Ordered Communications. Distributed Computing, 9:173–191, (1996).

    Article  MathSciNet  Google Scholar 

  9. Fritkze U., Ingels Ph., Mostefaoui, A. and Raynal M., Fault-Tolerant Total Order Multicast to Asynchronous Groups. Proc. 16th IEEE Int. Symposium on Reliable Distributed Systems, Purdue University, pp. 228–234, (1998).

    Google Scholar 

  10. Fujimoto R., Parallel Discrete Event Simulation. Communications of the ACM, 33(10):31–53, (1990).

    Article  Google Scholar 

  11. Garcia-Molina H. and Spauster A., Ordered and Reliable Multicast Communication. ACM TOCS, 9(3):242–272, (1991).

    Article  Google Scholar 

  12. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97–145, (1993).

    Google Scholar 

  13. Hoare C. A. R., Communicating Sequentail Processes. Communications of the ACM, 21(8):666–677, (1978).

    Article  MATH  MathSciNet  Google Scholar 

  14. Lamport, L., Time, Clocks and the Ordering of Events in a Distributed System, Communications of the ACM, 21(7):558–565, (1978).

    Article  MATH  Google Scholar 

  15. Misra J., Distributed Discrete Event Simulation. ACM Computing Surveys, 18(1):39–65, (1986).

    Article  Google Scholar 

  16. Murty V. V. and Garg V. K., Synchronous Message Passing. Tech. Report TR ECE-PDS-93-01, University of Texas at Austin, (1993).

    Google Scholar 

  17. Powell D. (Guest Editor), Special Issue on Group Communication. CACM, 39(4), (1996).

    Google Scholar 

  18. Raynal M., Schiper A. and Toueg S., The Causal ordering Abstraction and a Simple Way to Implement it. Information Processing Letters, 39:343–351, (1991).

    Article  MATH  MathSciNet  Google Scholar 

  19. Ricart G. and Agrawala A. K., An Optimal Algorithm for Mutual Exclusion in Computer Networks. Communications of the ACM, 24(1):115–123, (1981).

    Article  MathSciNet  Google Scholar 

  20. Silberschatz A., Synchronization and Communication in Distributed Systems. IEEE TSE, SE5(6):542–546, (1979).

    Google Scholar 

  21. Soneoka T. and Ibaraki T., Logically Instantaneous Message Passing in Asynchronous Distributed Systems. IEEE TC, 43(5):513–527, (1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, 35042, Rennes Cedex, France

    Achour Mostéfaoui & Michel Raynal

  2. Univ. Lisboa, C5 Campo Grande, 1700, Lisboa, Portugal

    P. Veríssimo

Authors
  1. Achour Mostéfaoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Raynal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Veríssimo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Center, 6 Lavrentiev Avenue, Novosibirsk, 630090, Russia

    Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mostéfaoui, A., Raynal, M., Veríssimo, P. (1999). Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-48387-X_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66363-8

  • Online ISBN: 978-3-540-48387-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation