It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Convolutional neural networks (CNNs) are used to solve a wide range of challenging computer vision problems. However, the power of CNNs comes at the cost of large amounts of computations. High-end FPGAs are loaded with compute resources and are widely deployed in data centers. As such, accelerating CNNs with FPGAs is a promising solution for meeting the computation demand of CNNs in data centers.
The main obstacle in using FPGAs as CNN accelerators is that FPGA programming requires hardware design knowledge that most CNN developers and users do not have. To solve this problem, we designed Argus, an FPGA-based CNN accelerator generator. Given the information of a CNN and FPGA board, Argus automatically generates a highly optimized accelerator design for running the CNN on the FPGA board, thus enabling users with no hardware design knowledge to effectively use FPGAs for CNN acceleration.
This dissertation presents four important components of Argus's design. The first one is the multi-CLP CNN accelerator paradigm, which spreads the layers of a CNN to multiple heterogeneous CNN layer processors (CLPs), with each CLP specialized for a subset of the CNN's layers. The resulting multi-CLP accelerator can achieve close to 100% dynamic utilization of arithmetic units. The second one is Escher, which is a CLP design with flexible data buffering to deal with CNN layers that are bottlenecked by weight transfers. Then there is Medusa, a resource-efficient and high-performance memory interconnect specialized to meet the data transfer requirements of multi-CLP accelerators. Last but not least, there is Cocktail, which is a scalable and extensible multi-CLP optimizer that enables the future extension of Argus to support more recent CNN variants and more varied CLP designs in a multi-CLP accelerator.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer