کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
455644 695526 2013 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
FPGA implementation of particle swarm optimization for Bayesian network learning
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
FPGA implementation of particle swarm optimization for Bayesian network learning
چکیده انگلیسی


• We present an FPGA-based implementation of Bayesian network (BN) learning using PSO.
• We study the intersection of reconfigurable computing, BN learning, and PSO.
• There is prior work in each area, but this the first to study the combination.
• We place CPT construction and fitness evaluation in separate clock domains.
• The FPGA design achieves 2.6 times the performance per slave of a software solution.

Using a Bayesian network (BN) learned from data can aid in diagnosing and predicting failures within a system while achieving other capabilities such as the monitoring of a system. However, learning a BN requires computationally intensive processes. This makes BN learning a candidate for acceleration using reconfigurable hardware such as field-programmable gate arrays (FPGAs). We present a FPGA-based implementation of BN learning using particle-swarm optimization (PSO). This design thus occupies the intersection of three areas: reconfigurable computing, BN learning, and PSO. There is significant prior work in each of these three areas. Indeed, there are examples of prior work in each pair among the three. However, the present work is the first to study the combination of all three. As a baseline, we use a prior software implementation of BN learning using PSO. We compare this to our FPGA-based implementation to study trade-offs in terms of performance and cost. Both designs use a master–slave topology and floating-point calculations for the fitness function. The performance of the FPGA-based version is limited not by the fitness function, but rather by the construction of conditional probability tables (CPTs). The CPT construction only requires integer calculations. We exploit this difference by separating these two functions into separate clock domains. The FPGA-based solution achieves about 2.6 times the number of fitness evaluations per second per slave compared to the software implementation.

Figure optionsDownload as PowerPoint slide

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Electrical Engineering - Volume 39, Issue 8, November 2013, Pages 2454–2468
نویسندگان
, , ,