Add to ORKGSpeculative adders divide addition into subgroups and exe-cute them in parallel for higher execution speed and energy efficiency, but at the risk of generating incorrect results. In this paper, we propose a lightweight correlation-aware spec-ulative addition (CASA) method, which exploits the corre-lation between input data and carry-in values observed in real-life benchmarks to improve the accuracy of speculative adders. Experimental results show that applying the CASA method leads to a significant reduction in error rate with only marginal overhead in timing, area, and power consump-tion. 1
This paper focuses on the problem of how to find and effectively exploit speculative thread-level pa...
Thread-Level Speculation (TLS) allows us to automatically parallelize general-purpose programs by su...
Trace-level speculative multithreaded processors exploit trace-level speculation by means of two thr...
Speculation can enhance adders performance by making carry predictions. It consists in replacing the...
Arithmetic logic units and digital signal processors widely uses adders. It is the most complicated ...
Approximate circuit design is a promising approach to improve performances and energy efficiency bey...
A large number of adder designs are available based on the constraints of a particular application, ...
Variable latency adders have been recently proposed in literature. A variable latency adder employs ...
As key building blocks for digital signal processing, image processing and deep learning etc, adders...
This paper presents a novel microarchitecture to exploit trace-level speculation by means of two thr...
Speculative execution, such as control speculation or data speculation, is an effective way to impro...
Current techniques for characterizing the power consumption of adders rely on as-suming that the inp...
Given a set of data objects, correlation computing refers to the problem of efficiently finding grou...
This paper presents a delay- and energy-efficient approximate adder design exploiting an effective c...
This paper focuses on the problem of how to find and effectively exploit speculative thread-level pa...
This paper focuses on the problem of how to find and effectively exploit speculative thread-level pa...
Thread-Level Speculation (TLS) allows us to automatically parallelize general-purpose programs by su...
Trace-level speculative multithreaded processors exploit trace-level speculation by means of two thr...
Speculation can enhance adders performance by making carry predictions. It consists in replacing the...
Arithmetic logic units and digital signal processors widely uses adders. It is the most complicated ...
Approximate circuit design is a promising approach to improve performances and energy efficiency bey...
A large number of adder designs are available based on the constraints of a particular application, ...
Variable latency adders have been recently proposed in literature. A variable latency adder employs ...
As key building blocks for digital signal processing, image processing and deep learning etc, adders...
This paper presents a novel microarchitecture to exploit trace-level speculation by means of two thr...
Speculative execution, such as control speculation or data speculation, is an effective way to impro...
Current techniques for characterizing the power consumption of adders rely on as-suming that the inp...
Given a set of data objects, correlation computing refers to the problem of efficiently finding grou...
This paper presents a delay- and energy-efficient approximate adder design exploiting an effective c...
This paper focuses on the problem of how to find and effectively exploit speculative thread-level pa...
This paper focuses on the problem of how to find and effectively exploit speculative thread-level pa...
Thread-Level Speculation (TLS) allows us to automatically parallelize general-purpose programs by su...
Trace-level speculative multithreaded processors exploit trace-level speculation by means of two thr...