NDLI: Quality programmable vector processors for approximate computing

Please wait, while we are loading the content...

Quality programmable vector processors for approximate computing

MLP-aware dynamic instruction window resizing for adaptively exploiting both ILP and MLP

Exploiting GPU peak-power and performance tradeoffs through reduced effective pipeline latency

Virtually-aged sampling DMR: unifying circuit failure prediction and circuit failure detection

Linearly compressed pages: a low-complexity, low-latency main memory compression framework

Crank it up or dial it down: coordinated multiprocessor frequency and folding control

Linearizing irregular memory accesses for improved correlated prefetching

Insertion and promotion for tree-based PseudoLRU last-level caches

Enabling datacenter servers to scale out economically and sustainably

Multi-grain coherence directories

Efficient management of last-level caches in graphics processors for 3D scene rendering workloads

Kiln: closing the performance gap between systems with and without persistence support

Trace based phase prediction for tightly-coupled heterogeneous cores

SAGE: self-tuning approximation for graphics engines

TLC: a tag-less cache for reducing dynamic first level cache energy

A locality-aware memory hierarchy for energy-efficient GPU architectures

Use it or lose it: wear-out and lifetime in future chip multiprocessors

RowClone: fast and energy-efficient in-DRAM bulk data copy and initialization

Wavelength stealing: an opportunistic approach to channel sharing in multi-chip photonic interconnects

RDIP: return-address-stack directed instruction prefetching

Imbalanced cache partitioning for balanced data-parallel programs

Efficient multiprogramming for multicores with SCAF

BulkCommit: scalable and fast commit of atomic blocks in a lazy multiprocessor environment

Energy efficient GPU transactional memory via space-time optimizations

Aegis: partitioning data block for efficient recovery of stuck-at-faults in phase change memory

Heterogeneous system coherence for integrated CPU-GPU systems

Approximate storage in solid-state memories

Decoupled compressed cache: exploiting spatial locality for energy-optimized compressed caching

Divergence-aware warp scheduling

uDIREC: unified diagnosis and reconfiguration for frugal bypass of NoC faults

Quantifying the relationship between the power delivery network and architectural policies in a 3D-stacked memory device

DESC: energy-efficient data exchange using synchronized counters

SHIFT: shared history instruction fetch for lean-core server processors

The reuse cache: downsizing the shared last-level cache

Allocating rotating registers by scheduling

Large-reach memory management unit caches

Meet the walkers: accelerating index traversals for in-memory databases

Warped gates: gating aware scheduling and power gating for GPGPUs

Implicit-storing and redundant-encoding-of-attribute information in error-correction-codes

Quality programmable vector processors for approximate computing

Content Provider	ACM Digital Library
Author	Raghunathan, Anand Chakradhar, Srimat T. Chippa, Vinay K. Venkataramani, Swagath Roy, Kaushik
Abstract	Approximate computing leverages the intrinsic resilience of applications to inexactness in their computations, to achieve a desirable trade-off between efficiency (performance or energy) and acceptable quality of results. To broaden the applicability of approximate computing, we propose quality programmable processors, in which the notion of quality is explicitly codified in the HW/SW interface, i.e., the instruction set. The ISA of a quality programmable processor contains instructions associated with quality fields to specify the accuracy level that must be met during their execution. We show that this ability to control the accuracy of instruction execution greatly enhances the scope of approximate computing, allowing it to be applied to larger parts of programs. The micro-architecture of a quality programmable processor contains hardware mechanisms that translate the instruction-level quality specifications into energy savings. Additionally, it may expose the actual error incurred during the execution of each instruction (which may be less than the specified limit) back to software. As a first embodiment of quality programmable processors, we present the design of Quora, an energy efficient, quality programmable vector processor. Quora utilizes a 3-tiered hierarchy of processing elements that provide distinctly different energy vs. quality trade-offs, and uses hardware mechanisms based on precision scaling with error monitoring and compensation to facilitate quality programmable execution. We evaluate an implementation of Quora with 289 processing elements in 45nm technology. The results demonstrate that leveraging quality-programmability leads to 1.05X-1.7X savings in energy for virtually no loss (< 0.5%) in application output quality, and 1.18X-2.1X energy savings for modest impact (<2.5%) on output quality. Our work suggests that quality programmable processors are a significant step towards bringing approximate computing to the mainstream.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISBN	9781450326384
DOI	10.1145/2540708.2540710
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-12-07
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Approximate computing Intrinsic application resilience Energy-efficient architecture Quality programmable processors
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Quality-aware data allocation in approximate DRAM

Approximate Computing: An Energy-Efficient Computing Technique for Error Resilient Applications

Analysis and characterization of inherent application resilience for approximate computing

Analysis and characterization of inherent application resilience for approximate computing

Models for energy-efficient approximate computing

Truncated SIMD Multiplier Architecture for Approximate Computing in Low-Power Programmable Processors

Approximate storage for energy efficient spintronic memories

Scalable effort hardware design: Exploiting algorithmic resilience for energy efficiency

Quality configurable reduce-and-rank for energy efficient approximate computing

Quality programmable vector processors for approximate computing

Similar Documents

Quality-aware data allocation in approximate DRAM

Approximate Computing: An Energy-Efficient Computing Technique for Error Resilient Applications

Analysis and characterization of inherent application resilience for approximate computing

Analysis and characterization of inherent application resilience for approximate computing

Models for energy-efficient approximate computing

Truncated SIMD Multiplier Architecture for Approximate Computing in Low-Power Programmable Processors

Approximate storage for energy efficient spintronic memories

Scalable effort hardware design: Exploiting algorithmic resilience for energy efficiency

Quality configurable reduce-and-rank for energy efficient approximate computing

Quality programmable vector processors for approximate computing