A survey of value prediction techniques for leveraging value locality. (11th September 2017)

• Record Type: Journal Article
• Authors: Mittal, Sparsh
• Is Part Of: Concurrency and computation. Volume 29:Number 21(2017)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2017-09-11
• Subjects: classification -- parallelization -- review -- speculation -- value locality -- value prediction; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4250
• Languages: English
• ISSNs: 1532-0626

Abstract

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.