𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A framework for scalable greedy coloring on distributed-memory parallel computers

✍ Scribed by Doruk Bozdağ; Assefaw H. Gebremedhin; Fredrik Manne; Erik G. Boman; Umit V. Catalyurek

Book ID
108191949
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
663 KB
Volume
68
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scalable Parallel Matrix Multiplication
Scalable Parallel Matrix Multiplication on Distributed Memory Parallel Computers
✍ Keqin Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel

Four-Index transformation on distributed
Four-Index transformation on distributed-memory parallel computers
✍ Lawrence A. Covick; Kenneth M. Sando 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 834 KB

Because it has 0(N5) operations, a low computation to data transfer ratio, and is a compact piece of code, the four-index transformation is a good test case for parallel algorithm development of electronic structure calculations. We present an algorithm primarily designed for distributed-memory mach

A parallel solver for tridiagonal linear
A parallel solver for tridiagonal linear systems for distributed memory parallel computers
✍ L. Brugnano 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Brugnano, L\_, A parallel solver for tridiagonal linear systems for distributed memory parallel computers, Parallel Computing 17 (1991) 1017-1023. The solution of linear tridiagonal systems is a very common problem in Numerical Analysis. Many algorithms are known for solving such linear systems on