 We show that the deterministic memory abstraction can be introduced in the OS at the granularity of single memory pages by exploiting existing hardware support. When deterministic memory pages are accessed, the attribute is propagated through all the levels of the memory hierarchy.
<meaning-changed>  We show that the deterministic memory abstraction can be introduced in the OS at the granularity of single memory pages by exploiting existing hardware support. When deterministic memory pages are accessed, the attribute is propagated through all the levels of the memory hierarchy.
 We show that the deterministic memory abstraction can be introduced in the OS at the granularity of single memory pages by exploiting existing hardware - guarantees small and tightly bounded worst-case memory access timing. In contrast, we call the conventional memory abstraction as best-effort memory in which only highly pessimistic worst-case bounds can be achieved. We present how the two memory abstractions can be realized with small extensions to existing OS and hardware architecture. In particular, we show the potential benefits of our approach in the context of shared cache management, by presenting a deterministic memory-aware cache architecture and its manage- ment scheme. We evaluate the attribute is propagated through all the levels of the memory hierarchy.