Procedure Placement Using Temporal Ordering Information

Procedure Placement Using Temporal Ordering Information (1997)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nikolas Gloy , Trevor Blackwell , Michael D. Smith , Brad Calder

Citations:

50 - 9 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Procedure Placement Using Temporal Ordering Information	user correction - Legacy Corrections
AUTHOR NAME	Nikolas Gloy	user correction - Legacy Corrections
AUTHOR AFFIL	Division of Engineering and Applied Sciences, Harvard University; Department of Computer Science and Engineering, University of California, San Diego	user correction - Legacy Corrections
AUTHOR NAME	Trevor Blackwell	user correction - Legacy Corrections
AUTHOR AFFIL	Division of Engineering and Applied Sciences, Harvard University; Department of Computer Science and Engineering, University of California, San Diego	user correction - Legacy Corrections
AUTHOR NAME	Michael D. Smith	user correction - Legacy Corrections
AUTHOR AFFIL	Division of Engineering and Applied Sciences, Harvard University; Department of Computer Science and Engineering, University of California, San Diego	user correction - Legacy Corrections
AUTHOR NAME	Brad Calder	user correction - Legacy Corrections
AUTHOR AFFIL	Division of Engineering and Applied Sciences, Harvard University; Department of Computer Science and Engineering, University of California, San Diego	user correction - Legacy Corrections
ABSTRACT	Instruction cache performance is very important to instruction fetch efficiency and overall processor performance. The layout of an executable has a substantial effect on the cache miss rate during execution. This means that the performance of an executable can be improved significantly by applying a code-placement algorithm that minimizes instruction cache conflicts. We describe an algorithm for procedure placement, one type of codeplacement algorithm, that significantly differs from previous approaches in the type of information used to drive the placement algorithm. In particular, we gather temporal ordering information that summarizes the interleaving of procedures in a program trace. Our algorithm uses this information along with cache configuration and procedure size information to better estimate the conflict cost of a potential procedure ordering. We compare the performance of our algorithm with previously published procedure -placement algorithms and show noticeable improvemen...	user correction - Legacy Corrections
YEAR	1997	user correction - Legacy Corrections
CITATIONS	12 found	ParsCit 1.0