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 project, I implemented a lock approach based on
a Boolean array (1 D and 2D) and on the "or" lo gical operation (0 specify which
transactions can be executed in parallel.
