loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Euromicro Symposium on Digital System Design (DSD'02)
An Asynchronous Victim Cache
Dortmund, Germany
September 04-September 06
ISBN: 0-7695-1790-0
D. Hormdee, University of Manchester
J. D. Garside, University of Manchester
S. B. Furber, University of Manchester

Memory bandwidth is a limiting factor with many modern microprocessors and it is usual to include a cache to reduce the amount of memory traffic. Of the two commonly used cache write-policies, the copy-back approach is better than the write-through approach in this respect. The performance of both approaches can be further aided by the inclusion of a small buffer in the path of outgoing writes to the main memory, especially if this buffer is capable of forwarding its contents back into the main cache if they are needed again before they are emptied from the buffer. This is what is known as a victim cache.

For an asynchronous microprocessor it is logical that the cache system should be asynchronous as well; since a large degree of the flexibility of an asynchronous microprocessor would be lost if it were to use a standard synchronous memory interface. However, implementing a forwarding mechanism in an asynchronous system is more difficult because the data to be forwarded is flowing in a manner unsynchronised to the process which requires it.

This paper presents an architecture for a victim cache to resolve forwarding in a totally asynchronous environment. The resultant structure forms a key part of an asynchronous copy-back cache system for the Amulet3, a third generation asynchronous implementation of the ARM processor.

Index Terms:
victim cache, copy-back cache architecture, asynchronous design
Citation:
D. Hormdee, J. D. Garside, S. B. Furber, "An Asynchronous Victim Cache," dsd, pp.4, Euromicro Symposium on Digital System Design (DSD'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.