2014
DOI: 10.1504/ijhpcn.2014.062725
|View full text |Cite
|
Sign up to set email alerts
|

Compiling irregular applications for reconfigurable systems

Abstract: Algorithms that exhibit irregular memory access patterns are known to show poor performance on multiprocessor architectures, particularly when memory access latency is variable. Many common data structures, including graphs, trees, and linked-lists, exhibit these irregular memory access patterns. While FPGA-based code accelerators have been successful on applications with regular memory access patterns, they have not been further explored for irregular memory access patterns. Multithreading has been shown to b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 19 publications
(19 reference statements)
0
8
0
Order By: Relevance
“…If for 1 million instructions, design bugs happen with the same proportion as that given in Figure 5 the results in Figure 6 are obtained. The performance of the proposed system can be further improved by following the technique specified in Halstead et al (2014) and Ouni and Mtibaa (2014) that deals with improving memory access for FPGA applications. Figure 6 can be extended to compare the existing degraded mode execution time and proposed recovery execution time for varying numbers of instructions as given in Figure 7.…”
Section: Time Overhead Calculationmentioning
confidence: 99%
“…If for 1 million instructions, design bugs happen with the same proportion as that given in Figure 5 the results in Figure 6 are obtained. The performance of the proposed system can be further improved by following the technique specified in Halstead et al (2014) and Ouni and Mtibaa (2014) that deals with improving memory access for FPGA applications. Figure 6 can be extended to compare the existing degraded mode execution time and proposed recovery execution time for varying numbers of instructions as given in Figure 7.…”
Section: Time Overhead Calculationmentioning
confidence: 99%
“…The Compiled Hardware Accelerated Threads (CHAT) tool is designed to assist developers with implementing irregular applications on FPGAs [HVN14]. CHAT is built using the ROCCC toolset.…”
Section: Compiled Hardware Accelerated Threads (Chat)mentioning
confidence: 99%
“…CHAT is built using the ROCCC toolset. MT-FPGA (Multithreading on FPGAs) [HVN14] is an execution model that combines the memory masking ability of multithreaded execution with a customized data path. However, while the focus of ROCCC is on generating highly optimized kernels for streaming applications, the focus of CHAT is on kernels for irregular applications (Fig.…”
Section: Compiled Hardware Accelerated Threads (Chat)mentioning
confidence: 99%
“…The CHAT [18], [19] compiler uses the same underlying tools as ROCCC for Hi-CIRRF and Lo-CIRRF compilation, but it targets irregular applications. Initially, it focused on irregular kernels with a deterministic number of threads, and each thread has a deterministic workload.…”
Section: A Hardware Compilers and Toolsmentioning
confidence: 99%