Improving the benefits of multicast prioritization algorithms


Prioritized atomic multicast consists in delivering messages in total order while ensuring that the priorities of the messages are considered; i.e., messages with higher priorities are delivered first. That service can be used in multiple applications. An example is the usage of prioritization algorithms for reducing the transaction abort rates in applications that use a replicated database system. To this end, transaction messages get priorities according to their probability of violating the existing integrity constraints. This paper evaluates how that abort reduction may be improved varying the message sending rate and the bounds set on the length of the priority reordering queue being used by those multicast algorithms.

DOI: 10.1007/s11227-014-1087-z

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@article{Miedes2014ImprovingTB, title={Improving the benefits of multicast prioritization algorithms}, author={Emili Miedes and Francesc D. Mu{\~n}oz-Esco{\'i}}, journal={The Journal of Supercomputing}, year={2014}, volume={68}, pages={1280-1301} }