Show simple item record

dc.contributor.authorHigham, Lisaeng
dc.contributor.authorKawash, Jalaleng
dc.date.accessioned2008-02-27T22:17:15Z
dc.date.available2008-02-27T22:17:15Z
dc.date.issued1997-06-01eng
dc.identifier.urihttp://hdl.handle.net/1880/46030
dc.description.abstractIn machines with a weak memory consistency model, the ordering constraints on memory accesses are few. In order to properly program these machines, certain powerful or explicit synchronization instructions are additionally provided in their architecture. We show that although a solution to the critical section problem (also referred to as the mutual exclusion problem) is impossible without such powerful synchronization, certain versions of the producer/consumer problem can be solved even in the weakest systems without the need for any such powerful instructions. These instructions are expensive, and avoiding their use is desirable for better performance.eng
dc.language.isoEngeng
dc.subjectComputer Scienceeng
dc.titleCRITICAL SECTIONS AND PRODUCER/CONSUMER QUEUES IN WEAK MEMORY SYSTEMSeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
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.department1997-604-06eng
dc.date.computerscience1999-05-27eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30865
thesis.degree.disciplineComputer Scienceeng


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record