skip to main content
research-article

Spatial ordering of messages in a cyclic architecture

Published: 27 November 2010 Publication History

Abstract

Spatial ordering of messages can be used fruitfully for the design of distributed systems. For modeling such systems we require a logical framework that includes both spatial andtemporal ordering predicates. In order to illustrate its applicability a distributed K mutual exclusion algorithm is proposed that requires a unidirectional cyclic topology for its implementation. The algorithm uses only point to point communication rather than broadcast. It is shown that the topological ordering of messages is important for its correct operation

References

[1]
Anup Kumar Bandyopadhyay (2008): Weakest Precondition Based Verification Tool that Models Spatial Ordering, ACM SIGSOFT Software Engineering Notes, Volume 33, Number 2, March 2008.
[2]
K. Raymond (1989): A distributed algorithm for multiple entries to a critical section, IPL, vol 30, 1989, pp 189--193.
[3]
P. K. Srimani and R.L.N. Reddy (1992): Another distributed algorithm for multiple entries to a critical section, IPL, vol 41, 1992, pp 51--57.
[4]
C. A. R. Hoare (1985) Communicating Sequential Processes, Prentice Hall, 1985.
[5]
P. Pramanik, P. K. Das, A. K. Bandyopadhyay and D. Q. M. Fay (1990): A deadlock free communication kernel for loop connected message passing architecture Microprocessing and Microprogramming, vol 30, North Holland, 1990, pp 703--712.
[6]
P. Pramanik, P. K. Das, A. K. Bandyopadhyay and D. Q. M. Fay (1992): Avoidance of deadlock in loop structures - A two process solution, Microprocessing and Microprogramming, vol 34, North Holland, 1992, pp 103--106.
[7]
Jayasri Banerjee, Anup Kumar Bandyopadhyay and Ajit Kumar Mandal (2007): Ordering of Events in Two-ProcessConcurrent System, ACM Software Engineering Notes, ACM Software Engineering Notes, Volume 32 Number 4, July 2007.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes  Volume 35, Issue 6
November 2010
132 pages
ISSN:0163-5948
DOI:10.1145/1874391
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 November 2010
Published in SIGSOFT Volume 35, Issue 6

Check for updates

Author Tags

  1. distributed program correctness
  2. distributed systems
  3. mutual exclusion
  4. spatial ordering

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 49
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media