Related Experiment Video
Updated: Sep 14, 2025

10:24
Generation of Heterogeneous Drug Gradients Across Cancer Populations on a Microfluidic Evolution Accelerator for Real-Time Observation
Published on: September 19, 2019
6.5K
HCG: Streaming DCNN Accelerator With a Hybrid Computational Granularity Scheme on FPGA
Summary
This study introduces a hybrid computational granularity (HCG) scheme for streaming DCNN accelerators on FPGAs. HCG optimizes memory-bandwidth tradeoffs and FPGA resource use, enhancing throughput for deep learning tasks.
Area of Science:
- Computer Engineering
- Hardware Acceleration
- Deep Learning
Background:
- Streaming Deep Convolutional Neural Network (DCNN) accelerators on FPGAs utilize interconvolutional-layer parallelism to boost throughput.
- Existing accelerators often use uniform tiling methods, impacting the memory-bandwidth tradeoff and FPGA resource utilization.
- Computational granularity, the size of output feature maps computed per tiled input feature map, is a key factor influencing performance.
Purpose of the Study:
- To introduce a novel Hybrid Computational Granularity (HCG) scheme for streaming DCNN accelerators.
- To analyze the impact of HCG on system pipelines, aiming to eliminate pipeline bubbles and simplify design.
- To develop a hardware overhead model and heuristic algorithm for optimizing HCG and achieving better memory-bandwidth tradeoffs and throughput.
Main Methods:
- Developed a Hybrid Computational Granularity (HCG) scheme for independently optimized computational granularity per node.
- Theoretically analyzed the impact of computational granularity on system pipelines and control logic.
- Created a hardware overhead model and heuristic algorithm for optimizing granularity.
- Implemented and validated accelerators on an Alveo U250 board under various bandwidth constraints.
Main Results:
- The HCG scheme enables a more flexible memory-bandwidth tradeoff and effective FPGA resource utilization.
- The proposed methodology successfully established seamless system pipelines without bubbles, simplifying design.
- Implemented accelerators achieved high throughputs (e.g., 3-TOPS ResNet-18) surpassing existing works under specific bandwidth constraints.
- Demonstrated accelerators for various DCNN models including VGG-16, ResNet-34/50, MobileNetV1, ConvNeXt-T, and ResNeXt-50.
Conclusions:
- The HCG scheme is an effective approach for optimizing streaming DCNN accelerators on FPGAs.
- The developed optimization methodology achieves superior memory-bandwidth tradeoffs and higher throughput.
- The proposed design and validation methodology demonstrate significant advancements in FPGA-based deep learning acceleration.
Related Concept Videos
Fast Decoupled and DC Powerflow
292
The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:
292
Parallel Processing
229
The brain processes sensory information rapidly due to parallel processing, which involves sending data across multiple neural pathways at the same time. This method allows the brain to manage various sensory qualities, such as shapes, colors, movements, and locations, all concurrently. For instance, when observing a forest landscape, the brain simultaneously processes the movement of leaves, the shapes of trees, the depth between them, and the various shades of green. This enables a quick and...
229
Downsampling
256
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
256
Uniform Depth Channel Flow: Problem Solving
126
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
126
Rapidly Varying Flow
140
Rapidly varying flow (RVF) in open channels is characterized by abrupt changes in flow depth over a short distance, with the rate of depth change relative to distance often approaching unity. These flows are inherently complex due to their transient and multi-dimensional nature, making exact analysis difficult. However, approximate solutions using simplified models provide valuable insights into their behavior.Key Features of Rapidly Varying FlowRVF is commonly observed in scenarios involving...
140
Upsampling
314
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
314

