Model of a Distributed Cached Store

• application:

  • x := y

• coherence:

  • propagate(x)

• collector:
  • trace(B)
  • scan(x)
  • create.scion(Bx,Dz)
  • delete.scion(Bx,Dz)
  • union(x)

• x is dirty:
  • after being written by an application (x:=y), and before being scanned (scan(x))

Previous slide

Next slide

Back to first slide

View graphic version