• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

How to solve the current memory access and data transfer bottlenecks: At the processor architecture or at the compiler level (2000)

by F Catthoor N D Dutt, C E Kozyrakis
Venue:In
Add To MetaCart

Tools

Sorted by:
Results 1 - 2 of 2

I-copes: fast instruction code placement for embedded systems to improve performance and energy efficiency

by Sri Parameswaran, Jörg Henkel - In ICCAD ’01: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design , 2001
"... The ratio of cache hits to cache misses in a computer system is, to a large extent, responsible for its characteristics such as energy consumption and performance. In recent years energy efficiency has become one of the dominating design constraints, due to the rapid growth in market share for mobil ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
The ratio of cache hits to cache misses in a computer system is, to a large extent, responsible for its characteristics such as energy consumption and performance. In recent years energy efficiency has become one of the dominating design constraints, due to the rapid growth in market share for mobile computing/communication/internet devices. In this paper we present a novel fast constructive technique that relocates the instruction code in such a manner into the main memory that the cache is utilized more efficiently. The technique is applied as a pre–processing step, i.e. before the code is executed. It is applicable for embedded systems where the number and characteristics of tasks running on the system is know a priori. The technique does not impose any computational overhead to the system. As a result of applying our technique to a variety of real-world applications we measured (through simulation) that the number of cache misses drops significantly. Further, this reduces the energy consumption of a whole system (CPU, caches, buses, main memory) by up to 65 % at an only slightly increased memory size of 13 % on average. 1

A Data Cache with Dynamic Mapping

by Paolo D'Alberto, Alexandru Nicolau, Alexander Veidenbaum, Ru Nicolau, Er Veidenbaum - in Languages and Compilers for Parallel Computing, ser. Lecture Notes in Computer Science , 2003
"... Dynamic Mapping is an approach to cope with a loss of performance due to cache interference and to improve performance predictability of blocked algorithms for modern architectures. An example is matrix multiply: tiling matrix multiply for a data cache of 16KB using optimal tiles size achieves a ..."
Abstract - Add to MetaCart
Dynamic Mapping is an approach to cope with a loss of performance due to cache interference and to improve performance predictability of blocked algorithms for modern architectures. An example is matrix multiply: tiling matrix multiply for a data cache of 16KB using optimal tiles size achieves an average data-cache miss rate of 3%, but with peaks of 16% due to interference.
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University