DocumentCode
2968591
Title
Reducing multithreaded frame cache miss ratio by prefetching and working frame set scheduling
Author
Choi, Jongpil ; Ha, Soorihoi ; Jhon, Chushik
Author_Institution
Seoul Nat. Univ., South Korea
fYear
1996
fDate
11-13 Jun 1996
Firstpage
479
Lastpage
486
Abstract
In software-oriented multithreading execution model, the compiler identifies the remote accesses and performs fast context switches to hide remote access latency. In TAM model of execution, threads access the local memory through a data structure called “frame”. This paper introduces a cache memory for frame structure and applies two techniques to reduce the cache miss ratio. One is a frame prefetching, which is based on the frame scheduling information, and the other is a changing frame execution sequences by the working frame set concept, multithreading simulation is performed using benchmark programs and causes of cache misses are classified and analyzed. This paper shows the promising result that the frame prefetching based on scheduling information is very effective to reduce the cache miss ratio. But the effect of reordering the sequence of the frame execution is not so big than the prefetching
Keywords
cache storage; parallel architectures; processor scheduling; benchmark programs; cache memory; cache misses; frame prefetching; frame scheduling; frame set scheduling; miss ratio; multithreaded frame cache; multithreading execution model; multithreading simulation; prefetching; working frame set; Analytical models; Cache memory; Context modeling; Data structures; Delay; Information analysis; Multithreading; Prefetching; Switches; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on
Print_ISBN
0-7803-3529-5
Type
conf
DOI
10.1109/ICAPP.1996.562912
Filename
562912
Link To Document