Performance evaluation of scheduling algorithm 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. To schedule these transactions the circulating mutisequencer algorithm has been considered to obtain a global view of the system. In this paper, a mathematical model is developed to obtain the average stay time of a transaction within the system, when no transaction misses its deadline. This model introduces bulk arrival M/G/l 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. The validity of the model has been proved by simulation.