Hussak_Representation_of_coherency.pdf (617.34 kB)
Representation of coherency classes for parallel systems
conference contributionposted on 2009-02-04, 12:39 authored by Walter HussakWalter Hussak, John A. Keane
Some parallel applications do not require a precise imitation of the behaviour of the physically shared memory programming model. Consequently, certain parallel machine architectures have elected to emphasise different required coherency properties because of possible efficiency gains. This has led to various definitions of models of store coherency. These definitions have not been amenable to detailed analysis and, consequently, inconsistencies have resulted. In this paper a unified framework is proposed in which different models of store coherency are developed systematically by progressively relaxing the constraints that they have to satisfy. A demonstration is given of how formal reasoning can be cam’ed out to compare different models. Some real-life systems are considered and a definition of a version of weak coherency is found to be incomplete.
- Computer Science
CitationHUSSAK, W. and KEANE, J.A., 1993. Representation of coherency classes for parallel systems. IN: Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, USA, 1-4 Dec 1993, pp. 391 - 398
- VoR (Version of Record)
NotesThis is a conference paper [© IEEE]. It is also available from: http://ieeexplore.ieee.org. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.