Abstract
In a real-time distribute transactional system, customers generate transactions, which should be scheduled to be executed on different servers. The transactions have temporal constraints and must be executed before their deadlines. To schedule these transactions the circulating mutisequencer, the multi-tokens and the consensus algorithms have been considered to obtain a global view of the system. In this paper, mathematical models are developed to obtain the average stay time of a transaction within the system. These models introduce a bulk arrival M/G/1 station with K classes of customers where bulks are considered according to FIFO discipline and customers (actions) are scheduled according to EDF within a group and with the HOL discipline for the algorithm operating. 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. The system is then called p-feasible. This study enables to determine the number of tokens to use for the multi-tokens algorithm, for a given number of servers and shows that the circulating mutisequencer algorithm presents the best results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
