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 inter …

Following the initial release of LAPACK and the emerging importance of distributed memory
computing, work began on adapting LAPACK to distributed-memory architectures. Since …

This paper describes the LINPACK Benchmark and some of its variations commonly used to
assess the performance of computer systems. Aside from the LINPACK Benchmark suite, the …

This is the first text explaining how to use the bulk synchronous parallel (BSP) model and the
freely available BSPlib communication library in parallel algorithm design and parallel …

Short‐range molecular dynamics simulations of molecular systems are commonly
parallelized by replicated‐data methods, in which each processor stores a copy of all atom …

Bulk synchronous parallel architectures offer the prospect of achieving both scalable parallel
performance and architecture independent parallel software. They provide a robust model …

Dense linear systems of equations are quite common in science and engineering, arising in
boundary element methods, least squares problems, and other settings. Massively parallel …

This article presents various data redistribution methods for block-partitioned linear algebra
algorithms operating on dense matrices that are distributed in a block-cyclic fashion …

It is known that random network coding (RNC) technology helps enhance multimedia
content distribution systems in various ways; however, the enhancement can vary widely …

Simulations of interacting particles are common in science and engineering, appearing in
such diverse disciplines as astrophysics, fluid dynamics, molecular physics, and materials …