MixFX-SCORE: Heterogeneous Fixed-Point Compilation of Dataflow Computations

Mixed-precision implementation of computation can deliver area, throughput and power improvements for dataflow computations over homogeneous fixed-precision circuits without any loss in accuracy. When designing circuits for reconfigurable hardware, we can exercise independent control over bitwidth selection of each variable in the computation. However, selecting the best precision for each variable is an NP-hard problem. While traditional solutions use automated heuristics like simulated annealing or integer linear programming, they still rely on the manual formulation of resource models, which can be tedious, and potentially inaccurate due to the unpredictable interactions between different stages of the FPGA CAD flow. We develop MixFX-SCORE, an automated tool-flow based on FX-SCORE fixed-point compilation framework and simulated annealing, to address this challenge. We outsource error analysis (Gappa++) and resource model generation (Vivado HLS, Logic Synthesis, Xilinx Place-and-Route) to external tools that offer a more accurate representation of error behavior (backed by proofs) and resource usage (based on actual utilization). We demonstrate 1.1 -- 3.5x LUTs count savings, 1 -- 1.8x DSP count reductions, and 1 -- 3.9x dynamic power improvements while still satisfying the accuracy constraints when compared to homogeneous fixed-point implementations.

[1]  Pierre Sens,et al.  Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables , 2009, SSS.

[2]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[3]  Nachiket Kapre Exploiting Input Parameter Uncertainty for Reducing Datapath Precision of SPICE Device Models , 2013, 2013 IEEE 21st Annual International Symposium on Field-Programmable Custom Computing Machines.

[4]  Nachiket Kapre,et al.  FX-SCORE: A Framework for Fixed-Point Compilation of SPICE Device Models Using Gappa++ , 2012, 2012 IEEE 20th International Symposium on Field-Programmable Custom Computing Machines.

[5]  Wayne Luk,et al.  Ieee Transactions on Computer-aided Design of Integrated Circuits and Systems Accuracy Guaranteed Bit-width Optimization Abstract— We Present Minibit, an Automated Static Approach for Optimizing Bit-widths of Fixed-point Feedforward Designs with Guaranteed Accuracy. Methods to Minimize Both the In- , 2022 .

[6]  Gerhard J. Woeginger,et al.  The complexity of multiple wordlength assignment , 2002, Appl. Math. Lett..

[7]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[8]  Kam-Wing Ng,et al.  Analytical Study on Improving DHT Lookup Performance under Churn , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[9]  L. Ingber Very fast simulated re-annealing , 1989 .

[10]  Richard M. Karp,et al.  Load balancing in dynamic structured P2P systems , 2004, IEEE INFOCOM 2004.

[11]  Guillaume Melquiond,et al.  Combining Coq and Gappa for Certifying Floating-Point Programs , 2009, Calculemus/MKM.

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[13]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[14]  João Leitão,et al.  Rollerchain: A DHT for Efficient Replication , 2013, 2013 IEEE 12th International Symposium on Network Computing and Applications.

[15]  Andreas Wombacher,et al.  Enabling High Data Availability in a DHT , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[16]  Ivan Beschastnikh,et al.  Scalable consistency in Scatter , 2011, SOSP.

[17]  Teresa H. Y. Meng,et al.  Towards program optimization through automated analysis of numerical precision , 2010, CGO '10.

[18]  Valerio Schiavoni,et al.  Exploiting Node Connection Regularity for DHT Replication , 2011, 2011 IEEE 30th International Symposium on Reliable Distributed Systems.

[19]  Seif Haridi,et al.  Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.

[20]  Brian D. Noble,et al.  Exploiting Availability Prediction in Distributed Systems , 2006, NSDI.

[21]  Wayne Luk,et al.  Automatic Accuracy-Guaranteed Bit-Width Optimization for Fixed and Floating-Point Systems , 2007, 2007 International Conference on Field Programmable Logic and Applications.

[22]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[23]  J. M. Pierre Langlois,et al.  Enhanced Precision Analysis for Accuracy-Aware Bit-Width Optimization Using Affine Arithmetic , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[24]  Erwan Le Merrer,et al.  Finding Good Partners in Availability-Aware P2P Networks , 2009, SSS.