![]() ![]() This paper is devoted to the reduction of data transfer between the main memory and direct mapped cache for blocked shortest paths algorithms (BSPA), which represent data by a D matrix of blocks. The direct mapped cache significantly loses the associative cache we can improve its performance by appropriate mapping virtual addresses to physical locations. After comparing the basic and blocked Floyd-Warshall algorithms, we conclude that the blocked algorithm well localizes data accesses within one block, but it does not localize data dependencies among blocks. We have measured the frequencies versus the cache size, the data block size, the amount of processed data, the type of cache, and the type of algorithm. This paper presents a technique of simulating the direct mapped, k-way associative and fully associative cache during the algorithm execution, to measure the frequency of read data to cache and write data to memory operations. The all pairs shortest paths algorithms solve many practical problems, and it is important to know what algorithm and what cache type match best. ![]() The miss rate strongly depends on the executed algorithm. The least recently used replacement policy serves the sets. The hit and miss rate depends on the cache type: direct mapped, set associative and fully associative cache. The replacement policy chooses a data to evict, trying to predict the future accesses to memory. The misses produce processor stalls and slow down the computations. In the last case, the cache may have to evict other data. When the processor accesses memory, the cache behavior depends on if the data is in cache: a cache hit occurs if it is, and, a cache miss occurs, otherwise. Caches are capable of exploiting temporal and spatial localities during program execution. It aims to store copies of frequently used data and to reduce the access time to the main memory. Caches are intermediate level between fast CPU and slow main memory. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |