Array-based locks for concurrency control model. (c2008)

LAUR Repository

Show simple item record

dc.contributor.author Abbass, Jad Fawzi
dc.date.accessioned 2011-03-22T14:15:10Z
dc.date.available 2011-03-22T14:15:10Z
dc.date.copyright 2008 en_US
dc.date.issued 2011-03-22
dc.date.submitted 5/20/2008
dc.identifier.uri http://hdl.handle.net/10725/306
dc.description Includes bibliographical references (leaves 46-47). en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.subject Database management en_US
dc.subject Distributed databases en_US
dc.subject Parallel processing (Electronic computers) en_US
dc.subject Multiprocessors en_US
dc.title Array-based locks for concurrency control model. (c2008) en_US
dc.type Thesis en_US
dc.term.submitted Spring en_US
dc.author.degree MS in Computer Science en_US
dc.author.school Arts and Sciences en_US
dc.author.idnumber 200400430 en_US
dc.author.commembers Abdul Nasser Kassar
dc.author.woa OA en_US
dc.description.physdesc 1 bound copy: 47 leaves; ill. (some col.); 31 cm. available at RNL. en_US
dc.author.division Computer Science en_US
dc.author.advisor Ramzi A. Haraty
dc.identifier.doi https://doi.org/10.26756/th.2008.8 en_US
dc.publisher.institution Lebanese American University en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account