ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Scalable fault-tolerant distributed shared memory
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS
IEEE Transactions on Software Engineering
Java Language Specification, Second Edition: The Java Series
Java Language Specification, Second Edition: The Java Series
High Availability of the Memory Hierarchy in a Cluster
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Shared-memory mutual exclusion: major research trends since 1986
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Peer-to-peer overlay broker networks in an event-based middleware
Proceedings of the 2nd international workshop on Distributed event-based systems
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Performance Improvement Techniques for Software Distributed Shared Memory
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Volume 01
A Transparent Distributed Shared Memory for Clustered Symmetric Multiprocessors
The Journal of Supercomputing
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Tight RMR lower bounds for mutual exclusion and other problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Taxonomy of QoS-Aware, Adaptive Event-Dissemination Middleware
IEEE Internet Computing
Decentralized message ordering for publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
A practical single-register wait-free mutual exclusion algorithm on asynchronous networks
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Preservation of ordering in a network of brokers
Proceedings of the 2009 ACM symposium on Applied Computing
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
| Hi-index | 0.00 |
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.