Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Parallel skeletons for tabu search method based on search strategies and neighborhood partition

Autor
Blesa, M.; Hernández, L.; Xhafa, F.
Tipus d'activitat
Document cientificotècnic
Data
2001-05
Codi
LSI-01-26-R
Repositori
http://hdl.handle.net/2117/97884 Obrir en finestra nova
Resum
In this paper we present two parallel skeletons for Tabu Search method -- a well known meta-heuristic for approximately solving combinatorial optimization problems. Our parallel skeletons are designed and implemented using the generic parallel programming paradigm. The first skeleton is based on independent runs model with search strategies while the second is a master-slave model with neighborhood partition. Our starting point to obtain these skeletons was the design and implementation of a seq...
Citació
Blesa, M., Hernàndez, L., Xhafa, F. "Parallel skeletons for tabu search method based on search strategies and neighborhood partition". 2001.
Paraules clau
Combinatorial optimization, Components, Generic programming, Parallel skeletons, Parallelism, Tabu Search
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius