Skip to content

Cooperative multi-thread parallel tabu search with an application to circuit partitioning

19Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, we propose a cooperative multi-thread parallel tabu search heuristic for the circuit partitioning problem. This procedure is based on the cooperation of multiple search threads. Each thread implements a different variant of a sequential tabu search algorithm, using a different combination of initial solution algorithm and move attribute definition. These threads communicate by exchanging elite solutions. PVM and Linda are used in the implementation of the parallel tabu search procedure. Numerical results reported for a set of ISCAS benchmark circuits illustrate the effectiveness of the parallel tabu search procedure. Comparative results illustrating the efficiency of the implementations in PVM and Linda are also assessed.

Cite

CITATION STYLE

APA

Aiex, R. M., Martins, S. D. L., Ribeiro, C. C., & Rodriguez, N. D. L. R. (1998). Cooperative multi-thread parallel tabu search with an application to circuit partitioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1457 LNCS, pp. 310–331). Springer Verlag. https://doi.org/10.1007/bfb0018549

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free