By Topic

Concurrency control on distributed objects using role ordering (RO) scheduler

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)
Enokido, T. ; Dept. of Comput. & Syst. Eng., Tokyo Denki Univ., Japan ; Takizawa, M.

A concept of role is significant to design and implement a secure information system. A role concept shows a job function in an enterprise. A role-based access control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on principles "first-comer-winner" and "timestamp order" to make multiple conflicting transactions serializable, respectively. In this paper, we discuss concurrency control algorithms based on the significancy of roles assigned to transactions. We first define a significantly dominant relation on roles. We discuss a role ordering (RO) scheduler so that multiple conflicting transactions are serializable in a significant dominant relation of roles. We evaluate the RO scheduler compared with the two-phase locking (2PL) protocol.

Published in:

Object-Oriented Real-Time Dependable Systems, 2005. WORDS 2005. 10th IEEE International Workshop on

Date of Conference:

2-4 Feb. 2005