Hardware Accelerated Scalable Parallel Random Number Generators JunKyu Lee, Gregory D. Peterson, Robert J. Harrison The University of Tennessee Abstract The Scalable Parallel Random Number Generators Accelerated Scalable Parallel ...

Performance analysis of large-scale protocol designs and network operations is accelerated by the novel, highly scalable and efficient parallel network simulators developed in this project. Also accomplished in this effort was: theoretical work on traffic...

... Implementation and scalability of a pure Java parallel framework with ... key words: Java; RMI; high-performance computing; scalability ...

... Title : Mapping Robust Parallel Multigrid Algorithms to Scalable Memory Architectures. ... Parallel multigrid; Robust multigrid. ...

... Title : SUPREM DSMC: A New Scalable, Parallel, Reacting, Multidimensional Direct Simulation Monte Carlo Flow Code. ...

... Title : Implementation and Scalability of a Pure Java Parallel Framework with Application to Hyperbolic Conservation Laws (Preprint). ...

We report on the application of the one-level FETI method to the solution of a class of substructural problems associated with the Department of Energy's Accelerated Strategic Computing Initiative (ASCI). We focus on numerical and parallel scalability issues, and on preliminary performance results obtained on the ASCI Option ...

... Liu, Y.; Fekete, A.; & Gorton, I. �Predicting the Performance of Middleware ... The author points out that the definition of scalability of parallel systems is ...

TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impacts on the SciDAC applications, including fusion simulation (CEMM), accelerator modeling (COMPASS), as well as many other mission-critical applications in DOE and elsewhere. Our recent developments have been focusing on new techniques to overcome ...

... Department of Defense (DoD) Issuances (current and cancelled), Joint Staff and other ... Title : Scalable Parallel Library for Numerical Linear Algebra. ...

... Title : SUPREM-DSMC: A New Scalable, Parallel, Reacting, Multidimensional Direct Simulation Monte Carlo Flow Code. ...

Jan 22, 2011 ... Title: Large Scale Integral Equation Modeling Using Scalable Parallel Processing . Authors: Cwik, T. Katz, D. Patterson, J. ...

... Department of Defense (DoD) Issuances (current and cancelled), Joint Staff and ... Title : A Scalable Parallel Library for Numerical Linear Algebra. ...

The MARS15 Monte Carlo code capabilities to deal with time-consuming deep penetration shielding problems and other computationally tough tasks in accelerator, detector and shielding applications, have been enhanced by a parallel processing option. It has been developed, implemented and tested on the Fermilab Accelerator Division Linux ...

We report on the application of the one-level FETI method to the solution of a class of structural problems associated with the Department of Energy's Accelerated Strategic Computing Initiative (ASCI). We focus on numerical and parallel scalability issues,and discuss the treatment by FETI of severe structural heterogeneities. ...

We discuss the scalable parallel solution of the Poisson equation within a Particle-In-Cell (PIC) code for the simulation of electron beams in particle accelerators of irregular shape. The problem is discretized by Finite Differences. Depending on the treatment of the Dirichlet boundary the resulting system of equations is symmetric or ...

N-Gram (n-character sequences in text documents) counting is a well-established technique used in classifying the language of text in a document. In this paper, n-gram processing is accelerated through the use of reconfigurable hardware on the XtremeData XD1000 system. Our design employs parallelism at multiple levels, with parallel ...

... PARALLEL APPROXIMATE FORMULATIONS OF MULTI- DIMENSIONAL SPATIAL AUTO-REGRESSION MODELS FOR SPATIAL DATA MINING 1 ...

... achieved by configurations consisting of two or more backend computers with one computer acting as the backend controller. ...

... Descriptors : *COMPUTER NETWORKS, COMPUTERIZED SIMULATION, PARALLEL PROCESSING, ONLINE SYSTEMS, QUALITY, SCALING ...

A new era of high-energy physics research is beginning requiring accelerators with much higher luminosities and interaction rates in order to discover new elementary particles. As a consequences, both orders of magnitude higher data rates from the detecto...

We have developed a full paralleled 2D electrostatic Particle-in-Cell/Monte-Carlo Coupled (PIC-MCC) code for capacitively coupled plasma (CCP) simulations. In this code, we distributed the grid between processors along radial direction, and Poisson equation is solved accordingly paralleled. We applied a couple of numerical accelerating ...

Over a decade of concerted effort in code development for accelerator applications has resulted in a new set of electromagnetic codes which are based on higher-order finite elements for superior geometry fidelity and better solution accuracy. SLAC's ACE3P code suite is designed to harness the power of massively parallel computers to tackle large ...

This case study presents initial results from research targeted at the development of cost-effective scalable visualization and rendering technologies. The implementations of two 3D graphics libraries based on the popular sort-last and sort-middle parallel rendering techniques are discussed. An important goal of these implementations is to provide ...

A Scalable Parallel Tree Search Library Peter Sanders Department of Computer Science, University and implementation ex� periences with the portable and reusable library PIGSeL for parallel tree search is possible in principle. On the other hand, tree search is a challenge to the load balancing algorithm

processing capacity. UNCLASSIFIED 3 #12;UNCLASSIFIED Scalable Parallel Topic Models research challenge). Note by memory. 4 Conclusion (U) In this paper we addressed scalability of the topic model Gibbs sampler. AfterPublished in: Journal of Intelligence Community Research and Development (2006). Scalable ...

A new algorithm for the multiprocessor computation of the multidimensional discrete Fourier transform is presented. The algorithm eliminates the need for interprocessor communication and is highly scalable. The cost of eliminating interprocessor communica...

... substructuring method for the parallel and scalable solution of a three- dimensional finite element based dynamic analysis of helicopter rotor blades. ...

Large Scale Integral Equation Modeling [Jsing Scalable. Tom Cwik*, Daniel Katzf, Jean Patterson. Parallel Processing. Jet Propulsion Laboratory ...

Page 1. AFRL-RI-RS-TR-2010-075 Final Technical Report March 2010 JESPP: JOINT EXPERIMENTATION ON SCALABLE ...

"YRAMID: Parallel Unstructured Adaptive Mesh Refinement Lib. Modern... Simple... Efficient... Scalable. ... An advanced suftware library supporting parallel ...

This paper presents the SCOOPP (SCalable Object Oriented Parallel Programming) approach to support the design and execution of scalable parallel applications. The SCOOPP programming model aims the portability, dynamic scalability and efficiency of parallel applications. The ...

Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. However, for many, scalability has theoretical interests only since it does not reveal execution time. In this paper, the relat...

Particle-in-cell (PIC) simulation is widely used in many branches of physics and engineering. In this paper, we give an analysis of the particle-field decomposition method and the domain decomposition method in parallel particle-in-cell beam dynamics simulation. The parallel performance of the two decomposition methods was studied on the Cray XT4 and the ...

into Parallel Programs. In Proceedings of the 16th International Parallel & Distributed Processing Symposium and Communication Sets for Data Parallel Programs. Journal of Parallel and Distributed Computing, 26(1):72--84, 1995: An Experimental Method for Measuring and Evaluating Parallel ...

This report details the main technical results of the research project 'A scalable parallel library for numerical linear algebra,' and constitutes the final report for this project. The research led to the development of a substantial body of software, bo...

Jan 22, 2011 ... Title: Large Scale Finite Element Modeling Using Scalable Parallel Processing. Authors: Cwik, T. Katz, D. Zuffada, C. Jamnejad, V. ...

A parallel Preconditioned Conjugate Gradient (PCG) iterative solver has been developed and implemented on the iPSC-860 scalable hypercube. This new implementation makes use of the Parallel Automated Runtime Toolkit at ICASE (PARTI) primitives to efficient...

... These scalable net- works offer a flexible alternative to the more common hypercube-based networks for inter- connecting the processors of large ...

... They have employed the concepts of parallel layout verification within their DRC tool called VAMPIRE. It is now a commercial product. ...

of the solution in an amount of time that is practical for engineering applications. The numerical solution of the integral equation is computed on scalable ...

... Corporate Author : MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE. Personal Author(s) : Kumar, Vipin. Handle / proxy Url : ...

... Open Database Connectivity) and SQL (Structured Query Language) commands ... by geography, by time, and by communication connection topology ...

in Java. The performance and scalability of the benchmarks point out the areas ... The implementation of the NPB in Java builds a base for tracking the ...

... special parallel processing schemes use specialized briefcase with the laptop computer. ... (depending on the cost of the laptop -which could be an ...

The design and operation support of hadron (proton and heavy-ion) linear accelerators require substantial use of beam dynamics simulation tools. The beam dynamics code TRACK has been originally developed at Argonne National Laboratory (ANL) to fulfill the special requirements of the rare isotope accelerator (RIA) accelerator systems. ...

We present a development environment for distributed GPU computing targeted for multi-GPU systems, as well as graphics clusters. Our system is based on CUDA and logically extends its parallel programming model for graphics processors to higher levels of parallelism, namely, the PCI bus and network interconnects. While the extended API mimics the full ...

We describe a version of an algorithm for evolving self-gravitating collections of particles that should be nearly ideal for parallel architectures. Our method is derived from the "self-consistent field" (SC F) approach suggested previously by Clutton-Brock and others. Owing to the use of a global description of the gravitational field, the particles in an SCF simulation do ...

... typically solved using either iterative or direct ... system solvers using direct methods, even on ... parallel direct solution of sparse linear systems-both in ...

... largest sparse linear systems that have been solved using direct methods. We have also developed robust and parallel preconditioners for iterative ...

These characteristics are guiding development of parallel I/O features for .... and to build consensus on cross-platform issues such as parallel I/O APIs. ...

Key words: Regional ocean modeling, parallelization, scalability, performance. 1 Introduction ... tal shelf/slope topography, and strong atmospheric forc- ...

[5] W. Griswold, G. Harrison, D. Notkin, and L. Snyder. Scalable abstractions for parallel .... Richard W. Barnwell guages and Compilers for Parallel ...

... Hypercube, Symult 2010 i'id BBN Butterfly are used ... 0(P 2) depending on the shapes of the ... Parallel Algorithms for M!achine Intelligence and Vision. ...

The objective of this work is to develop a parallel and scalable incompressible flow solver package which can be used for solving a variety of practical and ...

The linear Boltzmann transport equation (BTE) is an integro-differential equation arising in deterministic models of neutral and charged particle transport. In slab (one-dimensional Cartesian) geometry and certain higher-dimensional cases, Diffusion Synthetic Acceleration (DSA) is known to be an effective algorithm for the iterative solution of the discretized BTE. Fourier and ...

In this paper, we present an object-oriented three-dimensional parallel particle-in-cell code for beam dynamics simulation in linear accelerators. A two-dimensional parallel domain decomposition approach is employed within a message passing programming paradigm along with a dynamic load balancing. Implementing object-oriented software ...

This paper introduces PADMA (PArallel Data Mining Agents), a parallel agent based system for scalable text classification. PADMA contains modules for (1) parallel data accessing operations, (2) parallel hierarchical clustering, and (3) web-based data visualization. This paper introduces the ...

This paper describes the architecture of MOSE (My Own Search Engine), a scalable parallel and distributed engine for searching the web. MOSE was specifically designed to efficiently exploit affordable parallel architectures, such as clusters of workstations. Its modular and scalable architecture can be easily ...

Chromium Renderserver (CRRS) is software infrastructure thatprovides the ability for one or more users to run and view image outputfrom unmodified, interactive OpenGL and X11 applications on a remote,parallel computational platform equipped with graphics hardwareaccelerators via industry-standard Layer 7 network protocolsand clientviewers. The new contributions of this work ...

Running untrusted user-level code inside an operating system kernel has been studied in the 1990's but has not really caught on. We believe the time has come to resurrect kernel extensions for operating systems that run on highly-parallel clusters and supercomputers. The reason is that the usage model for these machines differs significantly from a desktop machine or ...

The spatial stochastic simulation of biochemical systems requires significant calculation efforts. Parallel discrete-event simulation is a promising approach to accelerate the execution of simulation runs. However, achievable speedup depends on the parallelism inherent in the model. One of our goals is to explore this degree of ...

The effect of parallel ion acceleration associated with convection was first applied to energization

Algorithm scalability and the distributed nature of both data and computation deserve serious attention in the context of data mining. This paper presents PADMA (PArallel Data Mining Agents), a parallel agent based system, that makes an effort to address these issues. PADMA contains modules for (1) parallel data ...

This report summarizes the existing statistical engines in VTK/Titan and presents the parallel versions thereof which have already been implemented. The ease of use of these parallel engines is illustrated by the means of C++ code snippets. Furthermore, this report justifies the design of these engines with parallel ...

parallel arc consistency algorithms can be effectively used to pre�process a con� straint network. Keywords. Results show that our parallel arc consistency algorithm can be used to effectively preScalable Parallel Arc Consistency Algorithms for Shared Memory Computers 3 James M. Conrad

This report summarizes existing statistical engines in VTK/Titan and presents both the serial and parallel k-means statistics engines. It is a sequel to [PT08], [BPRT09], and [PT09] which studied the parallel descriptive, correlative, multi-correlative, principal component analysis, and contingency engines. The ease of use of the new ...

In this paper we study the use of long distance interpolation methods with the low complexity coarsening algorithm PMIS. AMG performance and scalability is compared for classical as well as long distance interpolation methods on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability ...

A new approach to calculating the properties of large systems within the local density approximation (LDA) that offers the promise of scalability on massively parallel supercomputers is outlined. The electronic structure problem is formulated in real spac...

The objective of this project was to develop highly scalable quantum molecular dynamics software for the DoD CHSSI Initiative. Parallel versions of path integral Molecular Dynamics (PIMD) and centroid Molecular Dynamics (CMD) codes for homogeneous systems...

This contribution proposes a 128 bit wide interface structure clocked at approximately 80 MHz that will operate at 10 Gbps as a strawman for a 0C192C Utopia Specification. In addition, the concept of scalable width of data transfers in order to maintain manageably low clock rates is proposed.

The NRL Layered Ocean Model (NLOM) is written in the tiled data parallel programming style, and uses an application specific programming interface to isolate operations that require communication. This allows different scalable programming models to be 'p...

Scalable parallel algorithms for seismic imaging remain a significant challenge for the oil and gas industry. Scalability must address both the computational and the input/output portions of the algorithm in question. These issues are addressed by the ARCO Seismic Benchmark Suite, a public domain software system that provides an ...

We describe the design of a parallel global atmospheric circulation model, PCCM2. This parallel model is functionally equivalent to the National Center for Atmospheric Research's Community Climate Model, CCM2, but is structured to exploit distributed memory multi-computers. PCCM2 incorporates parallel spectral transform, ...

In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with focus on scalability issues, and demonstrate the parallel performance and scalability ...

Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large three-dimensional problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such ...

A new era of high-energy physics research is beginning requiring accelerators with much higher luminosities and interaction rates in order to discover new elementary particles. As a consequence, both orders of magnitude higher data rates from the detector and online processing power, well beyond the capabilities of current high energy physics data acquisition systems, are ...

In previous work we presented an algorithm for cloning parallel simulations that enables multiple simulated execution paths to be explored simultaneously. The method is targeted for parallel discrete event simulators that provide the simulation application developer a logical process (LP) execution model. The cloning algorithm gains efficiency by cloning ...

Scalability of Parallel Simulation Cloning Maria Hybinette Richard M. Fujimoto Computer Science presented an algorithm for cloning parallel simulations that enables multiple sim- ulated execution paths the simulation application developer a logical process (LP) execution model. The cloning algorithm gains

The mission of the Center for Scalable Programming Models (Pmodels) was to create new ways of programming parallel computers that are much easier for humans to conceptualize, that allow programs to be written, updated and debugged quickly, and that run extremely efficiently---even on computers with thousands or even millions of processors. At UIUC, our ...

An Interface to Support the Identification of Dynamic MPI 2 Processes for Scalable Parallel Lindley Hall, Computer Science Department, Bloomington, IN 47405 brbarret@osl.iu.edu 3 Argonne National to parallel debuggers such as TotalView about the set of processes that constitute an individual application

Since 1994, we have been using a data parallel form of our deterministic transport code DANTSYS to perform time-independent fixed source and eigenvalue calculations on the CM-200`s at Los Alamos National Laboratory (LANL). Parallelization of the transport sweep is obtained by using a 2-D spatial decomposition which retains the ability to invert the source ...

In addition to breaking the speed barrier, the parallel hypercube is about 10 ... Moreover, the hypercube architecture is scalable so that 10-fold performance ...

... The SWAN+ADCIRC code has been completed and the resulting tightly coupled scalable parallel unstructured grid wave-current model has been ...

Scalable scientific datamining on massively parallel computers. Space Microelectronics, 7, 40-49. Stolorz, P., Cheeseman, P. (1998). ...

... We used a multiprocessor simulator, Proteus, to compare these algorithms with existing algorithms. ... Using Proteus [4, 5, 9], ...

application when using high performance parallel machines. ...... Each component has perfect transmission (no reflection); but the z' wave exits ...

... [5] W. Griswold, G. Harrison, D. Notkin, and L. Snyder. Scalable abstractions for parallel programming. ... Richard W. Barnwell ...

... NCPS include scalable computing with heterogeneous, parallel architectures (from many-core to clusters, eg grid/cloud), computing with highly ...

PETSc is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. It employs the MPI standard for all message-passing communication.

Hadoop. The rest of the paper is organized as follows: Section 2 presents the .... relies on the parallelism provided by Hadoop to offer a highly scalable ...

... Mulder, W.: A New Multigrid Approach to Convection Problems. ... Alcouffe, RE; Brandt, A.; Dendy, JE Jr.; and Painter, JW: The Multi-Grid Method for ...

... For example, retail chains may keep sales transaction records to determine their best performing stores, or emerging consumer trends. ...

The primary goal of the High Performance Virtual Machines (HPVM) project was to reduce the effort required to build a high performance cluster and distributed applications by leveraging the investments and understanding of scalable parallel systems. The a...

... s/ /s/ CHRISTOPHER FLYNN EDWARD J. JONES Work Unit Manager ... 104 19a. NAME OF RESPONSIBLE PERSON Christopher Flynn ...

Jul 21, 2006 ... AMR is applied across disciplines and various mesh geometries, but has seen ... Modern... Simple... Efficient& Scalable... Task Objective ...

On July 5, 1994, an IBM Scalable POWER parallel System (IBM SP2) with 64 nodes, was installed at the

parallel scalability which allows for fast, automated, ..... AERO prediction of axial force benefit of swept fins for (+) configuration cases. ...

This paper describes the implementation of the bunch-by-bunch longitudinal feedback system for the PEP-II B Factory. Bunch spacing down to 2 ns is achieved using 500 Megasamples per second A/D and D/A converters, and AT&T 1610 Digital Signal Processors are integrated to run a downsampled feedback algorithm for each bunch in parallel. This general purpose programmable ...

Neuromorphic hardware systems provide new possibilities for the neuroscience modeling community. Due to the intrinsic parallelism of the micro-electronic emulation of neural computation, such models are highly scalable without a loss of speed. However, the communities of software simulator users and neuromorphic engineering in neuroscience are rather ...

PSE is made up of four technical areas, ASCI Simulation Development Environment (ASDE), Data Exploration and Management (DEM), Data Transfer and Storage (DTS), and Distributed Systems (DS). The goal of ASDE is to create a truly scalable simulation development environment across ASCI platforms. Specific objectives are to improve the environment to ...

The goal of this SciDAC project is to develop a scalable parallel and distributed computational framework consisting of methods, algorithms, and integrated software tools for: 1) multi Tera-to-Petascale simulations with quantum-level accuracy; 2) multimillion-to-multibillion-to-trillion atom molecular dynamics (MD) simulations based on density functional ...

This report summarizes existing statistical engines in VTK/Titan and presents the recently parallelized multi-correlative and principal component analysis engines. It is a sequel to [PT08] which studied the parallel descriptive and correlative engines. The ease of use of these parallel engines is illustrated by the means of C++ code ...

The Parallel Diagonal Dominant (PDD) algorithm is a highly efficient, ideally scalable tridiagonal solver. In this paper, a detailed study of the PDD algorithm is given. First the PDD algorithm is introduced. Then the algorithm is extended to solve periodic tridiagonal systems. A variant, the reduced PDD algorithm, is-also proposed. Accuracy analysis is ...

A data parallel version of the 3-D transport solver in DANTSYS has been in use on the SIMD CM-200`s at LANL since 1994. This version typically obtains grind times of 150--200 nanoseconds on a 2,048 PE CM-200. The authors have now implemented a new message passing parallel version of DANTSYS, referred to as DANTSYS/MPI, on the 512 PE Cray T3D at Los Alamos. ...

Efficient solution of large-scale, ill-conditioned and highly-indefinite algebraic equations often relies on high quality preconditioners together with iterative solvers. Because of their robustness, the factorization-based algorithms could play a significant role when they are combined with iterative methods, particularly in the development of scalable solvers. We present our ...

This project supports the development of software using terascale computers to carry out molecular simulations of protein function and macromolecular interactions. We are building on the existing CHARMM and Amber simulation packages, adapting them in novel ways to massively parallel architectures and high-performance CPUs. Three principal avenues being pursued are: (1) ...

Gang scheduling has been widely used as a practical solution to the dynamic parallel job scheduling problem. Parallel tasks of a job are scheduled for simultaneous execution on a partition of a parallel computer. Gang Scheduling has many advantages, such as responsiveness, efficient sharing of resources and ease of programming. ...

The Scalable Parallel Random Number Generators library (SPRNG) supports fast and scalable random number generation with good statistical properties for parallel computational science applications. In order to accelerate SPRNG in high performance reconfigurable computing systems, we present the ...

The Cross Platform Cluster Graphics Library (CGLX) is a flexible and transparent OpenGL-based graphics framework for distributed, high-performance visualization systems. CGLX allows OpenGL based applications to utilize massively scalable visualization clusters such as multi-projector or high-resolution tiled display environments and to maximize the achievable performance and ...

A three-dimensional MHD solver is described in the paper. The solver simulates reacting flows with nonequilibrium between translational-rotational, vibrational and electron translational modes. The conservation equations are discretized with implicit time marching and the second-order modified Steger-Warming scheme, and the resulted linear system is solved iteratively with Newton-Krylov-Schwarz ...

Pomegranate: A Fully Scalable Graphics Architecture Matthew Eldridge Homan Igehy Pat Hanrahan Stanford University Abstract Pomegranate is a parallel hardware architecture for polygon ren- dering to 64 such units may be com- bined. Pomegranate's scalability is achieved with a novel "sort- everywhere

This paper implements and analyzes a dual-primal iterative substructuring method for the parallel and scalable solution of a three- dimensional finite element based dynamic analysis of helicopter rotor blades. Scalability and solution times are studied us...

upgrades were performed in HPC capabilities which included DaVinci IBM P6 and Einstein CRAY XT5 systems. DaVinci a 115M grid on DaVinci and Einstein. Weak scalability test were performed by Carrica et al. [9] on Hawk scalability is 16.7% and 9.8% below ideal scaling on Einstein and DaVinci, respectively. The speedup drops 37

parallel application perfor- mance profiles. Developing Scalable Applications with Vampir, VampirServer and VampirTrace by Matthias S. M�uller, Andreas Kn�upfer, Matthias Jurenz, Matthias Lieber, Holger Brunst, Hartmut Mix, and Wolfgang E. Nagel presents scalability studies of Vampir and Vampir- Trace using the SPEC

Page 1. FO Accelerating Conservative Parallel Simulation of VHDL Circuits THESIS Joel F. Hurford Captain, USAF AFIT/GCS/ENG/94D-10 ...

Current trends in high performance computing suggest that users will soon have widespread access to clusters of multiprocessors with hundreds, if not thousands, of processors. This unprecedented degree of parallelism will undoubtedly expose scalability limitations in existing applications, where scalability is the ability of a ...

We describe a family of MPI applications we call the Parallel Unix Commands. These commands are natural parallel versions of common Unix user commands such as ls, ps, and find, together with a few similar commands particular to the parallel environment. We describe the design and implementation of these programs and present some ...

In this paper, the authors identify the scalability bottlenecks of an unstructured grid CFD code (PETSc-FUN3D) by studying the impact of several algorithmic and architectural parameters and by examining different programming models. The authors discuss the basic performance characteristics of this PDE code with the help of simple performance models developed in their earlier ...

The Community Atmosphere Model (CAM) is the atmospheric component of the Community Climate System Model (CCSM), and is the largest consumer of computing resources in typical CCSM simulations. The parallel implementation of the Community Atmosphere Model (CAM) employs a number of different domain decompositions. Currently, each decomposition must utilize the same number of MPI ...

, such as Borealis [7], limit their scalability by allocating an individual operator to a single node. That is (currently Borealis [7], yet highly independent of it). This independence is achieved by parallelizing instantiator is a concrete parallel query that has placeholders for IPs and ports to be used by each Stream

The objective of this research is to develop efficient parallel algorithms for solving large sparse linear systems of equations: In particular, it looks at direct solvers for solving sparse linear systems, hierarchical algorithms for n-body simulations, a...

Parallel implementations of a Newton-Krylov-Schwarz algorithm are used to solve a model problem representing low Mach number compressible fluid flow over a backward-facing step. The Mach number is specifically selected to result in a numerically (open quo...

Several features make Java an attractive choice for scientific applications. In order to gauge the applicability of Java to Computational Fluid Dynamics (CFD), we have implemented the NAS (NASA Advanced Supercomputing) Parallel Benchmarks in Java. The per...

An efficient, scalable, parallel algorithm for treating contacts in solid mechanics has been applied to interactions between particles in smooth particle hydrodynamics (SPH). The algorithm uses three different decompositions within a single timestep: (1) ...

We recently developed a parallel algorithm for computing ILU preconditioners, which was presented at Super Computing 1999. The algorithm has been shown to be highly scalable, in terms of execution time required for preconditioner factorization and applica...

This paper presents the results of a comparison of three parallel algebraic multigrid (AMG) preconditioners for structural mechanics applications. In particular, they are interested in investigating both the scalability and robustness of the preconditioners. Numerical results are given for a range of structural mechanics problems with various degrees of ...

We introduce a pure Java parallel framework for Single Process, Multiple Dataset (SPMD) applications, intended for time-accurate solutions of hyperbolic conservation laws. The software architecture is based upon an extension of the client-server paradigm,...

At the on-set of this SBIR program, SYSTRAN had the vision of utilizing the IEEE (Institute of Electrical and Electronics Engineers) standard for SCI (Scalable Coherent Interface) as the basis for implementing a parallel computer configured from mostly CO...

A set of tutorials for the Portable Extensible Toolkit for Scientific Computation (PETSc). Developed at Argonne National Laboratory, PETSc is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations that employs the MPI standard for parallelism.

We present a study that accentuates the performance and scalability aspects of directory-based cache coherence in multiprocessor systems. Using a multiprocessor with a software-based coherence scheme, efficient implementations rely heavily on the programmer`s ability to explicitly manage the memory system, which is typically handled by hardware support on other bus-based, ...

a novel method based on wavelength re-use and spatial division multiplexing (SDM) techniques to design evaluated the performance of RAPID using RSIM and found that RAPID outperforms mesh electrical network by 40-performance, scalable, parallel computing system called RAPID is designed using switchless, passive optical interconnect

In this paper the authors present performance results from several parallel benchmarks and applications on a 400-node Linux cluster at Sandia National Laboratories. They compare the results on the Linux cluster to performance obtained on a traditional distributed-memory massively parallel processing machine, the Intel TeraFLOPS. They discuss the ...

and a network of SUN workstations. We used P4 [3] to implement the one�dimensional simplex formulations. SomePerformance and Scalability of the Parallel Simplex Method for Dense Linear Programming Problems. The simplex method [4] is a commonly used way of solving linear programming problems. Solving large instances

Parallel Algorithm Scalability Issues in Peta ops Architectures #3; Ananth Grama 1 , Anshul Gupta 2 of petaFLOPS architectures entails exploitation of very large degrees of concurrency, locality of data analysis in the context of petaFLOPS systems. We present sample analyses #3; This work is sponsored by NSF

The BBN TC2000 is a scalable general purpose parallel architecture capable of efficiently supporting both shared memory and message passing programming paradigms. We describe the TC2000 machine architecture and the programming models which we have implemented on it. The parallel programming models are implemented in a portable manner ...

each processor makes serial calls to a MODFLOW simulator. Each MODFLOW simulation reads input files: Software, Efficiency, Scalability, Parallel, High Performance File Systems, GPFS. Introduction MODFLOW is a large serial simulation suite. A parallel recode would not be easy. Due to the complexity of MODFLOW, we

The development of scalable robust solvers for unstructured finite element applications related to viscous flow problems in earth sciences is an active research area. Solving high-resolution convection problems with order of magnitude 108 degrees of freedom requires solvers that scale well, with respect to both the number of degrees of freedom as well as having optimal ...

Constructing mixtures of tagged or bar-coded DNAs for sequencing is an important requirement for the efficient use of next-generation sequencers in applications where limited sequence data are required per sample. There are many applications in which next-generation sequencing can be used effectively to sequence large mixed samples; an example is the characterization of microbial communities where ...

In many plasma physics and charged-particle beam dynamics problems, Coulomb collisions are modeled by a Fokker-Planck equation. In order to incorporate these collisions, we present a three-dimensional parallel Langevin simulation method using a Particle-In-Cell (PIC) approach implemented on high-performance parallel computers. We perform, for the first ...

We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodity graphics accelerators. In addition, these stream ...

We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first and sort-last parallel graphics architectures that, in many cases, support the same applications while using only commodity graphics accelerators. In addition, these stream filters can ...

The IMPACT (Integrated Map and Particle Accelerator Tracking) code was first developed under Computational Grand Challenge project in the mid 1990s [1]. It started as a three-dimensional (3D) data parallel particle-in-cell (PIC) code written in High Performance Fortran. The code used a split-operator based method to solve the Hamiltonian equations of ...

Proto-I is a 3 MV, 800 kA, 24 ns electron beam accelerator that is under development at Sandia Laboratories. It represents an initial effort to develop a scalable technology that is applicable to accelerators for electron beam driven, inertial confinement fusion studies. Energy is supplied to each of the two diodes from six ...

One of the central challenges in modern science is the need to quickly derive knowledge and understanding from large, complex collections of data. We present a new approach that deals with this challenge by combining and extending techniques from high performance visual data analysis and scientific data management. This approach is demonstrated within the context of gaining insight from complex, ...

In astrophysics numerical star cluster simulations and hydrodynamical methods like SPH require computational performance in the petaflop range. The GRAPE-family of special purpose computing accelerators improves the cost-performance ratio compared to general purpose parallel computers, however with limited flexibility. The AHA-GRAPE architecture adds a ...

in the presence of a magnetic field that is parallel to the acceleration. This is accomplished by analytically to the linearized equations of ideal, incompressible MHD in a noninertial reference frame that has acceleration Vt simulation linearized simulation with shock acceleration linearized simulation with ...

Simulation software on today's HPC systems needs to be scalable to a large number of processes to make efficient use of such machines. Already at this level and especially with the expected increasing scalability of upcoming machines, the development and debugging of parallel programs becomes an increasingly difficult task. ...

Abstract. Accurate micro-finite element analyses of whole bones require the solution of large sets of algebraic equations. Multigrid has proven to be an effective approach to the design of highly scalable linear solvers for solid mechanics problems. We present some of the first applications of scalable linear solvers, on massively ...

An efficient, scalable, parallel algorithm for treating material surface contacts in solid mechanics finite element programs has been implemented in a modular way for MIMD parallel computers. The serial contact detection algorithm that was developed previously for the transient dynamics finite element code PRONTO3D has been extended ...

The scalable implementation of multigrid methods for machines with several thousands of processors is investigated. Parallel performance models are presented for three different structured-grid multigrid algorithms, and a description is given of how these models can be used to guide implementation. Potential pitfalls are illustrated when moving from ...

This paper describes a method for doing direct simulation Monte Carlo (DSMC) calculations using parallel processing and presents some results of applying the method to several hypersonic, rarefied flow problems. The performance and efficiency of the parallel method are discussed. The applications described are the flow in a channel and the flow about a ...

Tomographic imaging and computer simulations are increasingly yielding massive datasets. Interactive and exploratory visualizations have rapidly become indispensable tools to study large volumetric imaging and simulation data. Our scalable isosurface visualization framework on commodity off-the-shelf clusters is an end-to-end parallel and progressive ...

Medical imaging applications have growing processing requirements, and scalable multicomputers are needed to support these applications. Scalability -- performance speedup equal to the increased number of processors -- is necessary for a cost-effective multicomputer. We performed tests of performance and scalability on one through 16 ...

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the ...

We describe a fully scalable approach to the simulation of groundwater flow on a hierarchy of computing platforms, ranging from workstations to massively parallel computers. Specifically, we advocate the use of scalable conceptual models in which the subsurface model is defined independently of the computational grid on which the ...

The development of high performance, massively parallel computers and the increasing demands of computationally challenging applications have necessitated the development of scalable solvers and preconditioners. One of the most effective ways to achieve scalability is the use of multigrid or multilevel techniques. Algebraic multigrid ...

Efficient and faithful parallel simulation of large asynchronous systems is a challenging computational problem. It requires using the concept of local simulated times and a synchronization scheme. We study the scalability of massively parallel algorithms for discrete-event simulations which employ conservative synchronization to ...

We seek to improve on the conventional FFT-based algorithms for solving the Poisson equation with infinite-domain (open) boundary conditions for large problems in accelerator modeling and related areas. In particular, improvements in both accuracy and performance are possible by combining several technologies: the method of local corrections (MLC); the James algorithm; and ...

Quantum Monte Carlo (QMC) has proved to be an invaluable tool for predicting the properties of matter from fundamental principles, combining very high accuracy with extreme parallel scalability. By solving the many-body Schr"odinger equation through a stochastic projection, it achieves greater accuracy than mean-field methods and better scaling with system ...

We present teraflop-scale calculations of biomolecular electrostatics enabled by the combination of algorithmic and hardware acceleration. The algorithmic acceleration is achieved with the fast multipole method (FMM) in conjunction with a boundary element method (BEM) formulation of the continuum electrostatic model, as well as the BIBEE approximation to ...

Consider the solution of very large, sparse linear systems. The most popular techniques can be broadly classified as either direct or iterative. When the sparse matrix is symmetric and positive definite, direct methods use Cholesky factorization while iterative methods rely on Conjugate Gradients. Our goal is to develop a scalable and memory-efficient hybrid of the two methods ...