Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Teaching parallel programming in interdisciplinary studies

  • César Galobardes, Eduardo|||0000-0002-9729-8557
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Margalef, Tomàs|||0000-0001-6384-7389
  • Moure, Juan C.|||0000-0001-6697-0331
  • Sikora, Anna|||0000-0003-0090-4109
  • Suppi, Remo|||0000-0002-0373-8292
Nowadays many fields of science and engineering are evolving by the joint contribution of complementary fields. Computer science, and especially high performance computing, has become a key factor in the development of many research fields, establishing a new paradigm called computational science. Researchers and professionals from many different fields require a knowledge of high performance computing, including parallel programming, to develop a fruitful work in their particular field. So, at Universitat Autònoma of Barcelona, an interdisciplinary master on Modeling for science and engineering was started 5 years ago to provide a deep knowledge on the application of modeling and simulation to graduate students on different fields (Mathematics, Physics, Chemistry, Engineering, Geology, etc.). In this master, Parallel Programming appears as a compulsory subject, because it is a key topic for them. The concepts learnt in parallel programming must be applied to real applications. Therefore, a subject on Applied Modelling and Simulation has also been included. In this paper, the experience on teaching parallel programming in such interdisciplinary master is shown. © Springer International Publishing Switzerland 2015. Ministerio de Economía y Competitividad.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Coalition structure generation problems, optimization and parallelization of the IDP algorithm in multicore systems

  • Cruz Mencía, Francisco
  • Cerquides Bueno, Jesus|||0000-0002-3752-644X
  • Rodríguez-Aguilar, Juan A.
  • Espinosa, Antonio|||0000-0002-6460-3789
  • Moure, Juan C.|||0000-0001-6697-0331
  • Ramchurn, Sarvapali D.
  • Svensson, Kim
The coalition structure generation problem is well known in the area of multi-agent systems. Its goal is to establish coalitions between agents while maximizing the global welfare. Among the existing different algorithms designed to solve the coalition structure generation problem, DP and IDP are the ones with smaller temporal complexity. After analyzing the operation of the dynamic programming and improved dynamic programming algorithms, we have identified which are the most frequent operations and propose an optimized method. In addition, we study and implement a method for dividing the work into different threads. To describe incremental improvements of the algorithm design, we first compare performance of an improved single central processing unit core version where we obtain speedups ranging from 7 × to 11 × . Then, we describe the best resource use in a multi-thread optimized version where we obtain an additional 7.5 × speedup running in a 12-core machine.