Design and Verification of Adaptive Cache Coherence Protocols ...

proc proc proc
pmb mpb pmb mpb pmb mpb
sache sache sache
interconnect
memory memory memory
SYS SITEs System
SITEs SITE [] SITE j SITEs Set of Sites
SITE Site(id , MEM, SACHE, PMB, MPB, PROC) Site
SACHE [] Cell(a,v,CSTATE) j SACHE Semantic Cache
CSTATE [] id jCSTATE Cache State
Figure 3.7: System Con guration of GCRF
Commit and Reconcile Rules: A Commit can be completed if the address is uncached or
the data has been written back to all the sites since its most recent update. A Reconcile can
be completed if the address is uncached or the modi ed data has not been written back toall
the sites.
GCRF-Commit Rule
Site(id , mem, sache, ht,Commit(a)ipmb, mpb, proc) if a =2 sache _ Cell(a,-, ) 2 sache
! Site(id , mem, sache, pmb, mpbjht,Acki, proc)
GCRF-Reconcile Rule
Site(id , mem, sache, ht,Reconcile(a)ipmb, mpb, proc) if Cell(a,-, ) =2 sache
! Site(id , mem, sache, pmb, mpbjht,Acki, proc)
Cache, Writeback and Purge Rules: A sache can obtain a clean copy from its own memory
if the address is not cached at the time. A sache can write the data of a cell back to a memory
that has not been updated according to the sache state. A sache can purge a cell if the data
has been written back to all the sites since its most recent update.
GCRF-Cache Rule
Site(id , mem, sache, pmb, mpb, proc) if a =2 sache
! Site(id , mem, Cell(a,mem[a], ) j sache, pmb, mpb, proc)
63