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)
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)
Reducing Transaction Abort Rates with Prioritized Atomic Multicast Protocols
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
MADIS: a slim middleware for database replication
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
A prioritized atomic multicast protocol allows an application to tag messages with a priority that expresses their urgency and tries to deliver first those with a higher priority. For instance, such a service can be used in a database replication context, to reduce the transaction abort rate when integrity constraints are used. We present a study of the three most important and well-known classes of atomic multicast protocols in which we evaluate the cost imposed by the prioritization mechanisms, in terms of additional latency overhead, computational cost and memory use. This study reveals that the behavior of the protocols depends on the particular properties of the setting (number of nodes, message sending rates, etc.) and that the extra work done by a prioritized protocol does not introduce any additional latency overhead in most of the evaluated settings. This study is also a performance comparison of these classes of total order protocols and can be used by system designers to choose the proper prioritized protocol for a given deployment.