Compiler-directed cache coherence scheme with improved intertask locality

Lynn Choi, Pen Chung Yew

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

In this paper, we introduce a compiler-directed coherence scheme which can exploit most of the temporal and spatial locality across task boundaries. It requires only an extended tag field per cache word, one modified memory access instruction, and a counter called the epoch counter in each processor. By using the epoch counter as a system-wide version number, the scheme simplifies the cache hardware of previous version control [5] or timestamp-based schemes [12], but still exploits most of the temporal and spatial locality across task boundaries. We present a compiler algorithm to generate the appropriate memory access instructions for the proposed scheme. The algorithm is based on a data flow analysis technique. It identifies potential stale references by examining memory reference patterns in a source program.

Original languageEnglish
Title of host publicationProceedings of the ACM/IEEE Supercomputing Conference
Editors Anon
PublisherIEEE
Pages773-782
Number of pages10
Publication statusPublished - 1994
Externally publishedYes
EventProceedings of the 1994 Supercomputing Conference - Washington, DC, USA
Duration: 1994 Nov 141994 Nov 18

Other

OtherProceedings of the 1994 Supercomputing Conference
CityWashington, DC, USA
Period94/11/1494/11/18

Fingerprint

Data storage equipment
Data flow analysis
Hardware

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Choi, L., & Yew, P. C. (1994). Compiler-directed cache coherence scheme with improved intertask locality. In Anon (Ed.), Proceedings of the ACM/IEEE Supercomputing Conference (pp. 773-782). IEEE.

Compiler-directed cache coherence scheme with improved intertask locality. / Choi, Lynn; Yew, Pen Chung.

Proceedings of the ACM/IEEE Supercomputing Conference. ed. / Anon. IEEE, 1994. p. 773-782.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, L & Yew, PC 1994, Compiler-directed cache coherence scheme with improved intertask locality. in Anon (ed.), Proceedings of the ACM/IEEE Supercomputing Conference. IEEE, pp. 773-782, Proceedings of the 1994 Supercomputing Conference, Washington, DC, USA, 94/11/14.
Choi L, Yew PC. Compiler-directed cache coherence scheme with improved intertask locality. In Anon, editor, Proceedings of the ACM/IEEE Supercomputing Conference. IEEE. 1994. p. 773-782
Choi, Lynn ; Yew, Pen Chung. / Compiler-directed cache coherence scheme with improved intertask locality. Proceedings of the ACM/IEEE Supercomputing Conference. editor / Anon. IEEE, 1994. pp. 773-782
@inproceedings{f650aa6371644cb3aae1b4b313abfeca,
title = "Compiler-directed cache coherence scheme with improved intertask locality",
abstract = "In this paper, we introduce a compiler-directed coherence scheme which can exploit most of the temporal and spatial locality across task boundaries. It requires only an extended tag field per cache word, one modified memory access instruction, and a counter called the epoch counter in each processor. By using the epoch counter as a system-wide version number, the scheme simplifies the cache hardware of previous version control [5] or timestamp-based schemes [12], but still exploits most of the temporal and spatial locality across task boundaries. We present a compiler algorithm to generate the appropriate memory access instructions for the proposed scheme. The algorithm is based on a data flow analysis technique. It identifies potential stale references by examining memory reference patterns in a source program.",
author = "Lynn Choi and Yew, {Pen Chung}",
year = "1994",
language = "English",
pages = "773--782",
editor = "Anon",
booktitle = "Proceedings of the ACM/IEEE Supercomputing Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Compiler-directed cache coherence scheme with improved intertask locality

AU - Choi, Lynn

AU - Yew, Pen Chung

PY - 1994

Y1 - 1994

N2 - In this paper, we introduce a compiler-directed coherence scheme which can exploit most of the temporal and spatial locality across task boundaries. It requires only an extended tag field per cache word, one modified memory access instruction, and a counter called the epoch counter in each processor. By using the epoch counter as a system-wide version number, the scheme simplifies the cache hardware of previous version control [5] or timestamp-based schemes [12], but still exploits most of the temporal and spatial locality across task boundaries. We present a compiler algorithm to generate the appropriate memory access instructions for the proposed scheme. The algorithm is based on a data flow analysis technique. It identifies potential stale references by examining memory reference patterns in a source program.

AB - In this paper, we introduce a compiler-directed coherence scheme which can exploit most of the temporal and spatial locality across task boundaries. It requires only an extended tag field per cache word, one modified memory access instruction, and a counter called the epoch counter in each processor. By using the epoch counter as a system-wide version number, the scheme simplifies the cache hardware of previous version control [5] or timestamp-based schemes [12], but still exploits most of the temporal and spatial locality across task boundaries. We present a compiler algorithm to generate the appropriate memory access instructions for the proposed scheme. The algorithm is based on a data flow analysis technique. It identifies potential stale references by examining memory reference patterns in a source program.

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

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

M3 - Conference contribution

AN - SCOPUS:0028754154

SP - 773

EP - 782

BT - Proceedings of the ACM/IEEE Supercomputing Conference

A2 - Anon, null

PB - IEEE

ER -