Bit-level Locking for Concurrency Control

Haraty, Ramzi A.; Abbass, Jad F.

Bit-level Locking for Concurrency Control

Haraty, Ramzi A.; Abbass, Jad F.

URI: http://hdl.handle.net/10725/7104

URL: http://ieeexplore.ieee.org/abstract/document/5069320/

DOI: http://dx.doi.org/10.1109/AICCSA.2009.5069320

Date: 2018-02-19

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

Multitasking in both uniprocessor (multithreading) and multiprocessor (multiprocessing) systems have been attracted by many applications. Database systems are somewhat the most important in this regard, especially in centralized and humongous ones. Sometimes thousands, and maybe hundred of thousands of operations are sent to the transaction processing system per second. To handle this bottleneck some queries/updaters are executed concurrently. However, parallelism in such cases is extremely accurate based on the well-know restriction - locks. In this paper, we implement a lock approach based on a Boolean array (1D and 2D) and on the logical OR operation to specify which transactions can be executed in parallel.

Citation:

Abbass, J. F., & Haraty, R. A. (2009, May). Bit-level locking for concurrency control. In Computer Systems and Applications, 2009. AICCSA 2009. IEEE/ACS International Conference on (pp. 168-173). IEEE.