 |
This slide presents an important optimization in GCCache , the deduplication mechanism for handling repeated cache misses.
Let me walk you through the scenario shown in the diagram on the right.
At time T0, Request A with PID 10 arrives and misses on address 0xA000. This creates an entry in the Outstanding Request Table, and a DMA request is sent to the host.
Shortly after, at time T1, Request B with PID 11 arrives , and its also requesting the same address 0xA000. This is a repeated miss.
The system checks the Outstanding Request Table for existing entries before issuing a new DMA request. When a match is found , it links the new request to the pending one via the Next PID pointer. The DMA request for PID 11 is blocked and saved , no redundant host access is generated.
|
IEEE/ICACT20260320 Slide.14
[Big Slide]
[YouTube]