Improving cache performance by selective cache bypass.

Chi Hung Chi; Henry Dietz

Improving cache performance by selective cache bypass.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

38 Scopus citations

Abstract

A technique is proposed to prevent the return of infrequently used items to cache after they are bumped from it. Simulations have shown that the return of these items, called cache pollution, typically degrade cache-based system performance (average reference time) by 10% to 30%. The technique proposed involves the use of hardware called a Bypass-Cache, which, under program control, will determine whether each reference should be through the cache or should bypass the cache and reference main memory directly. Several inexpensive heuristics for the compiler to determine how to make each reference are given. It is shown that much of the performance loss can be regained.

Original language	English
Title of host publication	Proceedings of the Hawaii International Conference on System Science
Pages	277-285
Number of pages	9
State	Published - 1989
Event	Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Architecture Track - Kailua-Kona, Hawaii, USA Duration: Jan 3 1989 → Jan 6 1989

Publication series

Name	Proceedings of the Hawaii International Conference on System Science
Volume	1
ISSN (Print)	0073-1129

Conference

Conference	Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Architecture Track
City	Kailua-Kona, Hawaii, USA
Period	1/3/89 → 1/6/89

ASJC Scopus subject areas

General Computer Science

Cite this

@inproceedings{3dec1f233a614fa39cb59f1a7864cdaf,

title = "Improving cache performance by selective cache bypass.",

abstract = "A technique is proposed to prevent the return of infrequently used items to cache after they are bumped from it. Simulations have shown that the return of these items, called cache pollution, typically degrade cache-based system performance (average reference time) by 10% to 30%. The technique proposed involves the use of hardware called a Bypass-Cache, which, under program control, will determine whether each reference should be through the cache or should bypass the cache and reference main memory directly. Several inexpensive heuristics for the compiler to determine how to make each reference are given. It is shown that much of the performance loss can be regained.",

author = "Chi, {Chi Hung} and Henry Dietz",

year = "1989",

language = "English",

isbn = "0818619112",

series = "Proceedings of the Hawaii International Conference on System Science",

pages = "277--285",

booktitle = "Proceedings of the Hawaii International Conference on System Science",

note = "Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Architecture Track ; Conference date: 03-01-1989 Through 06-01-1989",

}

Chi, CH & Dietz, H 1989, Improving cache performance by selective cache bypass. in Proceedings of the Hawaii International Conference on System Science. Proceedings of the Hawaii International Conference on System Science, vol. 1, pp. 277-285, Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Architecture Track, Kailua-Kona, Hawaii, USA, 1/3/89.

TY - GEN

T1 - Improving cache performance by selective cache bypass.

AU - Chi, Chi Hung

AU - Dietz, Henry

PY - 1989

Y1 - 1989

N2 - A technique is proposed to prevent the return of infrequently used items to cache after they are bumped from it. Simulations have shown that the return of these items, called cache pollution, typically degrade cache-based system performance (average reference time) by 10% to 30%. The technique proposed involves the use of hardware called a Bypass-Cache, which, under program control, will determine whether each reference should be through the cache or should bypass the cache and reference main memory directly. Several inexpensive heuristics for the compiler to determine how to make each reference are given. It is shown that much of the performance loss can be regained.

AB - A technique is proposed to prevent the return of infrequently used items to cache after they are bumped from it. Simulations have shown that the return of these items, called cache pollution, typically degrade cache-based system performance (average reference time) by 10% to 30%. The technique proposed involves the use of hardware called a Bypass-Cache, which, under program control, will determine whether each reference should be through the cache or should bypass the cache and reference main memory directly. Several inexpensive heuristics for the compiler to determine how to make each reference are given. It is shown that much of the performance loss can be regained.

UR - http://www.scopus.com/inward/record.url?scp=0024906840&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024906840&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024906840

SN - 0818619112

T3 - Proceedings of the Hawaii International Conference on System Science

SP - 277

EP - 285

BT - Proceedings of the Hawaii International Conference on System Science

T2 - Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences: Architecture Track

Y2 - 3 January 1989 through 6 January 1989

ER -

Improving cache performance by selective cache bypass.

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this