By Topic

(m,k) firm Scheduling of Real-Time Transactions with Concurrency Control

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)
Leila Baccouche ; INSAT, National Institute of Applied Science and Technology, Tunisia ; Sami Limam

This paper presents a multi-class scheduling algorithm for real-time transactions combining scheduling and concurrency control. The proposed algorithm, DBP_CC (distance based priority and concurrency control) offers service differentiation and QoS guarantees by specifying several (m,k) firm constraints giving the degree of missed deadlines that the system can tolerate for each class. When extracting a transaction, DBP_CC takes into account resource availability so that the execution of the concurrency control algorithm doesn't change the transactions schedule. Simulation results show that DBP_CC can achieve a significant performance even in overload situations.

Published in:

Systems, 2007. ICONS '07. Second International Conference on

Date of Conference:

22-28 April 2007