Implementing Multiple Locks Using Lamport s Mutual Exclusion Algorithm HANS-J. BOEHM Xerox PARC and CHRIS UHLER Xsoft and ALAN J. DEMERS We describe an approach for implementing higher-level mutual-exclusion constructs using Lamport s algorithm. A straightforward implementation of, for example, monitor locks based on Lamport s algorithm requires O(n) space per monitor lock if there are n processes that may share the lock. It has occasionally been claimed that this makes the algorithm undesirable in practice. The insight presented here is that we only need a (small) constant amount of space per lock, plus O(n) space shared by all locks in the system. For some common applications, this adds no memory references to the implementation of the algorithm. Fully general spin-lock acquisition and release can usually be implemented with the addition of one memory reference to Lamport s algorithm. On particularly unfavorable hardware, three additional memory references may be required in the contention-free case. D.3.3 Categories and Subject Descriptors: programming structures; Constructs concurrent [Programming D.4.1 Languages]: Language [Operating Systems]: Process Manage- ment mutual General Additional exclusion Terms: Algorithms, Verification Critical section, monitor lock, multiprocessing, spin lock Key Words and Phrases: 1. LAMPORT S Lamport s ware support ALGORITHM
End of preview. The entire article is 13 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/implementing-multiple-locks-using-lamport-s-mutual-exclusion-algorithm-PezFcOH2BH
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Implementing multiple locks using Lamport's mutual exclusion algorithm
Boehm, Hans-J.; Demers, Alan J.; Uhler, Chris
Follow ACM Letters on Programming Languages and Systems (LOPLAS)
, Volume 2 (1-4)
Association for Computing Machinery – Mar 1, 1993
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
