Linear-time matrix transpose algorithms using vector register file with diagonal registers

Matrix transpose operation (MT) is used frequently in many multimedia and high performance applications. Therefore, using a faster MT operation results in a shorter execution time of these applications. In this paper we propose two new MT algorithms. The algorithms exploit diagonal register properti...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001 s. 8 pp.
Hlavní autori: Hanounik, B., Hu, X.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2001
Predmet:
Acceleration
Application software
Computer architecture
Computer science
Discrete cosine transforms
Multimedia computing
Registers
Scientific computing
Sections
Vector processors
ISBN:0769509908, 9780769509907
ISSN:1530-2075
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Matrix transpose operation (MT) is used frequently in many multimedia and high performance applications. Therefore, using a faster MT operation results in a shorter execution time of these applications. In this paper we propose two new MT algorithms. The algorithms exploit diagonal register properties to achieve a linear-time execution of MT operation using vector processor that supports diagonal registers. We demonstrate the algorithms as well as proofs, examples, and various enhancements to the proposed algorithms A performance evaluation shows that the proposed algorithms are at least twice as fast as one of the leading MT algorithms such as an algorithm that is implemented using Motorola's AltiVec architecture (n/spl ges/16). We believe that our work opens new doors to improve the execution time of many two-dimensional operations such as DCT, DFT, and Shearsort.
ISBN:0769509908
9780769509907
ISSN:1530-2075
DOI:10.1109/IPDPS.2001.924973