Abstract
This paper presents a new two-prong prefetch policy for the parefetch process in cach memory. Prefetching requires a replacement policy. I propose using two algorithms at the same time to do the replacement during the prefetch process.
The LRU policy is applied in the upper part when there is one or more hit(s), and the Randor policy is applied in the lower part when there is one or more miss(es). This policy decreases the numbe of bits of the Memory Address Register (MAR) of the cache memory. In addition to the reduction of th number of bits, this policy also reduces the time to access the MAR and as a result, it reduces the time that is requited for the prefetching process.