作者: Renata M. Aiex , Simone de L. Martins , Celso C. Ribeiro , Noemi de la R. Rodriguez
DOI: 10.1007/BFB0018549
关键词: Thread (computing) 、 Algorithm 、 Adaptive algorithm 、 Tabu search 、 Computer science 、 Guided Local Search 、 Parallel algorithm 、 Parallel computing 、 Combinatorial optimization
摘要: In this work, we propose a cooperative multi-thread parallel tabu search heuristic for the circuit partitioning problem. This procedure is based on cooperation of multiple threads. Each thread implements different variant sequential algorithm, using combination initial solution algorithm and move attribute definition. These threads communicate by exchanging elite solutions. PVM Linda are used in implementation procedure. Numerical results reported set ISCAS benchmark circuits illustrate effectiveness Comparative illustrating efficiency implementations also assessed.