ACM Home Page
Please provide us with feedback. Feedback
A performance analysis of automatically managed top of stack buffers
Full text PdfPdf (937 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 14th annual international symposium on Computer architecture table of contents
Pittsburgh, Pennsylvania, United States
Pages: 272 - 281  
Year of Publication: 1987
ISBN:0-8186-0776-9
Authors
T. J. Stanley  Digital Equipment Corporation, Littleton, MA
R. G. Wedig  Wedig Consulting Services, Palo Alto, CA
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 17,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/30350.30381
What is a DOI?

ABSTRACT

In this paper, the feasibility of using register banks as a top of stack (TOS) buffer is demonstrated. A quantitative performance evaluation is made of three automatic TOS buffer management algorithms: a simple single pointer algorithm, an intelligent single pointer algorithm, and a sophisticated double pointer algorithm. An automatically managed TOS buffer can effectively cache local data accesses resulting in a large memory traffic reduction. Results demonstrate that a small (with respect to the size of the benchmark data set) TOS buffer provides a very high data reference hit ratio and requires minimal processor intervention for TOS buffer management. The simple single pointer algorithm is shown to provide the best overall performance for various metrics including memory bandwidth, TOS buffer hit ratio, processor intervention, and processor execution speed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
D. A. Patterson and C. H. Sequin. A VLSI RISC. Computer, 8-21, September 1982.
 
4
R. P. Blake. Exploring a Stack Architecture. Computer, May 1977.
 
5
 
6
3600 Technical Summary. Symbolics, Inc., 1983.
 
7
Richard L. Sites. How to Use 1000 Registers. CalTech Conference on VLSI, January 1979.
 
8
Yuval Tamir and Carlo H. Sequin. Strategies for Managing the Register File in RISC. IEEE Transactions on Computere, 32(11), November 1983.
 
9
Timothy J. Stanley. A Performance Evaluation of Automatically Managed Top of Stack Buffers. Master's thesis, Carnegie-Mellon University, 1985.
 
10
Robert G. Wedig. Software and Hardware Techniques for Stack Management. Hawaii International Conference on System Sciences, January 1987.
11
12
 
13

CITED BY  8

Collaborative Colleagues:
T. J. Stanley: colleagues
R. G. Wedig: colleagues