Results 1  10
of
149
The PARSEC benchmark suite: Characterization and architectural implications
 IN PRINCETON UNIVERSITY
, 2008
"... This paper presents and characterizes the Princeton Application Repository for SharedMemory Computers (PARSEC), a benchmark suite for studies of ChipMultiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on highperformance computing applications and used a limited ..."
Abstract

Cited by 282 (2 self)
 Add to MetaCart
This paper presents and characterizes the Princeton Application Repository for SharedMemory Computers (PARSEC), a benchmark suite for studies of ChipMultiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on highperformance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications in recognition, mining and synthesis (RMS) as well as systems applications which mimic largescale multithreaded commercial programs. Our characterization shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and offchip traffic. The benchmark suite has been made available to the public.
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 188 (6 self)
 Add to MetaCart
Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently  those with shortrange forces where the neighbors of each atom change rapidly. They can be implemented on any distributedmemory parallel machine which allows for messagepassing of data between independently executing processors. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows that the current generation of parallel machines is competitive with conventi...
NAMD2: Greater Scalability for Parallel Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1998
"... Molecular dynamics programs simulate the behavior of biomolecular systems, leading to insights and understanding of their functions. However, the computational complexity of such simulations is enormous. Parallel machines provide the potential to meet this computational challenge. To harness this ..."
Abstract

Cited by 171 (32 self)
 Add to MetaCart
Molecular dynamics programs simulate the behavior of biomolecular systems, leading to insights and understanding of their functions. However, the computational complexity of such simulations is enormous. Parallel machines provide the potential to meet this computational challenge. To harness this potential, it is necessary to develop a scalable program. It is also necessary that the program be easily modified by applicationdomain programmers. The
Symplectic Numerical Integrators in Constrained Hamiltonian Systems
, 1994
"... : Recent work reported in the literature suggests that for the longtime integration of Hamiltonian dynamical systems one should use methods that preserve the symplectic (or canonical) structure of the flow. Here we investigate the symplecticness of numerical integrators for constrained dynamics, su ..."
Abstract

Cited by 47 (7 self)
 Add to MetaCart
: Recent work reported in the literature suggests that for the longtime integration of Hamiltonian dynamical systems one should use methods that preserve the symplectic (or canonical) structure of the flow. Here we investigate the symplecticness of numerical integrators for constrained dynamics, such as occur in molecular dynamics when bond lengths are made rigid in order to overcome stepsize limitations due to the highest frequencies. This leads to a constrained Hamiltonian system of smaller dimension. Previous work has shown that it is possible to have methods which are symplectic on the constraint manifold in phase space. Here it is shown that the very popular Verlet method with SHAKEtype constraints is equivalent to the same method with RATTLEtype constraints and that the latter is symplectic and time reversible. (This assumes that the iteration is carried to convergence.) We also demonstrate the global convergence of the Verlet scheme in the presence of SHAKEtype and RATTLE...
Geometric numerical integration illustrated by the StörmerVerlet method
, 2003
"... The subject of geometric numerical integration deals with numerical integrators that preserve geometric properties of the flow of a differential equation, and it explains how structure preservation leads to improved longtime behaviour. This article illustrates concepts and results of geometric nume ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
The subject of geometric numerical integration deals with numerical integrators that preserve geometric properties of the flow of a differential equation, and it explains how structure preservation leads to improved longtime behaviour. This article illustrates concepts and results of geometric numerical integration on the important example of the Störmer–Verlet method. It thus presents a crosssection of the recent monograph by the authors, enriched by some additional material. After an introduction to the Newton–Störmer–Verlet–leapfrog method and its various interpretations, there follows a discussion of geometric properties: reversibility, symplecticity, volume preservation, and conservation of first integrals. The extension to Hamiltonian systems on manifolds is also described. The theoretical foundation relies on a backward error analysis, which translates the geometric properties of the method into the structure of a modified differential equation, whose flow is nearly identical to the numerical method. Combined with results from perturbation theory, this explains the excellent longtime behaviour of the method: longtime energy conservation, linear error growth and preservation of invariant tori in nearintegrable systems, a discrete virial theorem, and preservation of adiabatic invariants.
Algorithmic challenges in computational molecular biophysics
 Journal of Computational Physics
, 1999
"... A perspective of biomolecular simulations today is given, with illustrative applications and an emphasis on algorithmic challenges, as reflected by the work of a multidisciplinary team of investigators from five institutions. Included are overviews and recent descriptions of algorithmic work in long ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
A perspective of biomolecular simulations today is given, with illustrative applications and an emphasis on algorithmic challenges, as reflected by the work of a multidisciplinary team of investigators from five institutions. Included are overviews and recent descriptions of algorithmic work in longtime integration for molecular dynamics; fast electrostatic evaluation; crystallographic refinement approaches; and implementation of large, computationintensive programs on modern architectures. Expected future developments of the field are also discussed. c ○ 1999 Academic Press Key Words: biomolecular simulations; molecular dynamics; longtime integration; fast electrostatics; crystallographic refinement; highperformance platforms.
Biomolecular dynamics at long timesteps: Bridging the timescale gap between simulation and experimentation
 ANNU. REV. BIOPHYS. BIOMOL. STRUCT
, 1997
"... Innovative algorithms have been developed during the past decade for simulating Newtonian physics for macromolecules. A major goal is alleviation of the severe requirement that the integration timestep be small enough to resolve the fastest components of the motion and thus guarantee numerical stab ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
Innovative algorithms have been developed during the past decade for simulating Newtonian physics for macromolecules. A major goal is alleviation of the severe requirement that the integration timestep be small enough to resolve the fastest components of the motion and thus guarantee numerical stability. This timestep problem is challenging if strictly faster methods with the same allatom resolution at small timesteps are sought. Mathematical techniques that have worked well in other multipletimescale contexts—where the fast motions are rapidly decaying or largely decoupled from others—have not been as successful for biomolecules, where vibrational coupling is strong. This review examines general issues that limit the timestep and describes available methods (constrained, reducedvariable, implicit, symplectic, multipletimestep, and normalmodebased schemes). A section compares results of selected integrators for a model dipeptide, assessing physical and numerical performance. Included is our dual timestep method LN, which relies on an approximate linearization of the equations of motion every �t interval (5 fs or less), the solution of which is obtained by explicit integration at the inner timestep �τ (e.g., 0.5 fs). LN is computationally competitive, providing 4–5 speedup factors, and results are in good agreement, in comparison to 0.5 fs trajectories. These collective algorithmic efforts help fill the gap between the time range that can be simulated and the timespans of major biological interest (milliseconds and longer). Still, only a hierarchy of models and methods, along with
Geometric Integrators for ODEs
 J. Phys. A
, 2006
"... Abstract. Geometric integration is the numerical integration of a differential equation, while preserving one or more of its “geometric ” properties exactly, i.e. to within roundoff error. Many of these geometric properties are of crucial importance in physical applications: preservation of energy, ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
Abstract. Geometric integration is the numerical integration of a differential equation, while preserving one or more of its “geometric ” properties exactly, i.e. to within roundoff error. Many of these geometric properties are of crucial importance in physical applications: preservation of energy, momentum, angular momentum, phase space volume, symmetries, timereversal symmetry, symplectic structure and dissipation are examples. In this paper we present a survey of geometric numerical integration methods for ordinary differential equations. Our aim has been to make the review of use for both the novice and the more experienced practitioner interested in the new developments and directions of the past decade. To this end, the reader who is interested in reading up on detailed technicalities will be provided with numerous signposts to the relevant literature. Geometric Integrators for ODEs 2 1.
Indicative Routes for Path Planning and Crowd Simulation
 INTERNATIONAL CONFERENCE ON THE FOUNDATIONS OF DIGITAL GAMES
, 2009
"... An important challenge in virtual environment applications is to steer virtual characters through complex and dynamic worlds. The characters should be able to plan their paths and move toward their desired locations, avoiding at the same time collisions with the environment and with other moving ent ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
An important challenge in virtual environment applications is to steer virtual characters through complex and dynamic worlds. The characters should be able to plan their paths and move toward their desired locations, avoiding at the same time collisions with the environment and with other moving entities. In this paper we propose a general method for realistic path planning, the Indicative Route Method (irm). In the irm, a socalled indicative route determines a global route for the character, whereas a corridor around this route is used to handle a broad range of other path planning issues, such as avoiding characters and computing smooth paths. As we will show, our method can be used for realtime navigation of many moving characters in complicated environments. It is fast, flexible and generates believable paths.
2001) Advanced character physics
 In Proceedings of the Game Developers Conference 2001. CMP media
"... This paper explains the basic elements of an approach to physicallybased modeling which is well suited for interactive use. It is simple, fast, and quite stable, and in its basic version the method does not require knowledge of advanced mathematical subjects (although it is based on a solid mathema ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
This paper explains the basic elements of an approach to physicallybased modeling which is well suited for interactive use. It is simple, fast, and quite stable, and in its basic version the method does not require knowledge of advanced mathematical subjects (although it is based on a solid mathematical foundation). It allows for simulation of both cloth; soft and rigid bodies; and even articulated or constrained bodies using both forward and inverse kinematics. The algorithms were developed for IO Interactive‟s game Hitman: Codename 47. There, among other things, the physics system was responsible for the movement of cloth, plants, rigid bodies, and for making dead human bodies fall in unique ways depending on where they were hit, fully interacting with the environment (resulting in the press oxymoron “lifelike death animations”). The article also deals with subtleties like penetration test optimization and friction handling. 1