LIMITATIONS AND CAPABILITIES OF WEAK MEMORY CONSISTENCY SYSTEMS

Simple item page
dc.contributor.authorKAWASH, JALALeng
dc.date.accessioned2008-06-04T20:25:46Z
dc.date.available2008-06-04T20:25:46Z
dc.date.computerscience2000-03-22eng
dc.date.issued2000-03-22eng
dc.description.abstractThis dissertation develops and exploits a formalism for specifying memory consistency models. This formalism lays down the foundations for describing memory consistency models at various levels, and develops techniques to prove the equivalence between models defined at different levels. Two levels, called non-operational and operational, are addressed in this dissertation. The non-operational level describes these models in terms of program instructions or procedures, while the operational level describes them in terms of implementation events. Formal techniques are developed to prove the equivalence of rigorous specifications at both levels. This formalism is then exploited to define the memory consistency models of two state-of-the-art multiprocess systems: the SPARC version 8 architecture and the Java Virtual Machine. These models are defined at both operational and non-operational levels. These operational and non-operational descriptions are proved equivalent. The SPARC models provide "reasonably" weak memory consistency models that are capable of avoiding the use of explicit synchronization primitives for certain problems. However, Java provides a consistency model that is completely dependent on synchronization primitives, without which no form of coordination between different threads is possible. Fundamental process coordination problems have been extensively studied for traditional systems with strong memory consistency. This dissertation revisits the critical section and the producer/consumer problems in the context of weak memory consistency models. It establishes that the majority of known weak memory consistency models are incapable of supporting a solution to the critical section problem without the use of explicit synchronization primitives. Surprisingly, most of these models are capable of supporting solutions to versions of the producer/consumer problem without the use of these primitives.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.department2000-651-03eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30866
dc.identifier.urihttp://hdl.handle.net/1880/46623
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleLIMITATIONS AND CAPABILITIES OF WEAK MEMORY CONSISTENCY SYSTEMSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
2000-651-03.pdf
Size:
755.17 KB
Format:
Adobe Portable Document Format
Download
No Thumbnail Available
Name:
2000-651-03.ps
Size:
921.3 KB
Format:
Postscript Files
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications