Scheduling a reservation primitive for effective latency hiding in DSM
Masayuki Hirota, Takeshi Yamazaki, Naoki Yonezawa, Koichi Wada · 2003
Distributed shared memory (DSM) systems potentially have both performance scalability and good programmability. However, they also have a drawback in their difficulty in overlapping computation with inter-processor communication. For DSM systems, we propose a novel coherence protocol called Selective Validity Control (SVC) protocol. In the SVC protocol, a new memory access operation called a link access is introduced to hide the read miss latency and to rearrange allocation for shared data. However, in order to have a link access work effectively, it has to be scheduled appropriately. The paper proposes a scheduler that collects and analyzes memory accesses of an application program, and automatically schedules link accesses. The effectiveness of the link access is also described. To evaluate the performance of the scheduler, a trace-driven simulator for a DSM system has been developed. Bitonic sort and FFT programs from the SPLASH-2 benchmark suite are executed on the simulator. The results of the evaluation show that the read miss penalty and overall execution time can be reduced by using link access operations scheduled by our proposed scheduler.