Abstract
In a real-time distributed 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 multi-tokens and the circulating multisequencer 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 model introduce a bulk arrival M/G/1 station with K classes of customers where bulks are considered according to FIFO discipline, customers (actions) are scheduled according to EDF within a group and the algorithm operating is taken into account according to the HOL discipline. 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 multisequencer algorithm presents better results than the multi-tokens algorithm.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
