𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallelizing the construction of indirect access arrays for shared-memory machines

✍ Scribed by Tuszyński, Jaroslaw ;Löhner, Rainald

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
123 KB
Volume
14
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

✦ Synopsis

A way has been found to form indirect addressing lists in parallel on shared-memory parallel machines. The maximum possible speed-up for typical tetrahedral grids is approximately 1 : 23. The algorithm requires an additional scratch array to shift from the serial elements surrounding points' to the parallel elements surrounding processors surrounding points' paradigm. The algorithm developed is general in nature, i.e. applicable to all indirect addressing lists. All numerical methods requiring the construction of indirect data structures, such as sparse matrix linear algebra procedures, ®eld and particle solvers operating on unstructured grids, and network ¯ow applications should see a bene®t from this algorithm when running on shared-memory parallel machines.

📜 SIMILAR VOLUMES

Parallel Fock matrix construction with d
Parallel Fock matrix construction with distributed shared memory model for the FMO-MO method
✍ Hiroaki Umeda; Yuichi Inadomi; Toshio Watanabe; Toru Yagi; Takayoshi Ishimoto; T 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 706 KB

## Abstract A parallel Fock matrix construction program for FMO‐MO method has been developed with the distributed shared memory model. To construct a large‐sized Fock matrix during FMO‐MO calculations, a distributed parallel algorithm was designed to make full use of local memory to reduce communic

Parallelization of the ILU(0) preconditi
Parallelization of the ILU(0) preconditioner for CFD problems on shared-memory computers
✍ Laura C. Dutto; Wagdi G. Habashi 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 3 views

The use of ILU(0) factorization as a preconditioner is quite frequent when solving linear systems of CFD computations. This is because of its efficiency and moderate memory requirements. For a small number of processors, this preconditioner, parallelized through coloring methods, shows little saving

Vector and parallel algorithms for the m
Vector and parallel algorithms for the molecular dynamics simulation of macromolecules on shared-memory computers
✍ John E. Mertz; Douglas J. Tobias; Charles L. Brooks III; U. C. Singh 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 797 KB

## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, shared‐memory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev