Show simple item record

dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.authorHernàndez, Lluis
dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2018-03-15T13:33:27Z
dc.date.available2018-03-15T13:33:27Z
dc.date.issued2001
dc.identifier.citationBlesa, M., Hernàndez, L., Xhafa, F. Parallel skeletons for Tabu search method. A: IEEE International Conference on Parallel and Distributed Systems. "Eighth International Conference on Parallel and Distributed Systems, ICPADS 2001: KyongJu City, Korea, 26-29 June 2001: proceedings". Institute of Electrical and Electronics Engineers (IEEE), 2001, p. 23-28.
dc.identifier.isbn0-7695-1-153-8
dc.identifier.urihttp://hdl.handle.net/2117/115214
dc.description.abstractWe present two generic parallel skeletons for the tabu search method-a well known meta-heuristic for approximately solving combinatorial optimization problems. The first skeleton is based on independent runs while the second in the classical master-slave model. Our starting point is the design and implementation of a sequential skeleton that is used later as basis for the two parallel skeletons. Both skeletons provide the user with the following: a permit to obtain parallel implementations of the tabu search method for concrete combinatorial optimization problems from existing sequential implementations; there is no need for the user to know either parallel programming or communication libraries; and the parallel implementation of tabu search for a concrete problem is obtained automatically from a sequential implementation of tabu search for the problem. The skeletons, however, require from the user a sequential instantiation of the tabu search method for the problem at hand. The skeletons are implemented in C++ using MPI as the communication library and offer genericity, flexibility, component reuse, robustness and time savings. We have instantiated the two skeletons for the 0-1 multidimensional knapsack problem, among others, for which we report computational results.
dc.format.extent6 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.lcshMathematical optimization
dc.subject.lcshParallel algorithms
dc.subject.lcshParallel processing (Electronic computers)
dc.subject.otherMessage passing
dc.subject.otherSearch problems
dc.subject.otherOptimisation
dc.subject.otherC++ language
dc.subject.otherSoftware libraries
dc.titleParallel skeletons for Tabu search method
dc.typeConference lecture
dc.subject.lemacOptimització matemàtica
dc.subject.lemacAlgorismes paral·lels
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1109/ICPADS.2001.934797
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/934797/
dc.rights.accessOpen Access
local.identifier.drac2406087
dc.description.versionPostprint (published version)
local.citation.authorBlesa, M.; Hernàndez, L.; Xhafa, F.
local.citation.contributorIEEE International Conference on Parallel and Distributed Systems
local.citation.publicationNameEighth International Conference on Parallel and Distributed Systems, ICPADS 2001: KyongJu City, Korea, 26-29 June 2001: proceedings
local.citation.startingPage23
local.citation.endingPage28


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder