ACM Home Page
Please provide us with feedback. Feedback
Low load latency through sum-addressed memory (SAM)
Full text PdfPdf (940 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 25th annual international symposium on Computer architecture table of contents
Barcelona, Spain
Pages: 369 - 379  
Year of Publication: 1998
ISBN:0-8186-8491-7
Also published in ...
Authors
William L. Lynch  Sun Microsystems, 901 San Antonio Road, MS USUN02-203, Palo Alto CA
Gary Lauterbach  Sun Microsystems, 901 San Antonio Road, MS USUN02-203, Palo Alto CA
Joseph I. Chamdani  Sun Microsystems, 901 San Antonio Road, MS USUN02-203, Palo Alto CA
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 41,   Citation Count: 5
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/279358.279406
What is a DOI?

ABSTRACT

Load latency contributes significantly to execution time. Because most cache accesses hit, cache-hit latency becomes an important component of expected load latency. Most modern microprocessors have base+offset addressing loads; thus effective cache-hit latency includes an addition as well as the RAM access.This paper introduces a new technique used in the UltraSPARC III microprocessor, Sum-Addressed Memory (SAM), which performs true addition using the decoder of the RAM array, with very low latency. We compare SAM with other methods for reducing the add part of load latency. These methods include sum-prediction with recovery, and bitwise indexing with duplicate-tolerance. The results demonstrate the superior performance of SAM.


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.

APS95
CK94
 
COR88
Cortadella, J., and J. M. Llaberia. Evaluating A+B=K Conditions in Constant Time. IEEE International Symposium on Circuits and Systems, pages 243-6. 1988.
 
COR92
 
DEC92
DEC Publications, Alpha Architecture Handbook, Special Announcement Edition, DEC, Maynard, M.A. 1992
 
HRS+98
Raymond Heald, Ken Shin, Vinita Reddy, I- Feng Kao, Masood Khan, William L. Lynch, Gary Lauterbach, Joe Petolino. 64 KByte Sum-Addressed-Memory Cache with 1.6 ns cycle and 2.6 ns Latency, In ISSCC Proceedings, 1998.
 
Kan87
Gerry Kane, mipsR2000 RISC Architecture, Prentic-Hall, Englewood Cliffs, N.J. 1987
 
LLP+93
William L. Lynch, Gary Lauterbach, Joe Petolino, Dave Poole. Low-Latency Cache Indexing: XOR and SAM Caches. TechNotes SML193-0350, Sun Microsystems Labs, Inc., 1994.
OLU92
SMI82
 
WG94
 
WJ94
Steven J. E. Wilton and Norman P. Jouppi. An Enhanced Access and Cycle Time Model for On-Chip Caches, Tech Report 93/5. DEC Western Research Lab. 1994.
 
WRP92
Tomohisa Wada, Suresh Rajan, Steven A. Przybylski. An Analytical Access Time Model for On-Chip Cache Memories. IEEE Journal of Solid-State Circuits, Vol. 27, No. 8:1147-1156, Aug., 1992.


Collaborative Colleagues:
William L. Lynch: colleagues
Gary Lauterbach: colleagues
Joseph I. Chamdani: colleagues