Optimal parallel and pipelined processing through a new class of matrices with application to generalized spectral analysis

A new class of general-base matrices, named sampling matrices, which are meant to bridge the gap between algorithmic description and computer architecture is proposed. "Poles," "zeros," "pointers," and "spans" are among the terms introduced to characterize pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computers Ročník 43; číslo 4; s. 443 - 459
Hlavný autor: Corinthios, M.J.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.04.1994
Institute of Electrical and Electronics Engineers
Predmet:
990200 - Mathematics & Computers
ALGORITHMS
Application software
Applied sciences
Bridges
COMPUTER ARCHITECTURE
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Error correction
Exact sciences and technology
FACTORIZATION
Fourier transforms
GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
MATHEMATICAL LOGIC
MATRICES
NUMERICAL SOLUTION
OPTIMIZATION
PARALLEL PROCESSING
PROGRAMMING
Sampling methods
Signal processing
Software
Spectral analysis
Topology
Pipelined architecture
Image processing
Parallel processing
Signal processing
Parallelism
Matrix theory
Generalized spectral analysis
Spectral analysis
Walsh transformation
ISSN:0018-9340, 1557-9956
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A new class of general-base matrices, named sampling matrices, which are meant to bridge the gap between algorithmic description and computer architecture is proposed. "Poles," "zeros," "pointers," and "spans" are among the terms introduced to characterize properties of this class of matrices. A formalism for the decomposition of a general matrix in terms of general-base sampling matrices is proposed. "Span" matrices are introduced to measure the dependence of a matrix span on algorithm parameters and, among others, the interaction between this class of matrices and the general-base perfect shuffle permutation matrix previously introduced. A classification of general-base parallel "recirculant" and parallel pipelined processors based on memory topology, access uniformity and shuffle complexity is proposed. The matrix formalism is then used to guide the search for algorithm factorizations leading to optimal parallel and pipelined processor architecture.< >
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.278482