DTLB: Deterministic TLB for Tightly Bound Hard Real-Time Systems
Kajal Varma, Geeta Patil, Biju K. Raveendran · 2017
This paper proposes a novel TLB architecture - Deterministic Translation Lookaside Buffer - to reduce TLB misses, energy consumption and effective per access time. DTLB offers tighter upper bound on worst case execution time of real time tasks. This is achieved by backing TLB contents of executing task to PCB on preemption and transferring contents in PCB back to TLB when task resumes its execution. Experimental results carried out using MemSim - a single clock cycle simulator developed in Java with Swing GUI - shows that DTLB gives the least number of TLB misses as compared to conventional TLB model and Reservation based TLB model. DTLB offers on an average 6.74% and 4.91% of dynamic energy savings over conventional model and Reservation based model respectively. Effective access time of DTLB is on an average 2.97% and 2.09% less as compared to conventional and Reservation based model respectively.