Alexander V. Veidenbaum
Rajesh Gupta
- 1.D. H. Albonesi, Dynamic IPC/Clock Rate Optimization, intl. $ymposmm on Computer Architecture, pp. 282-292, June 1998.]] Google Scholar
Digital Library
- 2.A. Chien and J. Kim, Planar Adaptive Routing: Low-cost Adaptive Networks for Multiprocessors, Intl. Symposium on Computer Architecture, pp. 268-277, July 1992.]] Google ScholarDigital Library
- 3.W. J. Dally and H. Aoki, Deadlock-free adaptive routing in multicomputer networks using virtual channels, IEEE Transactions on Parallel and Distributed Systems, vol. 4, pp. 466-475, Apr 1993.]] Google ScholarDigital Library
- 4.Fredrik Dahlgren, Michel Dubois and Per Stenstrom, Fixed and Adaptive Sequential Prefetching in Shared Memory Multiprocessors, Intl. Conference on Parallel Processing, Aug, 1993.]] Google ScholarDigital Library
- 5.J. Kuskin et al, The Stanford FLASH Multiprocessor, Intl. Symposium on Computer Architecture, pp. 302-313, April 1994.]] Google ScholarDigital Library
- 6.Edward H. Cornish and Alex Veidenbaum, An Integrated Hardware/Software Data Prefetching Scheme for Shared-Memory Multiprocessors, Intl. Conference on Parallel Processing, Aug. 1994.]] Google ScholarDigital Library
- 7.PentiumTM Processor User's Manual, Intel Corporation, 1993.]]Google Scholar
- 8.T. Juan, S. Sanjeevan, and J. Navaro, Dynamic History Length Fitting: a Third Level of Adaptivity for Branch Prediction, intl. Symposium on Computer Architecture, pp.155-166, July 1998.]] Google ScholarDigital Library
- 9.K. Inoue, K. Kai, and K. Marukami, High Bandwidth, Variable Line-Size Cache Architecture for Merged DRAM/Logic LSIs, Japanese IEICE Transactions on Electronics, Vol. E81-C No. 9, pp. 1438-1447, September 1999.]]Google Scholar
- 10.S. Kumar and C. Wilkerson, Exploiting Spatial Locality in Data Caches Using Spatial Footprints, Intl. Symposium on Computer Architecture,pp. 357-368, June 1998]] Google ScholarDigital Library
- 11.MIPS R3000 hardware manual, MIPS Corporation.]]Google Scholar
- 12.T. Matsumoto, K. Nishimura, T. Kudoh, K. Hiraki, H. Amano, and H. Tanaka, Distributed Shared Memory Architecture for JUMP-i: A General-Purpose MPP Prototype, Intl. Symposium on Parallel Architecures, Algorithms, and Networks, pp. 131-137, June 1996.]] Google ScholarDigital Library
- 13.Steve Turner and Alex Veidenbaum, Scalability of the Cedar System, Supercomputing, pp. 247-254, 1994.]]Google Scholar
- 14.Jack E. Veenstra and Robert J. ~Fowler, MINT: A Front End for Efficient Simulation of Shared- Memory Multiprocessors, Intl. Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems , pp. 201-207, Jan. 1994.]] Google ScholarDigital Library
- 15.T.-Y. Yeh and Y. N. Patt, Two Level Adaptive Training Branch Prediction, Intl. Symposium on Microarchitecture, pp. 51-61, Nov. 1991.]] Google ScholarDigital Library
Index Terms
- Adapting cache line size to application behavior
Recommendations
Heterogeneous way-size cache
ICS '06: Proceedings of the 20th annual international conference on SupercomputingSet-associative cache architectures are commonly used. These caches consist of a number of ways, each of the same size. We have observed that the different ways have very different utilization, which motivates the design of caches with heterogeneous way ...
Line (block) size choice for CPU cache memories
The line (block) size of a cache memory is one of the parameters that most strongly affects cache performance. In this paper, we study the factors that relate to the selection of a cache line size. Our primary focus is on the cache miss ratio, but we ...
Cache miss behavior: is it √2?
CF '06: Proceedings of the 3rd conference on Computing frontiersIt has long been empirically observed that the cache miss rate decreased as a power law of cache size, where the power was approximately -1/2. In this paper, we examine the dependence of the cache miss rate on cache size both theoretically and through ...
Comments