Run-time switching between total order algorithms
J Mocito, L Rodrigues - Euro-Par 2006 Parallel Processing: 12th …, 2006 - Springer
J Mocito, L Rodrigues
Euro-Par 2006 Parallel Processing: 12th International Euro-Par Conference …, 2006•SpringerTotal order broadcast protocols are a fundamental building block in the construction of many
fault-tolerant distributed applications. Unfortunately, total order is an intrinsically expensive
operation. Moreover, there are certain algorithms that perform better in specific scenarios
and given network properties. This paper proposes and evaluates an adaptive protocol that
is able to dynamically switch between different total order algorithms. The protocol allows to
achieve the best possible performance, by selecting, in each moment, the algorithm that is …
fault-tolerant distributed applications. Unfortunately, total order is an intrinsically expensive
operation. Moreover, there are certain algorithms that perform better in specific scenarios
and given network properties. This paper proposes and evaluates an adaptive protocol that
is able to dynamically switch between different total order algorithms. The protocol allows to
achieve the best possible performance, by selecting, in each moment, the algorithm that is …
Abstract
Total order broadcast protocols are a fundamental building block in the construction of many fault-tolerant distributed applications. Unfortunately, total order is an intrinsically expensive operation. Moreover, there are certain algorithms that perform better in specific scenarios and given network properties. This paper proposes and evaluates an adaptive protocol that is able to dynamically switch between different total order algorithms. The protocol allows to achieve the best possible performance, by selecting, in each moment, the algorithm that is most appropriate to the present network conditions. Experimental results show that, using our protocol, adaptation can be achieved with negligible interference with the data flow.
Springer