Programming, Compiling and Executing Partially-Ordered Instruction Streams on
Scalable Shared-Memory Multiprocessors, David K. Probst · 1994
Performance in large-scale shared-memory multiprocessors depends on finding a scalable solution to the memory-latency problem. In this paper, we show that protect consistency (PRC) relaxes previous consistency models with two distinct performance benefits. First, PRC is used to expose and exploit more parallelism in the computation, giving better support to latency tolerance. Second, assuming that visible synchronization directly coordinates changes in the writability of shared data, PRC is used to create more situations where cached data are reusable, giving better support to latency avoidance. The paper evaluates PRC in the context of relaxing intrathread deperidences for multithreaded architectures. After the PRC programming notation is described, programming and compiling aspects are examined, and architectural support is discussed.