Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Carlo Sicignano

dblp:174/8280 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 56% Hardware accelerators and domain-specific architectures · 28% High-performance computing · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA accelerator
0.212016
On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach · ACM Trans. Archit. Code Optim. 2016
Hardware accelerators and domain-specific architectures › scientific computing accelerator
stencil computation accelerator
0.212016
On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach · ACM Trans. Archit. Code Optim. 2016
Reconfigurable computing and FPGAs
streaming architecture
0.212016
On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach · ACM Trans. Archit. Code Optim. 2016
High-performance computing
scientific computing systems
0.112016
On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach · ACM Trans. Archit. Code Optim. 2016
High-performance computing
stencil computation
0.112016
On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach · ACM Trans. Archit. Code Optim. 2016

Methods — techniques the papers use, named apart from their topics

queuing · 0.2high-level synthesis · 0.2data buffering · 0.2
YearPublicationVenuePosition
2016 On How to Accelerate Iterative Stencil Loops: A Scalable Streaming-Based Approach
abstract
In high-performance systems, stencil computations play a crucial role as they appear in a variety of different fields of application, ranging from partial differential equation solving, to computer simulation of particles’ interaction, to image processing and computer vision. The computationally intensive nature of those algorithms created the need for solutions to efficiently implement them in order to save both execution time and energy. This, in combination with their regular structure, has justified their widespread study and the proposal of largely different approaches to their optimization. However, most of these works are focused on aggressive compile time optimization, cache locality optimization, and parallelism extraction for the multicore/multiprocessor domain, while fewer works are focused on the exploitation of custom architectures to further exploit the regular structure of Iterative Stencil Loops (ISLs), specifically with the goal of improving power efficiency. This work introduces a methodology to systematically design power-efficient hardware accelerators for the optimal execution of ISL algorithms on Field-programmable Gate Arrays (FPGAs). As part of the methodology, we introduce the notion of Streaming Stencil Time-step (SST), a streaming-based architecture capable of achieving both low resource usage and efficient data reuse thanks to an optimal data buffering strategy, and we introduce a technique called SSTs queuing that is capable of delivering a pseudolinear execution time speedup with constant bandwidth. The methodology has been validated on significant benchmarks on a Virtex-7 FPGA using the Xilinx Vivado suite. Results demonstrate how the efficient usage of the on-chip memory resources realized by an SST allows one to treat problem sizes whose implementation would otherwise not be possible via direct synthesis of the original, unmanipulated code via High-Level Synthesis (HLS). We also show how the SSTs queuing effectively ensures a pseudolinear throughput speedup while consuming constant off-chip bandwidth.
Riccardo Cattaneo, Giuseppe Natale, Carlo Sicignano, Donatella Sciuto, Marco D. Santambrogio
ACM Trans. Archit. Code Optim.3