𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A class of parallel multiple-front algorithms on subdomains

✍ Scribed by A. Bose; G. F. Carey; V. F. de Almeida

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
177 KB
Volume
56
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
✍ Zhi-Long Chen; Warren B. Powell πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

A new parallel matrix multiplication alg
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
✍ Choi, Jaeyoung πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 139 KB πŸ‘ 3 views

We present a new fast and scalable matrix multiplication algorithm called DIMMA (distribution-independent matrix multiplication algorithm) for block cyclic data distribution on distributed-memory concurrent computers. The algorithm is based on two new ideas; it uses a modified pipelined communicatio

A Multiple-Heaps Algorithm for Parallel
A Multiple-Heaps Algorithm for Parallel Simulation of Collision Systems
✍ Mo Mu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 144 KB

We consider the parallel simulation of collision systems. It has wide application, such as in hard-sphere molecular dynamics simulation for gas dynamics and crystals, as well as in studying molecular collision dynamics of chemical reactions. With detailed analysis, proper data structures are designe

Impact of mixed-parallelism on parallel
Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms
✍ F. Desprez; F. Suter πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 277 KB

## Abstract In this paper we study the impact of the simultaneous exploitation of data‐ and task‐parallelism, so called mixed‐parallelism, on the Strassen and Winograd matrix multiplication algorithms. This work takes place in the context of Grid computing and, in particular, in the Client–Agent(s)

A poly-algorithm for parallel dense matr
A poly-algorithm for parallel dense matrix multiplication on two-dimensional process grid topologies
✍ Li, J.; Skjellum, A.; Falgout, R. D. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 872 KB

In this paper, we present several new and generalized parallel dense matrix multiplication algorithms of the form C = Ξ±AB + Ξ²C on two-dimensional process grid topologies. These algorithms can deal with rectangular matrices distributed on rectangular grids. We classify these algorithms coherently int