• norsk
    • English
  • English 
    • norsk
    • English
  • Login
View Item 
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
  •   Home
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Combining the SHA and ELD3 techniques to achieve energy-efficient data cache accesses

Asjad, Salahuddin
Master thesis
Thumbnail
View/Open
17174_FULLTEXT.pdf (1.408Mb)
17174_COVER.pdf (1.556Mb)
URI
http://hdl.handle.net/11250/2463523
Date
2017
Metadata
Show full item record
Collections
  • Institutt for datateknologi og informatikk [3870]
Abstract
In recent years, CPU performance has become energy constrained. If performance is to continue increasing, new methods for creating more energy efficient CPUs will have to be explored. Current computing systems use complex CPUs that interface to the main memory through a hierarchy of caches. These performance-centric design use a lot of power and chip-area to minimize the gap between CPU and main memory speeds. Caches contribute much of a systems's energy consumption. Conventional set-associative level-one data caches (L1 DCs) are performance-critical and are therefore optimized for speed. The access latency is optimized by accessing all ways in parallel for load operations. However, this results in a significant amount of wasted energy, since only data from one way is used. To reduce energy, numerous cache architectures, such as way-prediction, way-shutdown and highly-associative have been proposed. However, these optimizations in many cases increase latency and complexity, which makes them unattractive for L1 caches.

This thesis cover the implementation and evaluation of a combination of techniques that enables access to only the way where the data resides. The first technique works by halting cache ways that cannot possobly contain the requested data. The second technique works by sequentially accessing tag and data ways when there is no data dependency with a subsequent instruction. These techniques have been implemented in the SHMAC framework, and benchmarked with a subset of MiBench applications.
Publisher
NTNU

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit
 

 

Browse

ArchiveCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsDocument TypesJournalsThis CollectionBy Issue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

View Usage Statistics

Contact Us | Send Feedback

Privacy policy
DSpace software copyright © 2002-2019  DuraSpace

Service from  Unit