|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Tomoya Enokido, Makoto Takizawa, "Concurrency Control on Distributed Objects using Role Ordering (RO) Scheduler," Object-Oriented Real-Time Dependable Systems, IEEE International Workshop on, pp. 66-73, 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/WORDS.2005.22, author = {Tomoya Enokido and Makoto Takizawa}, title = {Concurrency Control on Distributed Objects using Role Ordering (RO) Scheduler}, journal ={Object-Oriented Real-Time Dependable Systems, IEEE International Workshop on}, volume = {0}, year = {2005}, issn = {1530-1443}, pages = {66-73}, doi = {http://doi.ieeecomputersociety.org/10.1109/WORDS.2005.22}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Object-Oriented Real-Time Dependable Systems, IEEE International Workshop on TI - Concurrency Control on Distributed Objects using Role Ordering (RO) Scheduler SN - 1530-1443 SP66 EP73 A1 - Tomoya Enokido, A1 - Makoto Takizawa, PY - 2005 KW - null VL - 0 JA - Object-Oriented Real-Time Dependable Systems, IEEE International Workshop on ER - | |||
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 algorisms 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 con- flicting transactions are serializable in a significant dominant relation of roles. We evaluate the RO scheduler compared with the two-phase locking (2PL) protocol.