2015 Third International Symposium on Computing and Networking (CANDAR) 2015
DOI: 10.1109/candar.2015.35
|View full text |Cite
|
Sign up to set email alerts
|

An Approximate Computing Stack Based on Computation Reuse

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…Hara and Hanawa utilized field programming gate array (FPGA) flexibility to offload some tasks in an HPC application [7]. In addition, certain research works memorize the input/output of repeated computations and reuse them while allowing some accuracy degradation [11,12]. As a result, AC can be applied to various applications; however, we still need to consider the characteristics of each thread/rank in a parallel application.…”
Section: Related Workmentioning
confidence: 99%
“…Hara and Hanawa utilized field programming gate array (FPGA) flexibility to offload some tasks in an HPC application [7]. In addition, certain research works memorize the input/output of repeated computations and reuse them while allowing some accuracy degradation [11,12]. As a result, AC can be applied to various applications; however, we still need to consider the characteristics of each thread/rank in a parallel application.…”
Section: Related Workmentioning
confidence: 99%