Data cache performance of supercomputer applications

Author

Callahan, David ; Porterfield, Allan

Author_Institution

Tera Comput. Co., Seattle, WA, USA

fYear

1990

fDate

12-16 Nov 1990

Firstpage

564

Lastpage

572

Abstract

The data cache performance of a set of computationally intensive programs is examined. The measurement of cache performance arises from an interest in improving the performance of a program during compilation. It was observed that the data caches contained the values for between 45% and 99+% of the array access, depending on the cache and the program. The delays from the misses accounted for up to half of the total execution time of the program. The misses were grouped in a subset of source program references which resulted in misses on every access. It is pointed out that aggressive compilers should be able to improve program performance by focusing on those array accesses that result in cache misses

Keywords

buffer storage; delays; multiprocessing systems; program compilers; storage management; aggressive compilers; array accesses; cache misses; compilation; computationally intensive programs; data cache performance; delays; source program references; Application software; Delay effects; Manufacturing processes; National electric code; Registers; Supercomputers; Vector processors; Workstations;

fLanguage

English

Publisher

ieee

Conference_Titel

Supercomputing '90., Proceedings of

Conference_Location

New York, NY

Print_ISBN

0-8186-2056-0

Type

conf

DOI

10.1109/SUPERC.1990.130070

Filename

130070