Procedure Merging with Instruction Caches (1991)
Cached
Download Links
- [gatekeeper.dec.com]
- [www.hpl.hp.com]
- [gatekeeper.dec.com]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation |
| Citations: | 49 - 0 self |
BibTeX
@INPROCEEDINGS{McFarling91proceduremerging,
author = {Scott McFarling},
title = {Procedure Merging with Instruction Caches},
booktitle = {Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation},
year = {1991},
pages = {71--79}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes a method of determining which procedures to merge for machines with instruction caches. The method uses profile information, the structure of the program, the cache size, and the cache miss penalty to guide the choice. Optimization for the cache is assumed to follow procedure merging. The method weighs the benefit of removing calls with the increase in the instruction cache miss rate. Better performance is achieved than previous schemes that do not consider the cache. Merging always results in a savings, unlike simpler schemes that can make programs slower once cache effects are considered. The new method also has better performance even when parameters to simpler algorithms are varied to get the best performance. This report is a preprint of a paper that will be presented at the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, June 26-28, 1991. Copyright 1990 ACM. i 1 Introduction This paper presents a ...
