Towards Serial-Equivalent Parallel Routing for FPGAs: (Abstract Only)
Abstract
Index Terms
- Towards Serial-Equivalent Parallel Routing for FPGAs: (Abstract Only)
Recommendations
Towards serial-equivalent multi-core parallel routing for FPGAs
DATE '20: Proceedings of the 23rd Conference on Design, Automation and Test in EuropeIn this paper, we present a serial-equivalent parallel router for FPGAs on modern multi-core processors. We are based on the inherent net order of serial router to schedule all the nets into a series of stages, where the non-conflicting nets are ...
Parallel Quicksort Using Fetch-And-Add
A parallelization of the Quicksort algorithm that is suitable for execution on a shared memory multiprocessor with an efficient implementation of the fetch-and-add operation is presented. The partitioning phase of Quicksort, which has been considered a ...
Accelerate FPGA Routing with Parallel Recursive Partitioning
ICCAD '15: Proceedings of the IEEE/ACM International Conference on Computer-Aided DesignFPGA routing is a time-consuming step in the EDA design flow. In this paper we present a coarse-grained recursive partitioning approach to exploit parallelism. The basic idea is to partition the nets into three subsets, where the first subset and the ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Poster
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in