Look-ahead memory consistency model

Abstract

In this paper, we propose a hardware-centric lookahead memory consistency model that makes the data consistent according to the special ordering requirement of memory accesses for critical sections. The novel model imposes fewer restrictions an event ordering than previously proposed models thus offering the potential of higher performance. The architecture has the following features: (1) blocking and waking up processes by hardware, (2) allowing instructions to be executed our-of-order, (3) until having acquired the lock can the processor allow the requests for accessing the protected data to be evicted to the memory subsystem. The advantages of the look-ahead model include. (1) more program segments are allowed parallel execution (2) locks can be released earlier, resulting in reduced waiting times for acquiring lock, and (3) less network traffic because more write requests are merged by using two write caches.