Quasirandom Load Balancing

We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random algorithm by keeping the accumulated rounding errors as small as possible. Our new algorithm surprisingly closely approximates the idealized process (where the tokens are divisible) on important network topologies. On d-dimensional torus graphs with n nodes it deviates from the idealized process only by an additive constant. In contrast to that, the randomized rounding approach of Friedrich and Sauerwald (2009) can deviate up to Omega(polylog(n)) and the deterministic algorithm of Rabani, Sinclair and Wanka (1998) has a deviation of Omega(n^{1/d}). This makes our quasirandom algorithm the first known algorithm for this setting which is optimal both in time and achieved smoothness. We further show that also on the hypercube our algorithm has a smaller deviation from the idealized process than the previous algorithms.Comment: 25 page

Create a Simulator for Load Balancing in Grid Environment

No Abstrac

Simulation of reaction diffusion processes over biologically relevant size and time scales using multi-GPU workstations

AbstractSimulation of in vivo cellular processes with the reaction–diffusion master equation (RDME) is a computationally expensive task. Our previous software enabled simulation of inhomogeneous biochemical systems for small bacteria over long time scales using the MPD-RDME method on a single GPU. Simulations of larger eukaryotic systems exceed the on-board memory capacity of individual GPUs, and long time simulations of modest-sized cells such as yeast are impractical on a single GPU. We present a new multi-GPU parallel implementation of the MPD-RDME method based on a spatial decomposition approach that supports dynamic load balancing for workstations containing GPUs of varying performance and memory capacity. We take advantage of high-performance features of CUDA for peer-to-peer GPU memory transfers and evaluate the performance of our algorithms on state-of-the-art GPU devices. We present parallel efficiency and performance results for simulations using multiple GPUs as system size, particle counts, and number of reactions grow. We also demonstrate multi-GPU performance in simulations of the Min protein system in E. coli. Moreover, our multi-GPU decomposition and load balancing approach can be generalized to other lattice-based problems

Distributed agent-based traffic simulations

Modeling and simulation play an important role in transportation networks analysis. With the widespread of personalized real-time information sources, it is relevant for the simulation model to be individual-centered. The agent-based simulation is the most promising paradigm in this context. However, representing the movements of realistic numbers of travelers within reasonable execution times requires significant computational resources. It also requires relevant methods, architectures and algorithms that respect the characteristics of transportation networks. In this paper, we tackle the problem of using high-performance computing for agent-based traffic simulations. To do so, we define two generic agent-based simulation models, representing the existing sequential agent-based traffic simulations. The first model is macroscopic, in which travelers do not interact directly and use a fundamental diagram of traffic flow to continuously compute their speeds. The second model is microscopic, in which travelers interact with their neighbors to adapt their speeds to their surrounding environment. We define patterns to distribute these simulations in a high-performance environment. The first distributes agents equally between available computation units. The second pattern splits the environment over the different units. We finally propose a diffusive method to dynamically balance the load between units during execution. The results show that agent-based distribution is more efficient with macroscopic simulations, with a speedup of 6 compared to the sequential version, while environmentbased distribution is more efficient with microscopic simulations, with a speedup of 14. Our diffusive load-balancing algorithm improves further the performance of the environment based approach by 150%