English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Shiftsreduce: Minimizing shifts in racetrack memory 4.0

Khan, A. A., Hameed, F., Bläsing, R., Parkin, S. S. P., & Castrillon, J. (2019). Shiftsreduce: Minimizing shifts in racetrack memory 4.0. ACM Transactions on Architecture and Code Optimization, 16(4): 56. doi:10.1145/3372489.

Item is

Basic

show hide
Genre: Journal Article

Files

show Files
hide Files
:
3372489.pdf (Publisher version), 2MB
Name:
3372489.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
2019
Copyright Info:
The Author(s)
License:
-

Locators

show
hide
Locator:
https://doi.org/10.1145/3372489 (Publisher version)
Description:
-

Creators

show
hide
 Creators:
Khan, Asif Ali1, Author
Hameed, Fazal1, Author
Bläsing, Robin2, Author
Parkin, Stuart S. P.2, Author              
Castrillon, Jeronimo1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Nano-Systems from Ions, Spins and Electrons, Max Planck Institute of Microstructure Physics, Max Planck Society, ou_3287476              

Content

show
hide
Free keywords: -
 Abstract: Racetrack memories (RMs) have significantly evolved since their conception in 2008, making them a serious contender in the field of emerging memory technologies. Despite key technological advancements, the access latency and energy consumption of an RM-based system are still highly influenced by the number of shift operations. These operations are required to move bits to the right positions in the racetracks. This article presents data-placement techniques for RMs that maximize the likelihood that consecutive references access nearby memory locations at runtime, thereby minimizing the number of shifts. We present an integer linear programming (ILP) formulation for optimal data placement in RMs, and we revisit existing offset assignment heuristics, originally proposed for random-access memories. We introduce a novel heuristic tailored to a realistic RM and combine it with a genetic search to further improve the solution. We show a reduction in the number of shifts of up to 52.5%, outperforming the state of the art by up to 16.1%.

Details

show
hide
Language(s):
 Dates: 2019-12-26
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: P13856
DOI: 10.1145/3372489
 Degree: -

Event

show

Legal Case

show

Project information

show hide
Project name : Spin Orbitronics for Electronic Technologies (SORBET)
Grant ID : 670166
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: ACM Transactions on Architecture and Code Optimization
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 16 (4) Sequence Number: 56 Start / End Page: - Identifier: ISSN: 1544-3973