Leveraging latency-insensitivity to ease multiple FPGA design
Traditionally, hardware designs partitioned across multiple FPGAs have had low performance due to the inefficiency of maintaining cycle-by-cycle timing among discrete FPGAs. In this paper, we present a mechanism by which complex designs may be efficiently and automatically partitioned among multiple...
Main Authors: | Fleming, Kermin Elliott, Pellauer, Michael, Arvind, Arvind, Emer, Joel S |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2019
|
Online Access: | https://hdl.handle.net/1721.1/121446 |
Similar Items
-
Scalable reconfigurable computing leveraging latency-insensitive channels
by: Fleming, Kermin Elliott, Jr
Published: (2013) -
Bounded Dataflow Networks and Latency-Insensitive Circuits
by: Vijayaraghavan, Muralidaran, et al.
Published: (2010) -
LEAP Scratchpads: Automatic Memory and Cache Management for Reconfigurable Logic [Extended Version]
by: Adler, Michael, et al.
Published: (2010) -
A Latency-Insensitive Design Approach to Programmable FPGA-Based Real-Time Simulators
by: Federico Montaño, et al.
Published: (2020-11-01) -
Scalable multi-access flash store for big data analytics
by: Jun, Sang-Woo, et al.
Published: (2019)