Results 1 
9 of
9
Billiards and Related Systems on the BulkSynchronous Parallel Model
, 1997
"... With two examples we show the suitability of the bulksynchronous parallel (BSP) model for discreteevent simulation of homogeneous largescale systems. This model provides a unifying approach for general purpose parallel computing which in addition to efficient and scalable computation, ensures port ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
With two examples we show the suitability of the bulksynchronous parallel (BSP) model for discreteevent simulation of homogeneous largescale systems. This model provides a unifying approach for general purpose parallel computing which in addition to efficient and scalable computation, ensures portability across different parallel architectures. A valuable feature of this approach is a simple cost model that enables precise performance prediction of BSP algorithms. We show both theoretically and empirically that systems with uniform event occurrence among their components, such as colliding hardspheres and isingspin models, can be efficiently simulated in practice on current parallel computers supporting the BSP model. 1 Introduction Parallel discreteevent simulation of billiards and related systems is considered a nonobvious algorithmic problem, and has deserved attention in the literature [1, 5, 7, 8, 9, 11, 13, 18, 24, 23, 25]. Currently an important class of applications for...
DiscreteEvent Simulation on the BulkSynchronous Parallel Model
, 1998
"... The bulksynchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be efficiently supported by the B ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The bulksynchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be efficiently supported by the BSP model in practice. In this
On the Pending Event Set and Binary Tournaments
"... this paper we study the performance of the very first tournament based complete binary tree. We focus on discreteevent simulation and our results show that this unknown predecessor of heaps can be a more efficient alternative to the fastest pending event set implementations reported in the literatu ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
this paper we study the performance of the very first tournament based complete binary tree. We focus on discreteevent simulation and our results show that this unknown predecessor of heaps can be a more efficient alternative to the fastest pending event set implementations reported in the literature. We also extend the idea of binary tournaments to a (2; L)tournament structure which exhibits the property of delaying the processing of events with larger timestamps whilst it keeps similar theoretical performance bounds to the native (2; 1)structure or CBT. This property can be certainly useful in systems where many pending events are expected to be deleted or rescheduled during the simulation. 2 Tournament trees
Jammed packings of hard particles
, 2006
"... This dissertation describes an investigation of jammed packings of frictionless hard particles, including the computer generation of (nearly) jammed packings, the development of mathematical criteria and algorithms to verify jamming, and computational and experimental studies of disordered and orde ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This dissertation describes an investigation of jammed packings of frictionless hard particles, including the computer generation of (nearly) jammed packings, the development of mathematical criteria and algorithms to verify jamming, and computational and experimental studies of disordered and ordered hardsphere and hardellipsoid packings. In the first part of this dissertation a mathematical framework for understanding jamming in packings of hard particles is developed. Algorithms to model hardparticle systems, and in particular, a collisiondriven molecular dynamics algorithm for the simulation of dense packings of hard spheres, ellipsoids and superellipsoids, are designed. This algorithm is used to implement a generalization of the LubachevskyStillinger algorithm to generate disordered packings of hard spheres and hard ellipsoids. It is found that the density and average contact number of the random packings rises sharply, but continuously, as asphericity is introduced, leading to hypostatic packings much denser than wellknown random sphere packings. A mathematical theory of jamming for packings of spherical and nonspherical particles, as well as algorithms to test whether a packing is (nearly) jammed are developed, verifying that our
ACCELERATED SIMULATION OF A HEAVY PARTICLE IN A GAS OF ELASTIC SPHERES
"... Abstract. A new, accelerated algorithm for a system of elastic hardspheres in which one of the particles (a colloid) is significantly heavier than the others is presented. The algorithm follows the framework of the stochastic heterogeneous multiscale method. It is shown that, in the limit in which ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. A new, accelerated algorithm for a system of elastic hardspheres in which one of the particles (a colloid) is significantly heavier than the others is presented. The algorithm follows the framework of the stochastic heterogeneous multiscale method. It is shown that, in the limit in which the ratio between the light and the heavy particles approaches zero, the dynamics of the colloid is given by a stochastic differential equation. The coefficients of the equation are calculated on the fly using a shorttime event driven simulation. The trajectory of the colloid is simulated using Brownian dynamics with the parameters obtained in the micro, event driven one. The efficiency of the simulation is independent of the mass ratio. A few numerical examples, which serve as a proof of principle, are presented. The examples demonstrate that our results are consistent with analytical predictions in the ideal gas limit. A result of a simulation with a dense gas is also presented.
SEVENTEENTH SYMPOSIUM ON ENERGY ENGINEERING SCIENCES
, 1999
"... seven technical sessions, which included 25 individual presentations followed by discussion and interaction with the audience. A list of participants is appended to this volume. The DOE Office of Basic Energy Sciences (BES), of which Engineering Research is a component program, is responsible for th ..."
Abstract
 Add to MetaCart
seven technical sessions, which included 25 individual presentations followed by discussion and interaction with the audience. A list of participants is appended to this volume. The DOE Office of Basic Energy Sciences (BES), of which Engineering Research is a component program, is responsible for the longterm, missionoriented research in the Department. The Office has prime responsibility for establishing the basic scientific foundation upon which the Nation’s future energy options will be identified, developed, and built. BES is committed to the generation of new knowledge necessary to solve present and future problems regarding energy exploration, production, conversion, and utilization, while maintaining respect for the environment. Consistent with DOE/BES mission, the Engineering Research Program is charged with the identification, initiation, and management of fundamental research on broad, generic topics addressing energyrelated engineering problems. Its stated goals are to improve and extend the body of knowledge underlying current engineering practice so as to create new options for enhancing energy savings and production, prolonging the useful life of
unknown title
, 2004
"... www.elsevier.com/locate/jcp Neighbor list collisiondriven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details ..."
Abstract
 Add to MetaCart
(Show Context)
www.elsevier.com/locate/jcp Neighbor list collisiondriven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details
Analysis of an Efficient Algorithm for the HardShere Problem
, 1996
"... ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, N ..."
Abstract
 Add to MetaCart
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, NY 10036 USA, fax +1 (212) 8690481, or permissions@acm.org Analysis of an Efficient Algorithm for the HardSphere Problem Alan T. Krantz Department of Computer Science, University of Colorado, Boulder, Colorado Many similar algorithms for performing simulations of hardsphere systems have been presented. Among these algorithms are the algorithms designed by Rapaport (RAP), Lubachevsky (LUB), Krantz (HAD), and Marin (HYBRID). These algorithms exhibit a similar design in that they each use an O(logn) event queue which becomes the overwhelming bottleneck when simulating large systems. In this paper the design of HAD is presented and contrasted to RAP, LUB and HYBRID. Next, both an empirical...