By Topic

Performance evaluation of scheduling algorithm in a real-time distributed transactional system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
L. A. Saidane ; Ecole Nat. des Sci. de Inf., Tunisia ; F. Karnoun

In a real-time distributed transactional system, transactions which should be scheduled to be executed on different servers. To schedule these transactions the circulating multisequencer algorithm has been considered to obtain a global view of the system. 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 the bulk arrival M/G/I 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

Published in:

Distributed Computing Systems, 1997., Proceedings of the Sixth IEEE Computer Society Workshop on Future Trends of

Date of Conference:

29-31 Oct 1997