Y. Afek
- [Bro88] Geoffrey Brown. Asynchronous multicaches. Submitted for publication to Distributed Computing., 1988.Google Scholar
- [DSB86] M. Dubois, C. Scheufich, and F. Briggs. Memory access buffering in multiprocessors. In 13th International Symposium on Computer Architecture, pages 434-442, 1986. Google ScholarDigital Library
- [Lam79] Leslie Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28:690-691, 1979.Google ScholarDigital Library
- [LT87] Nancy A. Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of 6th ACM Symposium on Principles of Distributed Computation, pages 137-151, August 1987. Expanded version available as Technical Report MIT/LCS/TR-387, April 1987. Google ScholarDigital Library
- [Lyn88] Nancy A. Lynch. I/O automata: A model for discrete event systems. Technical Report MIT/LCS/TM-351, MIT, March 1988. Also, in 22nd Annual Conference on Information Science and Systems, Princeton University, Princeton, N. J., March 1988.Google ScholarCross Ref
- [SD87] C. Scheurich and M. Dubois. Correct memory operation of cache-based multiprocessors. In 14th International Symposium on Computer Architecture, pages 234-243, 1987. Google ScholarDigital Library
- [Smi82] A. J. Smith. Cache memories. Computing Surveys, 14:473-540, 1982. Google ScholarDigital Library
Index Terms
- A lazy cache algorithm
Recommendations
Lazy cache invalidation for self-modifying codes
CASES '12: Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systemsJust-in-time compilation with dynamic code optimization is often used to help improve the performance of applications that utilize high-level languages and virtual run-time environments, such as those found in smartphones. Just-in-time compilation ...
Location cache: a low-power L2 cache system
ISLPED '04: Proceedings of the 2004 international symposium on Low power electronics and designWhile set-associative caches incur fewer misses than direct-mapped caches, they typically have slower hit times and higher power consumption, when multiple tag and data banks are probed in parallel. This paper presents the location cache structure which ...
Criticality aware tiered cache hierarchy: a fundamental relook at multi-level cache hierarchies
ISCA '18: Proceedings of the 45th Annual International Symposium on Computer ArchitectureOn-die caches are a popular method to help hide the main memory latency. However, it is difficult to build large caches without substantially increasing their access latency, which in turn hurts performance. To overcome this difficulty, on-die caches ...
Comments