Replacement algorithm for packet associated cache-memory mapping
// In the group check bit [i], the block of 0 will be used to replace (if needed) // check the modification of the bit [i] in Cache, the block K is referenced when Visit (k) occurs
// -----------
INT M; // How many INT K in groups; // which block is referenced
INT USE [M]; // Initialize the check bits to a default replacement priority sequence for (int i = 0; i
