Variable Block Size Architecture for Programs

Abstract

Cache reconfiguration is well studied topic in recent time. This paper proposes an algorithm to determine variable block size for variables in a program at some predetermined points called decision points based on their access pattern. The whole program is divided into segments by the decision points. Rules to decide the decision points are developed. The algorithm identifies the decision points, formulates optimization function to determine the average memory access time for the variables involved at these decision points. Solving the optimization function with constraints gives the optimal block size. The algorithm is simulated for a chosen example and an improvement of 78% in AMAT was observed for the chosen example. The chosen example performed better than prefetching by 28%.