Solving alignment using elementary linear algebra | Zendy

David Bau | Zendy; Induprakas Kodukula | Zendy; Vladimir Kotlyar | Zendy; Keshav Pingali | Zendy; Paul Stodghill | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Solving alignment using elementary linear algebra

Author(s) -

David Bau,

Induprakas Kodukula,

Vladimir Kotlyar,

Keshav Pingali,

Paul Stodghill

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

DOI - 10.1007/bfb0025870

Subject(s) - computer science , linear algebra , computation , code (set theory) , matrix (chemical analysis) , matrix algebra , numerical linear algebra , algorithm , theoretical computer science , data structure , parallel computing , algebra over a field , programming language , linear system , mathematics , mathematical analysis , eigenvalues and eigenvectors , materials science , physics , set (abstract data type) , quantum mechanics , composite material , geometry , pure mathematics

Data and computation alignment is an important part of compiling sequential programs to architectures with non-uniform memory access times. In this paper, we show that elementary matrix methods can be used to determine communication-free alignment of code and data. We also solve the problem of replicatingd ata to eliminate communication. Our matrix-based approach leads to algorithms which work well for a variety of applications, and which are simpler and faster than other matrix-based algorithms in the literature.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research