Hello! I made the model of working cache-memory. In this model FIFO-algorhythm of replacing of addresses was used. It descibe as if cashe is full then candidates for deleting are addresses which refresh seldom.
My cashe works in 2 modes: "read" and "wrire"
Number of requests is equal to lines of code of a program which was generated randomly with including number of repeating for loop code. There are several blocks 2 type loop and linear in this programm.
If "Read-mode" and if an address...
Can the number of cashe-matching be less for size of cashe that great than in previous case
My cashe works in 2 modes: "read" and "wrire"
Number of requests is equal to lines of code of a program which was generated randomly with including number of repeating for loop code. There are several blocks 2 type loop and linear in this programm.
If "Read-mode" and if an address...
Can the number of cashe-matching be less for size of cashe that great than in previous case