Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/133773
COMPARTIR / EXPORTAR:
SHARE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Título: | Optimizing Performance for Coalition Structure Generation Problems' IDP Algorithm |
Autor: | Cruz-Mencia, Francisco CSIC ; Cerquides, Jesús CSIC ORCID ; Espinosa, Antonio; Moure, Juan C.; Rodríguez-Aguilar, Juan Antonio CSIC ORCID CVN | Fecha de publicación: | 22-jul-2013 | Citación: | Parallel and Distributed Processing Techniques and Applications: The 2013 WorldComp International Conference Proceedings | Resumen: | The Coalition Structure Generation (CSG) problem is well-known in the area of Multi-Agent Systems. Its goal is establishing coalitions between agents while maximizing the global welfare. Between the existing different algorithms designed to solve the CSG problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the performance of the DP and IDP algorithms, we identify which is the most frequent operation and propose an optimized method. Then, we analyze the memory access pattern and find that its irregular behavior represents a potential performance bottleneck. In addition, we study and implement a method for dividing the work in different threads. We show that selecting the best algorithmic options can improve performance by 10x or more. Furthermore, the execution in a dual-socket, six-core processor computer may increase performance by an additional 5x-6x. | URI: | http://hdl.handle.net/10261/133773 | Identificadores: | isbn: 9781601322586 |
Aparece en las colecciones: | (IIIA) Comunicaciones congresos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
PDPTA2013_Optim..pdf | 840,97 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
Page view(s)
196
checked on 30-mar-2024
Download(s)
114
checked on 30-mar-2024
Google ScholarTM
Check
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.