A comparison of three widely used time propagation algorithms for the time dependent
Schrödinger equation is described. A typical evolution problem is chosen to demonstrate the …

BSPlib is a small communications library for bulk synchronous parallel (BSP) programming
which consists of only 20 basic operations. This paper presents the full definition of BSPlib in …

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 …

Graph partitioning is often used for load balancing in parallel computing, but it is known that
hypergraph partitioning has several advantages. First, hypergraphs more accurately model …

A new method is presented for distributing data in sparse matrix-vector multiplication. The
method is two-dimensional, tries to minimize the true communication volume, and also tries to …

In this article, we introduce a cache-oblivious method for sparse matrix–vector multiplication.
Our method attempts to permute the rows and columns of the input matrix using a recursive …

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

We consider the problem of computing a weighted edge matching in a large graph using a
parallel algorithm. This problem has application in several areas of combinatorial scientific …

Given a partitioning of a sparse matrix for parallel matrix–vector multiplication, which
determines the total communication volume, we try to find a suitable vector partitioning that …

The vibrational predissociation dynamics of a collinear model of the 12 (v) He cluster is
studied by numerically exact time-dependent quantum mechanics, and by the time-dependent …