1. Accelerating datapath merging by task parallelisation on multicore systems.
- Author
-
Fazlali, Mahmood, Fallah, Mohammad K., Hosseinpour, Naemeh, and Katanforoush, Ali
- Subjects
- *
NP-hard problems , *MULTICORE processors , *BRANCH & bound algorithms - Abstract
Datapath merging is an efficient approach to reduce hardware resources and configuration time in the synthesis of digital systems. In order to solve datapath merging, we have to find the maximum weighted clique, which is an NP-hard problem. So, datapath merging is a time-consuming process. In this article, we use OpenMP library to perform divide and conquer task parallelism to find the maximum weighted clique. Therefore, considerable reduction in the synthesis time and almost linear speedup has been achieved. The experimental results obtained from running this algorithm on different benchmarks represent speedup ranging from 1.2 times to 6.5 times for an 8-core system. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF