Hussak_Representation_of_coherency.pdf (617.34 kB)
Download fileRepresentation of coherency classes for parallel systems
conference contribution
posted on 2009-02-04, 12:39 authored by Walter HussakWalter Hussak, John A. KeaneSome 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.
History
School
- Science
Department
- Computer Science