Premium
A survey of value prediction techniques for leveraging value locality
Author(s) -
Mittal Sparsh
Publication year - 2017
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.4250
Subject(s) - locality , computer science , key (lock) , value (mathematics) , latency (audio) , bandwidth (computing) , categorization , data mining , machine learning , artificial intelligence , telecommunications , computer security , philosophy , linguistics
Summary Value locality (VL) refers to recurrence of values in a memory structure, and value prediction (VP) refers to predicting VL and leveraging it for diverse optimizations. VP holds the promise of exceeding true‐data dependencies and provide performance and bandwidth advantages in both single‐ and multi‐threaded applications. Fully exploiting the potential of VL, however, requires addressing several challenges, such as achieving high accuracy and coverage, reducing hardware and latency overheads, etc. In this paper, we present a survey of techniques for leveraging value locality. We categorize the research works based on key parameters to provide insights and highlight similarities and differences. This paper is expected to be useful for researchers, processor architects, and chip‐designers.