Matrix algorithms on a hypercube I: Matrix multiplication

doi:10.1016/0167-8191(87)90060-3

Parallel Computing

Volume 4, Issue 1, February 1987, Pages 17-31

https://doi.org/10.1016/0167-8191(87)90060-3 Get rights and content

Abstract

We discuss algorithms for matrix multiplication on a concurrent processor containing a two-dimensional mesh or richer topology. We present detailed performance measurements on hypercubes with 4, 16, and 64 nodes, and analyze them in terms of communication overhead and load balancing. We show that the decomposition into square subblocks is optimal C code implementing the algorithms is available.

References (17)

E Brooks
Pure gauge SU(3) lattice theory on an array of computers
Phys. Rev. Lett.
(1984)
G Fox
Matrix operations on the homogeneous machines
(1982)
G Fox
The performance of the Caltech hypercube in scientific calculations
G Fox et al.
The Caltech concurrent computation program—Project description
G Fox et al.
Algorithms for concurrent processors
Phys. Today
(may 1984)
G.A Geist et al.
Parallel Cholesky factorization on a hypercube multiprocessor
ORNL-6190 Technical Report
(1985)
M.T Heath
Parallel Cholesky factorization in message-passing multiprocessor enviroments
ORNL-6150, Oak Ridge National Laboratory, Technical Report
(1985)

There are more references available in the full text version of this article.

Cited by (167)

Parallel Theatre: An actor framework in Java for high performance computing
2021, Simulation Modelling Practice and Theory
Citation Excerpt :
Parallel Theatre leverages on two concurrent executing modes: cooperative concurrency based on event-loops and message interleaving within each theatre, and truly parallelism of message processing in actors allocated to distinct theatres. The paper demonstrates the practical usefulness of Parallel Theatre by the development of two non-trivial scalable models respectively devoted to a parallel matrix multiplication algorithm [26–27] and to a large simulation model of the Iterated Prisoner's Dilemma (IPD) [36–38]. Both models exhibit a good execution performance.
Theatre is an actor-based system currently implemented in Java, which enables modelling, analysis and implementation of predictable time-dependent distributed systems like cyber-physical systems. Theatre, though, can also be used for untimed complex systems. The core feature of Theatre is its control-based character. A reflective control layer, which can be tailored to the needs of specific application domains, is responsible for scheduling and dispatching messages asynchronously exchanged among actors. A Theatre system is a federation of theatres (computing nodes), upon which application actors are partitioned. Actors can move from a theatre to another. In its distributed implementation, Theatre rests on a socket network initially established among the interacting theatres. Messages and actors exploit Java serialization/deserialization when moving from a theatre to another. This paper proposes a novel extension of Theatre, Parallel Theatre, which is developed for an exploitation of the computing potential of nowadays multi-core machines with shared memory. Parallel Theatre avoids sockets and Java serialization. A key factor of Parallel Theatre consists in being a completely lock-free computing framework. Locks are avoided not only at the application level, as it was already demonstrated by classical actor systems, but also in the runtime system, thus enabling high-performance computing of scalable systems. This paper describes Parallel Theatre and the particular control forms which were developed for untimed and timed parallel systems. Then two scalable models are presented. The first one is concerned with a parallel algorithm for matrix multiplication. The second example is related to a parallel simulation of a multi-agent model for the Iterated Prisoner's Dilemma (IPD), which permits to observe the emergence of cooperation in large populations of players. The experimental results confirm the achievement of good execution performance.
Cannon-type triangular matrix multiplication for the reduction of generalized HPD eigenproblems to standard form
2020, Parallel Computing
We first develop a new variant of Cannon’s algorithm for parallel matrix multiplication on rectangular process grids. Then we tailor it to selected situations where at least one triangular matrix is involved, namely “upper triangle of (full × upper triangular),” “lower triangle of (lower triangular × upper triangular),” and “all of (upper triangular × rectangular).” These operations arise in the transformation of generalized hermitian positive definite eigenproblems $A X = B X Λ$ to standard form $\tilde{A} \tilde{X} = \tilde{X} Λ,$ and making use of the triangular structure enables savings in arithmetic operations and communication. Numerical results show that the new implementations outperform previously available routines, and they are particularly effective if a whole sequence of generalized eigenproblems with the same matrix B must be solved, but they can also be competitive for the solution of a single generalized eigenproblem.
Secure Outsourced Matrix Multiplication with Fully Homomorphic Encryption
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Matrix-Based Elite Learning Swarm Optimizer for Large Scale Optimization
2023, SSRN
Matrix-Based Elite Learning Swarm Optimizer for Large Scale Optimization
2023, SSRN
Improved parallel matrix multiplication using Strassen and Urdhvatiryagbhyam method
2023, CCF Transactions on High Performance Computing

View all citing articles on Scopus

^☆: The research reported here was supported in part by Department of Energy grants DE-AS03-ER13118, DE-FG-03-85ER25009, and by the Parsons Foundation and Systems Development Foundation. S. Otto holds a Bantrell Research Fellowship at Caltech.

View full text

Matrix algorithms on a hypercube I: Matrix multiplication☆

Abstract

Pure gauge SU(3) lattice theory on an array of computers

Phys. Rev. Lett.

Matrix operations on the homogeneous machines

The performance of the Caltech hypercube in scientific calculations

The Caltech concurrent computation program—Project description

Algorithms for concurrent processors

Phys. Today

Parallel Cholesky factorization on a hypercube multiprocessor

ORNL-6190 Technical Report

Parallel Cholesky factorization in message-passing multiprocessor enviroments

ORNL-6150, Oak Ridge National Laboratory, Technical Report