Pasar al contenido principal

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Hybrid MPI+OpenMP Solution of the Distributed Cluster-based Fish Schooling Simulator

  • Borges, Francisco|||0000-0003-4951-0522
  • Gutiérrez Millà, Albert|||0000-0002-6242-9414
  • Suppi, Remo|||0000-0002-0373-8292
  • Luque, Emilio|||0000-0002-2884-3232
Exploring the multi-core architecture is an important issue to obtaining high performance in parallel and distributed discrete-event simulations. However, the simulation features must fit on parallel programming model in order to increase the performance. In this paper we show our experience developing a hybrid MPI+OpenMP version of our parallel and distributed discrete- event individual-oriented fish schooling simulator. In the hybrid approach developed, we fit our simulation features in the following manner: the communication between the Logical Processes happens via message passing whereas the computing of the individuals by OpenMP threads. In addition, we propose a new data structure for partitioning the fish clusters which avoid the critical section in OpenMP code. As a result, the hybrid version significantly improves the total execution time for huge quantity of individuals, because it decreases both the communication and management of processes overhead, whereas it increases the utilization of cores with sharing of resources.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Individual-oriented Model Crowd Evacuations Distributed Simulation

  • Gutiérrez Millà, Albert|||0000-0002-6242-9414
  • Borges, Francisco|||0000-0003-4951-0522
  • Suppi, Remo|||0000-0002-0373-8292
  • Luque, Emilio|||0000-0002-2884-3232
Emergency plan preparation is an important problem in building design to evacuate people as fast as possible. Simulation exercises as fire drills are not a realistic situation to understand people behaviour. In the case of crowd evacuations the complexity and uncertainty of the systems increases. Computer simulation allows us to run crowd dynamics models and extract information from emergency situations. Several models solve the emergency evacuation problem. Individual oriented modelling allows to give behaviour rules to the individual and simulate interactions between them. Due to variation on the emergency situations results have to be statistically reliable. This reliability increases the computing demand. Distributed and parallel paradigms solve the performance problem. In the present work we present a crowd evacuations distributed simulator. We implemented two versions of the model. One using Netlogo and another using C with MPI. We chose a real environment to test the simulator: pavilion 2 of Fira de Barcelona building, able to hold thousands of persons. The distributed simulator was tested with 62,820 runs in a distributed environment with 15,000 individuals. In this work we show how the distributed simulator has a linear speedup and scales efficiently.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Optimal Run Length for Discrete-event Distributed Cluster-based Simulations

  • Borges, Francisco|||0000-0003-4951-0522
  • Gutiérrez Millà, Albert|||0000-0002-6242-9414
  • Suppi, Remo|||0000-0002-0373-8292
  • Luque, Emilio|||0000-0002-2884-3232
In scientific simulations the results generated usually come from a stochastic process. New solutions with the aim of improving these simulations have been proposed, but the problem is how to compare these solutions since the results are not deterministic. Consequently how to guarantee that the output results are statistically trusted. In this work we apply a statistical approach in order to define the transient and steady state in discrete event distributed simulation. We used linear regression and batch method to find the optimal simulation size. As contributions of our work we can enumerate: we have applied and adapted the simple statistical approach in order to define the optimal simulation length; we propose the approximate approach to normal distribution instead of generate replications sufficiently large; and the method can be used in other kind of non-terminating science simulations where the data either have a normal distribution or can be approximated by a normal distribution.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Predicting robustness against transient faults of MPI based programs

  • Dias Lima Gramacho, João Artur
  • Wong, Álvaro|||0000-0002-8394-9478
  • Rexachs, Dolores|||0000-0001-5500-850X
  • Luque, Emilio|||0000-0002-2884-3232
The evaluation of a program's behaviour in the presence of transient faults is often a very time consuming work. In order to achieve significant data, thousands of executions are required and each execution will have the significant overhead of the fault injection environment. A previously published methodology reduced significantly the time needed to evaluate the robustness of a program execution by exhaustively analysing its execution trace instead of using fault injection. In this paper we present a further improvement in the evaluation time of parallel programs robustness against transient faults by combining this methodology with PAS2P - a method that strives to describe an application based on its message-passing activity. This combination allowed us to predict the robustness of larger parallel programs, reducing in some cases by more than 20 times the time needed to calculate the robustness while obtaining a robustness prediction error of less than 4%.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Applying probability theory for the quality assessment of a wildfire spread prediction framework based on genetic algorithms

  • Cencerrado Barraqué, Andrés|||0000-0002-9143-3279
  • Cortés Fité, Ana|||0000-0003-1697-1293
  • Margalef, Tomàs|||0000-0001-6384-7389
This work presents a framework for assessing how the existing constraints at the time of attending an ongoing forest fire affect simulation results, both in terms of quality (accuracy) obtained and the time needed to make a decision. In the wildfire spread simulation and prediction area, it is essential to properly exploit the computational power offered by new computing advances. For this purpose, we rely on a two-stage prediction process to enhance the quality of traditional predictions, taking advantage of parallel computing. This strategy is based on an adjustment stage which is carried out by a well-known evolutionary technique: Genetic Algorithms. The core of this framework is evaluated according to the probability theory principles. Thus, a strong statistical study is presented and oriented towards the characterization of such an adjustment technique in order to help the operation managers deal with the two aspects previously mentioned: time and quality. The experimental work in this paper is based on a region in Spain which is one of the most prone to forest fires: El Cap de Creus.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Dynamic tuning of the workload partition factor and the resource utilization in data-intensive applications

  • Rosas Mendoza, Claudia Andreina
  • Sikora, Anna|||0000-0003-0090-4109
  • Jorba i Esteve, Josep|||0000-0002-5810-4748
  • Moreno, Andreu
  • Espinosa, Antonio|||0000-0002-6460-3789
  • César Galobardes, Eduardo|||0000-0002-9729-8557
The recent data deluge needing to be processed represents one of the major challenges in the computational field. This fact led to the growth of specially-designed applications known as data-intensive applications. In general, in order to ease the parallel execution of data-intensive applications input data is divided into smaller data chunks that can be processed separately. However, in many cases, these applications show severe performance problems mainly due to the load imbalance, inefficient use of available resources, and improper data partition policies. In addition, the impact of these performance problems can depend on the dynamic behavior of the application. This work proposes a methodology to dynamically improve the performance of data-intensive applications based on: (i) adapting the size and the number of data partitions to reduce the overall execution time; and (ii) adapting the number of processing nodes to achieve an efficient execution. We propose to monitor the application behavior for each exploration (query) and use gathered data to dynamically tune the performance of the application. The methodology assumes that a single execution includes multiple related queries on the same partitioned workload. The adaptation of the workload partition factor is addressed through the definition of the initial size for the data chunks; the modification of the scheduling policy to send first data chunks with large processing times; dividing of the data chunks with the biggest associated computation times; and joining of data chunks with small computation times. The criteria for dividing or gathering chunks are based on the chunks' associated execution time (average and standard deviation) and the number of processing elements being used. Additionally, the resources utilization is addressed through the dynamic evaluation of the application performance and the estimation and modification of the number of processing nodes that can be efficiently used. We have evaluated our strategy using as cases of study a real and a synthetic data-intensive application. Analytical expressions have been analyzed through simulation. Applying our methodology, we have obtained encouraging results reducing total execution times and efficient use of resources.