An O(n) Time-Complexity Matrix Transpose on Torus Array Processor

Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm can speed up many applications. In this paper, we propose a new algorithm for n x n matrix transposition on array processors connected in to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 Second International Conference on Networking and Computing s. 242 - 247
Hlavní autoři: Ravankar, A. A., Sedukhin, S. G.
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.11.2011
Témata:
Arrays
Image sensors
Layout
matrix multiplication
Matrix transpose
permutation matrices
Registers
Routing
Sensors
Signal processing algorithms
torus array processors
ISBN:1457717964, 9781457717963
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm can speed up many applications. In this paper, we propose a new algorithm for n x n matrix transposition on array processors connected in torus network. The algorithm has O(n) time complexity. The algorithm uses matrix-matrix multiply-add (MMA) operation for transposing the matrix. We show how to align data and give algorithm for generating permutation matrices. The entire n x n matrix transposition is carried out in 5n time-steps. This approach does not require any dedicated connections for matrix transposition. Both input and output matrices are in canonical (natural and not skewed) layout. We also discuss blocked matrix transposition.
AbstractList Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm can speed up many applications. In this paper, we propose a new algorithm for n x n matrix transposition on array processors connected in torus network. The algorithm has O(n) time complexity. The algorithm uses matrix-matrix multiply-add (MMA) operation for transposing the matrix. We show how to align data and give algorithm for generating permutation matrices. The entire n x n matrix transposition is carried out in 5n time-steps. This approach does not require any dedicated connections for matrix transposition. Both input and output matrices are in canonical (natural and not skewed) layout. We also discuss blocked matrix transposition.
Author Sedukhin, S. G.
Ravankar, A. A.
Author_xml – sequence: 1
  givenname: A. A.
  surname: Ravankar
  fullname: Ravankar, A. A.
  email: m5132105@u-aizu.ac.jp
  organization: Grad. Sch. of Comput. Sci. & Eng., Univ. of Aizu, Aizu-Wakamatsu, Japan
– sequence: 2
  givenname: S. G.
  surname: Sedukhin
  fullname: Sedukhin, S. G.
  email: sedukhin@u-aizu.ac.jp
  organization: Grad. Sch. of Comput. Sci. & Eng., Univ. of Aizu, Aizu-Wakamatsu, Japan
BookMark eNotjjtPwzAYAI0ACVqysbF4hCHBn5_xGEU8KhXKEObqS2IkoyaO7CA1_55KcMttp1uRizGMjpBbYAUAs4-b-r0uOAMopDgjmTUlM9oqqbSFc7ICqYwBY7W8IllK3-yE1lZyc02qaqS7-_GBNn5weR2G6eCOfl7oG87RH2kTcUxTSI6GkTYh_iRaxYgL_YihcymFeEMuv_CQXPbvNfl8fmrq13y7e9nU1Tb3UKo5R46O99AbZUF0basMCi55iZahdQxLx5lte6FRQwfQyv50z3uJvTBKtUKsyd1f1zvn9lP0A8Zlr0FACUL8Ajg0Sns
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICNC.2011.43
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9780769545691
0769545696
EndPage 247
ExternalDocumentID 6131813
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ADFMO
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IEGSK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i185t-a2ae2d1d75913cbb57a32428a90a9e0a8e209bd36a61c11b4d5692d4ad3755b33
IEDL.DBID RIE
ISBN 1457717964
9781457717963
IngestDate Wed Aug 27 04:11:58 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i185t-a2ae2d1d75913cbb57a32428a90a9e0a8e209bd36a61c11b4d5692d4ad3755b33
PageCount 6
ParticipantIDs ieee_primary_6131813
PublicationCentury 2000
PublicationDate 2011-11-01
PublicationDateYYYYMMDD 2011-11-01
PublicationDate_xml – month: 11
  year: 2011
  text: 2011-11-01
  day: 01
PublicationDecade 2010
PublicationTitle 2011 Second International Conference on Networking and Computing
PublicationTitleAbbrev ICNC
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000669427
ssib015832743
Score 1.4901439
Snippet Matrix transpose is an essential operation in many applications like signal processing (ex. linear transforms) etc. and an efficient matrix transpose algorithm...
SourceID ieee
SourceType Publisher
StartPage 242
SubjectTerms Arrays
Image sensors
Layout
matrix multiplication
Matrix transpose
permutation matrices
Registers
Routing
Sensors
Signal processing algorithms
torus array processors
Title An O(n) Time-Complexity Matrix Transpose on Torus Array Processor
URI https://ieeexplore.ieee.org/document/6131813
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3NT8MgGMbJtnjwpGYzfoeDB02sK6UUOC6LiyY6d5hmt4XC22SX1rSdcf-9QLvpwYu30h4oH-0DL_weELoWFKhyM9UMnKm2MioQJiMB17HhxqSM-4Db-zOfTsViIWcddLdjYQDAbz6De3fp1_JNodcuVDa00mMFiXZRl_OkYbW2fYcw2zV5ay3V_IUTGUfcs1w2Q-KQy63FU5umu43wcvg0no4bQ0_H7_w6aMXrzOTgf294iAY_wB6e7aToCHUg76PRKMevN_ktdphH4D58Z35Zb_CLs-X_wq2veQW4yPG8KNcVHpWl2uAWHijKAXqbPMzHj0F7YkKwsrpbBypSEBliOJOE6tTWtHIDJqFkqCSESkAUytTQRCVEE5LGhiUyMraJKGcspfQY9fIihxOEw0xKo6UGxiDmoRYcMkkzEclYxPbJKeq74i8_GlOMZVvys79vn6N9H4z1EN8F6tXlGi7Rnv6sV1V55VvyGwPBmUA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3NT8MgGMbJnCZ6UrMZv-XgQROrpUCB47K4bHGbO0yz20KBJru0puuM--8F2k0PXryV9kD5aB944fcAwC3HBks3U02NM9WWWgZcpyhgimimdUKZD7i9D9l4zGczMWmAhy0LY4zxm8_Mo7v0a_k6VysXKnuy0mMFCe-AXUpIFFa01qb3IGo7J6vNpar_cCxIxDzNZbNEDrrcmDzVabzdCi-eBt1xt7L0dATPr6NWvNL0Dv_3jkeg_YPswclWjI5Bw2Qt0Olk8PUuu4cO9Ajcp-_sL8s1HDlj_i9YO5svDcwzOM2L1RJ2ikKuYY0P5EUbvPWep91-UJ-ZECys8paBjKSJNNKMCoRVYutauiETlyKUwoSSmygUicaxjJFCKCGaxiLStpEwozTB-AQ0szwzpwCGqRBaCWUoNYSFijOTCpzySBBO7JMz0HLFn39UthjzuuTnf9--Afv96Wg4Hw7GLxfgwIdmPdJ3CZplsTJXYE99lotlce1b9Rs045yH
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2011+Second+International+Conference+on+Networking+and+Computing&rft.atitle=An+O%28n%29+Time-Complexity+Matrix+Transpose+on+Torus+Array+Processor&rft.au=Ravankar%2C+A.+A.&rft.au=Sedukhin%2C+S.+G.&rft.date=2011-11-01&rft.pub=IEEE&rft.isbn=9781457717963&rft.spage=242&rft.epage=247&rft_id=info:doi/10.1109%2FICNC.2011.43&rft.externalDocID=6131813
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457717963/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457717963/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781457717963/sc.gif&client=summon&freeimage=true