BOUNDS FOR MUTUAL EXCLUSION WITH ONLY PROCESSOR CONSISTENCY

Simple item page
dc.contributor.authorHigham, Lisaeng
dc.contributor.authorKawash, Jalaleng
dc.date.accessioned2008-02-27T22:14:34Z
dc.date.available2008-02-27T22:14:34Z
dc.date.computerscience1999-12-15eng
dc.date.issued1999-12-15eng
dc.description.abstractMost weak memory consistency models are incapable of supporting a solution to mutual exclusion using only read and write operations. Processor Consistency-Goodman's version is an exception. Ahamad et al.[1] showed that Peterson's mutual exclusion algorithm is correct for PC-G, but Lamport's bakery algorithm is not. In this paper, we derive a lower bound on the number and type (single- or multi-writer) of variables that a mutual exclusion algorithm must use in order to be correct for PC-G. We show that any such solution for n processes must use at least one multi-writer and n single-writers. This lower bound is tight when n = 2, and is tight when n >_2 for solutions that do not provide fairness. We show that Burn's algorithm is an unfair solution for mutual exclusion in PC-G that achieves our bound. However, five other known algorithms that use the same number and type of variables are incorrect for PC-G. A corollary of this investigation is that, in contrast to Sequential Consistency, multi-writers cannot be implemented from single-writers in PC-G.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1999-647-10eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30821
dc.identifier.urihttp://hdl.handle.net/1880/45997
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleBOUNDS FOR MUTUAL EXCLUSION WITH ONLY PROCESSOR CONSISTENCYeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
1999-647-10.pdf
Size:
113.06 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
1999-647-10.ps
Size:
119.99 KB
Format:
Postscript Files
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications