Parallel Batch-Dynamic Graph Connectivity

In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. The most well known sequential algorithm for dynamic connectivity is the elegant level-set algorithm of Holm, de Lichtenberg and Thorup (HDT), which achieves $O(\log^2 n)$ amortized time per edge insertion or deletion, and $O(\log n / \log\log n)$ time per query. We design a parallel batch-dynamic connectivity algorithm that is work-efficient with respect to the HDT algorithm for small batch sizes, and is asymptotically faster when the average batch size is sufficiently large. Given a sequence of batched updates, where $\Delta$ is the average batch size of all deletions, our algorithm achieves $O(\log n \log(1 + n / \Delta))$ expected amortized work per edge insertion and deletion and $O(\log^3 n)$ depth w.h.p. Our algorithm answers a batch of $k$ connectivity queries in $O(k \log(1 + n/k))$ expected work and $O(\log n)$ depth w.h.p. To the best of our knowledge, our algorithm is the first parallel batch-dynamic algorithm for connectivity.Comment: This is the full version of the paper appearing in the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 201

Simulations of collision times in gravity driven granular flow

We use simulations to investigate collision time distributions as one approaches the static limit of steady-state flow of dry granular matter. The collision times fall in a power-law distribution with an exponent dictated by whether the grains are ordered or disordered. Remarkably, the exponents have almost no dependence on dimension. We are also able to resolve a disagreement between simulation and experiments on the exponent of the collision time power-law distribution.Comment: 7 pages, 5 figure

Collision of Polymers in a Vacuum

In a number of experimental situations, single polymer molecules can be suspended in a vacuum. Here collisions between such molecules are considered. The limit of high collision velocity is investigated numerically for a variety of conditions. The distribution of contact times, scattering angles, and final velocities are analyzed. In this limit, self avoiding chains are found to become highly stretched as they collide with each other, and have a distribution of scattering times that depends on the scattering angle. The velocity of the molecules after the collisions is similar to predictions of a model assuming thermal equilibration of molecules during the collision. The most important difference is a significant subset of molecules that inelastically scatter but do not substantially change direction.Comment: 7 pages, 6 figure

A Model for Phase Transition based on Statistical Disassembly of Nuclei at Intermediate Energies

Consider a model of particles (nucleons) which has a two-body interaction which leads to bound composites with saturation properties. These properties are : all composites have the same density and the ground state energies of composites with k nucleons are given by -kW+\sigma k^{2/3} where W and \sigma are positive constants. W represents a volume term and \sigma a surface tension term. These values are taken from nuclear physics. We show that in the large N limit where N is the number of particles such an assembly in a large enclosure at finite temperature shows properties of liquid-gas phase transition. We do not use the two-body interaction but the gross properties of the composites only. We show that (a) the p-\rho isotherms show a region where pressure does not change as $\rho$ changes just as in Maxwell construction of a Van der Waals gas, (b) in this region the chemical potential does not change and (c) the model obeys the celebrated Clausius-Clapeyron relations. A scaling law for the yields of composites emerges. For a finite number of particles N (upto some thousands) the problem can be easily solved on a computer. This allows us to study finite particle number effects which modify phase transition effects. The model is calculationally simple. Monte-Carlo simulations are not needed.Comment: RevTex file, 21 pages, 5 figure

BLITZEN: A highly integrated massively parallel machine

The architecture and VLSI design of a new massively parallel processing array chip are described. The BLITZEN processing element array chip, which contains 1.1 million transistors, serves as the basis for a highly integrated, miniaturized, high-performance, massively parallel machine that is currently under development. Each processing element has 1K bits of static RAM and performs bit-serial processing with functional elements for arithmetic, logic, and shifting

An evaluation of two distributed deployment algorithms for Mobile Wireless Sensor Networks

Deployment is important in large wireless sensor networks (WSN), specially because nodes may fall due to failure or battery issues. Mobile WSN cope with deployment and reconfiguration at the same time: nodes may move autonomously: i) to achieve a good area coverage; and ii) to distribute as homogeneously as possible. Optimal distribution is computationally expensive and implies high tra c load, so local, distributed approaches may be preferable. This paper presents an experimental evaluation of role-based and behavior based ones. Results show that the later are better, specially for a large number of nodes in areas with obstacles.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

On black hole thermalization, D0 brane dynamics, and emergent spacetime

When matter falls past the horizon of a large black hole, the expectation from string theory is that the configuration thermalizes and the information in the probe is rather quickly scrambled away. The traditional view of a classical unique spacetime near a black hole horizon conflicts with this picture. The question then arises as to what spacetime does the probe actually see as it crosses a horizon, and how does the background geometry imprint its signature onto the thermal properties of the probe. In this work, we explore these questions through an extensive series of numerical simulations of D0 branes. We determine that the D0 branes quickly settle into an incompressible symmetric state -- thermalized within a few oscillations through a process driven entirely by internal non-linear dynamics. Surprisingly, thermal background fluctuations play no role in this mechanism. Signatures of the background fields in this thermal state arise either through fluxes, i.e. black hole hair; or if the probe expands to the size of the horizon -- which we see evidence of. We determine simple scaling relations for the D0 branes' equilibrium size, time to thermalize, lifetime, and temperature in terms of their number, initial energy, and the background fields. Our results are consistent with the conjecture that black holes are the fastest scramblers as seen by Matrix theory.Comment: 43 pages, 12 figures; v2: added analysis showing that results are consistent with and confirm Susskind conjecture on black hole thermalization. Added clarification about strong coupling regime. Citation adde

Cross-Dimensional relaxation in Bose-Fermi mixtures

We consider the equilibration rate for fermions in Bose-Fermi mixtures undergoing cross-dimensional rethermalization. Classical Monte Carlo simulations of the relaxation process are performed over a wide range of parameters, focusing on the effects of the mass difference between species and the degree of initial departure from equilibrium. A simple analysis based on Enskog's equation is developed and shown to be accurate over a variety of different parameter regimes. This allows predictions for mixtures of commonly used alkali atoms.Comment: 7 pages, 4 figures, uses Revtex 4. This is a companion paper to [PRA 70, 021601(R) (2004)] (cond-mat/0405419