Cache sampling by sets

Author

Liu, Lishing ; Peir, Jih-Kwon

Author_Institution

IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

Volume

1

Issue

2

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

98

Lastpage

105

Abstract

An approach to workload sampling in which, instead of selection of memory references based on the time parameter, sample decisions are based on where the cache is accessed. More specifically, the sampling heuristics are focused on analysis for set-associative caches. The validity of the heuristics is supported with empirical data. Four sampling policies are discussed, and simulation results based on a commercial database transaction workload are presented. Observations from simulation studies with SPEC 1.0 uniprogram benchmarks are also described. An environment in which congruence class sampling may be useful is illustrated.<>

Keywords

buffer storage; system monitoring; transaction processing; SPEC 1.0 uniprogram benchmarks; congruence class sampling; database transaction workload; sample decisions; sampling heuristics; sampling policies; set-associative caches; workload sampling; Clocks; Emulation; High performance computing; Instruments; Large-scale systems; Microprocessors; Modems; Sampling methods; Statistics; Very large scale integration;

fLanguage

English

Journal_Title

Very Large Scale Integration (VLSI) Systems, IEEE Transactions on

Publisher

ieee

ISSN

1063-8210

Type

jour

DOI

10.1109/92.238426

Filename

238426