Performance evaluation of the circulating multisequencer and the consensus algorithms in a real-time distributed transactional system

In a real-time distributed transactional system, customers generate transactions, which should be scheduled to be executed on different servers. The transactions must be executed before their deadlines. To schedule these transactions the circulating multisequencer and the consensus algorithms have been considered to obtain a global view of the system. Mathematical models are developed to obtain the average stay time of a transaction within the system. The response time distribution is also computed. This allowed us to determine the minimum relative deadline, to affect to a generated transaction, to guarantee a given probability p that the transaction does not miss its deadline. This study shows that the circulating multisequencer algorithm presents better results