DocumentCode
2510390
Title
An approach to solve the cache thrashing problem
Author
Fang, Zhixi ; Lu, Mi ; Lin, Hua
Author_Institution
Convex Comput. Corp., Richardson, TX, USA
fYear
1991
fDate
30 Apr-2 May 1991
Firstpage
330
Lastpage
335
Abstract
Cache or local memory thrashing problem arises very often in parallel processing architectures where each processor has its local cache or memory and a write-back protocol is employed for cache coherence. To solve the problem of large amount of data moving back and forth between the caches or local memories in different processors, techniques associated with parallel compiler need to be developed. Based on the relations between array element accesses and enclosed loop indices in a nested parallel construct, the authors present some approaches to reduce the data movement between the caches or local memories for parallel programs. By analyzing the array subscript expressions, the compilers let the processor execute the corresponding iterations of parallel loops in terms of the data in its cache or local memory at execution time. It benefits, particularly, the parallel programs in which a parallel loop is enclosed by a sequential loop and array elements are repeatedly used in different iterations of the parallel loop
Keywords
buffer storage; parallel processing; parallel programming; program compilers; protocols; array element accesses; array subscript expressions; cache thrashing problem; enclosed loop indices; local memory thrashing problem; parallel compiler; parallel processing architectures; parallel programs; write-back protocol; Access protocols; Computer architecture; Ear; Iterative algorithms; Memory architecture; Multiprocessing systems; Multiprocessor interconnection networks; Parallel processing; Petroleum; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1991. Proceedings., Fifth International
Conference_Location
Anaheim, CA
Print_ISBN
0-8186-9167-0
Type
conf
DOI
10.1109/IPPS.1991.153799
Filename
153799
Link To Document