Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Stack-based scheduling for realtime processes
Real-Time Systems
Totem: a fault-tolerant multicast group communication system
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Group communication specifications: a comprehensive study
ACM Computing Surveys (CSUR)
Computer Networks
A Low Latency, Loss Tolerant Architecture and Protocol for Wide Area Group Communication
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Avoiding Priority Inversion on the Processing of Requests by Active Replicated Servers
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Database Replication Techniques: A Three Parameter Classification
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
An evaluation of the Amoeba group communication system
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Managing Priorities in Atomic Multicast Protocols
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
MADIS: a slim middleware for database replication
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On the Cost of Prioritized Atomic Multicast Protocols
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 |
Priority atomic multicast is a total-order multicast message delivery service that enables applications to prioritize the sequence by which messages are delivered, while regular total order properties remain invariant. Priority-based message delivery can serve to reduce the abortion rate of transactions. In this study, we compare three classical total order protocols against their corresponding prioritized versions, in the framework of a replication middleware. To this end, we use a test application that broadcasts prioritized messages by these protocols, and measure the effect of the priorization. We show that, under certain conditions, the use of prioritized protocols yields lower abort rates than the corresponding non-prioritized protocols.