research-article

Achieving causal and total ordering in publish/subscribe middleware with DSM

Authors:

Cássio M. M. Pereira,

Daniel C. Lobato,

César A. C. Teixeira,

Maria G. PimentelAuthors Info & Claims

MW4SOC '08: Proceedings of the 3rd workshop on Middleware for service oriented computing

Pages 61 - 66

https://doi.org/10.1145/1462802.1462813

Published: 01 December 2008 Publication History

Abstract

Causal and total event ordering are Quality of Service guarantees needed by many distributed applications, such as collaborative whiteboards, chat systems, online multiplayer games, and has also usage when implementing active replication, replicated databases and other systems. Most state of the art Publish/Subscribe middlewares offer no guarantees regarding event ordering either because of the bandwidth overhead associated with the vector clock approach or the bottleneck of a central sequencer. In this paper we propose an architecture based on distributed shared memory, where publishers of the same group can publish at different brokers, while maintaining event ordering. By synchronizing broker access to one shared logical clock per group, causal and total event ordering is achieved. Our architecture allows events to be delivered out-of-order to subscribers, while giving them a way to correctly reorder events. Results of experiments with a reference implementation of the architecture show that the bandwidth consumption of our ordering mechanism can be three orders of magnitude lower than a vector based solution.

References

[1]

M. Akay and C. Katsinis. Performance improvement of parallel programs on a broadcast-based distributed shared memory multiprocessor by simulation. Simulation Modelling Practice and Theory, 2007.

[2]

J. H. Anderson, Y.-J. Kim, and T. Herman. Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput., 16(2--3):75--110, 2003.

Digital Library

[3]

H. Attiya, D. Hendler, and P. Woelfel. Tight rmr lower bounds for mutual exclusion and other problems. In STOC '08, pages 217--226, New York, NY, USA, 2008. ACM.

Digital Library

[4]

B. Ban. Design and Implementation of a Reliable Group Communication Toolkit for Java. Cornell University, September, 1998.

[5]

K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. SIGOPS Oper. Syst. Rev., 21(5):123--138, 1987.

Digital Library

[6]

J. Chang, C. Shieh, and T. Liang. A transparent distributed shared memory for clustered symmetric multiprocessors. The Journal of Supercomputing, 37(2):145--160, 2006.

Digital Library

[7]

G. Cugola, E. D. Nitto, and A. Fuggetta. The jedi event-based infrastructure and its application to the development of the opss wfms. IEEE Trans. Softw. Eng., 27(9):827--850, 2001.

Digital Library

[8]

P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. volume 35, pages 114--131, New York, NY, USA, 2003. ACM.

Digital Library

[9]

J. Gosling, B. Joy, G. Steele, and G. Bracha. Java Language Specification, Second Edition: The Java Series. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2000.

Digital Library

[10]

D. R. Jefferson. Virtual time. ACM Trans. Program. Lang. Syst., 7(3):404--425, 1985.

Digital Library

[11]

H. Jung and H. Yeom. A practical single-register wait-free mutual exclusion algorithm on asynchronous networks. LNCS, 4128:539, 2006.

Digital Library

[12]

H. Lee. Transformations of mutual exclusion algorithms from the cache-coherent model to the distributed shared memory model. ICDCS 2005, pages 261--270, June 2005.

Digital Library

[13]

O. Letizi. An introduction to Terracotta DSO. 2007.

[14]

C. Lumezanu, N. Spring, and B. Bhattacharjee. Decentralized message ordering for publish/subscribe systems. In Middleware, pages 162--179, 2006.

Digital Library

[15]

S. P. Mahambre, M. K. SD, and U. Bellur. A taxonomy of qos-aware, adaptive event-dissemination middleware. IEEE Internet Computing, 11(4):35--44, 2007.

Digital Library

[16]

F. Mattern. Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, pages 215--226, 1989.

[17]

F. Mattern. On the relativistic structure of logical time in distributed systems. Datation et Controle des Executions Reparties, Bigre, 78:3--20, 1992.

[18]

J. Misra. Distributed discrete-event simulation. ACM Comput. Surv., 18(1):39--65, 1986.

Digital Library

[19]

C. Morin, C. Morin, R. Lottiaux, and A.-M. Kermarrec. High availability of the memory hierarchy in a cluster. In R. Lottiaux, editor, SRDS-2000, pages 134--143, 2000.

Digital Library

[20]

P. R. Pietzuch and J. Bacon. Peer-to-peer overlay broker networks in an event-based middleware. In DEBS '03: Proceedings of the 2nd international workshop on Distributed event-based systems, pages 1--8, New York, NY, USA, 2003. ACM.

Digital Library

[21]

F. Sultan, L. Iftode, and T. Nguyen. Scalable fault-tolerant distributed shared memory. In Supercomputing '00: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM), page 20, Washington, DC, USA, 2000. IEEE Computer Society.

Digital Library

[22]

L. Vittanala and M. Chaudhuri. Integrating memory compression and decompression with coherence protocols in distributed shared memory multiprocessors. Parallel Processing, 2007. ICPP 2007. International Conference on, pages 4--4, 2007.

Digital Library

[23]

B.-H. Yu, B.-H. Yu, P. Werstein, M. Purvis, and S. Cranefield. Performance improvement techniques for software distributed shared memory. In P. Werstein, editor, Proc. 11th International Conference on Parallel and Distributed Systems, volume 1, pages 119--125 Vol. 1, 2005.

Digital Library

Cited By

Yamamoto YHayashibara N(2017)Merging Topic Groups of a Publish/Subscribe System in Causal Order2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA)10.1109/WAINA.2017.96(172-177)Online publication date: Mar-2017
https://doi.org/10.1109/WAINA.2017.96
Pereira CTeixeira CLobato DPimentel MShin SOssowski S(2009)Preservation of ordering in a network of brokersProceedings of the 2009 ACM symposium on Applied Computing10.1145/1529282.1529300(88-89)Online publication date: 8-Mar-2009
https://dl.acm.org/doi/10.1145/1529282.1529300
Kuhn EMordinyi RKeszthelyi LSchreiber CBessler STomic S(2009)Introducing Aspect-oriented Space Containers for efficient publish/subscribe scenarios in Intelligent Transportation Systems2009 Joint Working IEEE/IFIP Conference on Software Architecture & European Conference on Software Architecture10.1109/WICSA.2009.5290786(313-316)Online publication date: Sep-2009
https://doi.org/10.1109/WICSA.2009.5290786
Show More Cited By

Index Terms

Achieving causal and total ordering in publish/subscribe middleware with DSM
1. Computer systems organization
  1. Architectures
    1. Distributed architectures
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles

Recommendations

Preservation of ordering in a network of brokers
SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing

Some distributed applications, such as online collaborative whiteboards, chat systems, multiplayer games and others, have a need for causal and total ordering. Those applications exploit computer networks in order to connect publishers and subscribers ...
Performance of publish/subscribe middleware in mobile wireless networks
WOSP '04: Proceedings of the 4th international workshop on Software and performance

Publish/subscribe middlewares are becoming popular for distributed applications because of their flexible and scalable nature. Anonymous and loosely-coupled communication between publisher and subscriber, along with the inherently asynchronous nature of ...
Performance of publish/subscribe middleware in mobile wireless networks

Publish/subscribe middlewares are becoming popular for distributed applications because of their flexible and scalable nature. Anonymous and loosely-coupled communication between publisher and subscriber, along with the inherently asynchronous nature of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

MW4SOC '08: Proceedings of the 3rd workshop on Middleware for service oriented computing

December 2008

72 pages

ISBN:9781605583686

DOI:10.1145/1462802

Conference Chairs:
Karl M. Göschka
Vienna Univ. of Technology, Austria
,
Schahram Dustdar
Vienna Univ. of Technology, Austria
,
Frank Leymann
Univ. of Stuttgart, Germany
,
Vladimir Tosic
NICTA, Australia

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Fundação de Amparo à Pesquisa do Estado de São Paulo

Conference

Middleware '08

Middleware '08: 9th International Middleware Conference

December 1 - 5, 2008

Leuven, Belgium

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
234
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 14 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Yamamoto YHayashibara N(2017)Merging Topic Groups of a Publish/Subscribe System in Causal Order2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA)10.1109/WAINA.2017.96(172-177)Online publication date: Mar-2017
https://doi.org/10.1109/WAINA.2017.96
Pereira CTeixeira CLobato DPimentel MShin SOssowski S(2009)Preservation of ordering in a network of brokersProceedings of the 2009 ACM symposium on Applied Computing10.1145/1529282.1529300(88-89)Online publication date: 8-Mar-2009
https://dl.acm.org/doi/10.1145/1529282.1529300
Kuhn EMordinyi RKeszthelyi LSchreiber CBessler STomic S(2009)Introducing Aspect-oriented Space Containers for efficient publish/subscribe scenarios in Intelligent Transportation Systems2009 Joint Working IEEE/IFIP Conference on Software Architecture & European Conference on Software Architecture10.1109/WICSA.2009.5290786(313-316)Online publication date: Sep-2009
https://doi.org/10.1109/WICSA.2009.5290786
Kühn EMordinyi RKeszthelyi LSchreiber CBessler STomic S(2009)Aspect-Oriented Space Containers for Efficient Publish/Subscribe Scenarios in Intelligent Transportation SystemsProceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I10.1007/978-3-642-05148-7_34(432-448)Online publication date: 7-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-05148-7_34

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents