Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses

We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the powers, the inverse, the characteristic polynomial, the determinant, the rank a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Parallel algorithms and applications Ročník 19; číslo 4; s. 195 - 209
Hlavný autor: Li, Keqin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Taylor & Francis GroupAbingdon, UK 01.12.2004
Predmet:
Cost optimality
Linear speedup
Matrix computation
Optical bus
Processor array
Scalability
Time complexity
ISSN:1063-7192
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the powers, the inverse, the characteristic polynomial, the determinant, the rank and an LU- and a QR-factorization of a matrix; multiplying a chain of matrices; and solving linear systems of equations. These computations are based on efficient implementation of the fastest sequential matrix multiplication algorithm, and are highly scalable over a wide range of system size. Such fast and scalable parallel matrix computations were not seen before on distributed memory parallel computing systems.
AbstractList We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the powers, the inverse, the characteristic polynomial, the determinant, the rank and an LU- and a QR-factorization of a matrix; multiplying a chain of matrices; and solving linear systems of equations. These computations are based on efficient implementation of the fastest sequential matrix multiplication algorithm, and are highly scalable over a wide range of system size. Such fast and scalable parallel matrix computations were not seen before on distributed memory parallel computing systems.
Author Li, Keqin
Author_xml – sequence: 1
  givenname: Keqin
  surname: Li
  fullname: Li, Keqin
  email: lik@newpaltz.edu
BookMark eNqFkM1KAzEUhbOoYFt9Axd5gdFkEufHjUixVii40Y2b4U5-NJJJhiSl7ds7ZbqSYjf3wrl851zODE2cdwqhG0puKanIHSUFK2lNOCWE0JKQgvAJmh7kbNDzSzSL8We41ZSzKfpcQkwYnMRRgIXWKtxDAGuVxR2kYHZY-K7fJEjGu4i3Jn3joIR32nxtwgiYXlnjlMS-T2awwe0mqniFLjTYqK6Pe44-ls_vi1W2fnt5XTytM5GXNGV5KbViihGRc6Elr3jLqALKeaVrqVgh6TAKXfOStlTXVa6FBpC85feqyDmbo4fRVwQfY1C6EWZ8NwUwtqGkOTTTnGpmgPkfuA-mg7A_hx0zjdM-dLD1wcomwd76oAM4YeJJsEm7NMCPZ2H2b_wvLa-SOg
CitedBy_id crossref_primary_10_1109_TPDS_2007_1027
crossref_primary_10_1007_s11227_009_0319_0
Cites_doi 10.1016/S0747-7171(08)80013-2
10.1137/0205040
10.1023/A:1007922924139
10.1016/0020-0190(80)90042-3
10.1109/12.926164
10.1007/b102253
10.1109/MC.1987.1663446
10.1109/71.706044
10.1006/jpdc.1999.1569
10.1023/A:1008103903338
10.1016/0304-3975(87)90019-3
10.1016/S0020-0255(97)10013-5
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2004
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2004
DBID AAYXX
CITATION
DOI 10.1080/10637190410001700604
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 209
ExternalDocumentID 10_1080_10637190410001700604
10052458
GroupedDBID .7F
0BK
123
29O
4.4
AAGDL
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABDBF
ABFIM
ABJNI
ABLIJ
ABPAQ
ABXUL
ABXYU
ACTIO
ACTTO
ACUHS
ADCVX
ADGTB
AFBWG
AFION
AFRVT
AGDLA
AGVKY
AGWUF
AHDZW
AIJEM
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AQRUH
AQTUD
AVBZW
BLEHA
BWMZZ
CAG
CCCUG
CE4
COF
CS3
CYRSC
DAOYK
DGEBU
DKSSO
EAP
EBS
EJD
EMK
EPL
EST
ESX
H13
HF~
IPNFZ
KYCEM
M4Z
OPCYK
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TUS
UU3
ZGOLN
.QJ
07I
4B5
AAYXX
ABPEM
ADXEU
AEHZU
AEISY
AEZBV
AGBLW
AGMYJ
AGYFW
AIYEW
AKHJE
AKMBP
ALXIB
BGSSV
C0-
C5H
CITATION
DEXXA
E~A
E~B
FETWF
IFELN
L8C
TAP
UB6
UT5
~S~
ID FETCH-LOGICAL-c271t-27dfe3e30c24cfd484b31ea1448f9de36d1e366f9471b1f982fcfaad4b45e6243
IEDL.DBID TFW
ISSN 1063-7192
IngestDate Sat Nov 29 03:14:03 EST 2025
Tue Nov 18 21:26:40 EST 2025
Mon Oct 20 23:43:04 EDT 2025
Mon May 13 12:09:12 EDT 2019
IsPeerReviewed false
IsScholarly false
Issue 4
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c271t-27dfe3e30c24cfd484b31ea1448f9de36d1e366f9471b1f982fcfaad4b45e6243
PageCount 15
ParticipantIDs crossref_citationtrail_10_1080_10637190410001700604
crossref_primary_10_1080_10637190410001700604
informaworld_taylorfrancis_310_1080_10637190410001700604
PublicationCentury 2000
PublicationDate 12/1/2004
2004-12-00
PublicationDateYYYYMMDD 2004-12-01
PublicationDate_xml – month: 12
  year: 2004
  text: 12/1/2004
  day: 01
PublicationDecade 2000
PublicationTitle Parallel algorithms and applications
PublicationYear 2004
Publisher Taylor & Francis GroupAbingdon, UK
Publisher_xml – name: Taylor & Francis GroupAbingdon, UK
References bib14
Trahan JL (bib17) 1997
Kumar V (bib5) 1994
bib15
bib12
Li K (bib8) 2000
bib10
bib11
bib9
bib7
bib3
bib16
bib4
bib2
Li K (bib13) 1998
Chiarulli D (bib1) 1987; 30
Le Verrier UJJ (bib6) 1840; 5
References_xml – ident: bib2
  doi: 10.1016/S0747-7171(08)80013-2
– ident: bib3
  doi: 10.1137/0205040
– start-page: 564
  volume-title: Proc. Int. Conf. Parallel Distributed Comput. Syst.
  year: 1997
  ident: bib17
– ident: bib7
  doi: 10.1023/A:1007922924139
– ident: bib4
  doi: 10.1016/0020-0190(80)90042-3
– volume-title: Introduction to Parallel Computing, Benjaming/Cummings
  year: 1994
  ident: bib5
– start-page: 238
  year: 1998
  ident: bib13
  publication-title: Proc. 10th Int. Conf. Parallel Distributed Comput. Syst.
– ident: bib14
  doi: 10.1109/12.926164
– start-page: 333
  volume-title: High Performance Computing Systems and Applications, Kluwer Academic Publishers
  year: 2000
  ident: bib8
– ident: bib9
  doi: 10.1007/b102253
– volume: 5
  start-page: 220
  year: 1840
  ident: bib6
  publication-title: J. Math. Pures Appl.
– volume: 30
  start-page: 48
  year: 1987
  ident: bib1
  publication-title: IEEE Comput.
  doi: 10.1109/MC.1987.1663446
– ident: bib10
  doi: 10.1109/71.706044
– ident: bib11
  doi: 10.1006/jpdc.1999.1569
– ident: bib12
  doi: 10.1023/A:1008103903338
– ident: bib15
  doi: 10.1016/0304-3975(87)90019-3
– ident: bib16
  doi: 10.1016/S0020-0255(97)10013-5
SSID ssj0009143
Score 1.3486325
Snippet We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 195
SubjectTerms Cost optimality
Linear speedup
Matrix computation
Optical bus
Processor array
Scalability
Time complexity
Title Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses
URI https://www.tandfonline.com/doi/abs/10.1080/10637190410001700604
Volume 19
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  issn: 1063-7192
  databaseCode: TFW
  dateStart: 19930101
  customDbUrl:
  isFulltext: true
  dateEnd: 20041231
  titleUrlDefault: https://www.tandfonline.com
  omitProxy: false
  ssIdentifier: ssj0009143
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELZQxcBCeYrykgdWS3HsPDwiRMRUMRRRsUSJ7UOVQls1KerP55wHtFIBCZZkyWdHvrPPd7r7jpAbrQMRgRVMKOkzaQJgKgRgQe4Z9J-VySGum01Ew2E8HqvHtSp-l1bpfGhoiCLqs9pt7iwvu4w4fIciQkMmeUP_4vhf8BBGy-925ih5_mLd5W2GfSgYIvyudu6bQTZs0wZz6ZrNSfr__9sDst_eN-ltoyCHZMdOj0i_6-VA2619TF6SrKwoTkJLlJqrp6KOFbwobEHfHI3_iuoa1ET4qIvf0tqbhsnrctEAJnNX3W4Nnc3rEDnNl6UtT8hTcj-6e2Bt3wWm_YhXzI8MSs8KT_tSg5GxzAW3GbpeMShjRWg4PkJQaNhyDir2QUOWGZnLwIa-FKekN51N7RmhwkDmCOxVZNFvydAVN6gb3AJeQ1UM3oCIbsVT3ZKSu94YRcpb7tJtyzcg7BM1b0g5fvlerAszrepgCDSdS7Yi0mpVDUj8A0r8NOH536EXZK_jkvT4JelVi6W9Irv6vZqUi-tavT8AaRP0bA
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ1LSwMxEMcHrYJerE-szxy8BppN9pGjiKViLR4qipdlN8lIodbS3Yof32QfPqBWEC-7l_1vljx2MsPkNwBnSvk8RMMpl8KjQvtIZYBI_bStrf8sdYpRUWwi7Pejhwd5W2UTZlVapfOhsQRFFP9qt7hdMLpOibP3gIfWkglW8l8cAGYZVnxrah0-f9C5_-TusirHPuDUSrz69NwPb_lmnb6xS79YnU7zH753EzaqLSc5L-fIFiyZ8TY063IOpFrdO_DYSbKc2FZIZgfOHakiDgw-GpkReXYk_zeiClEZ5CMuhEsKhxqHT7NpKRhO3AF3o8nLpIiSk3SWmWwX7jqXg4surUovUOWFLKdeqO0AGt5WnlCoRSRSzkxiva8IpTY80MxeApTWtqUMZeShwiTRIhW-CTzB96AxfhmbfSBcY-IY9jI01nVJrDeu7fRgBu1OVEbYbgGvuzxWFZfclccYxazCl87rvhbQD9Wk5HL88jz_OppxXsRDsCxeMlcR5295C6IFKr6owYO_S09hrTu46cW9q_71IazXaMk2O4JGPp2ZY1hVr_kwm54Uc_0d9DL4lg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60inixPrE-9-B1oZvdJtmjqEFRSg8VxUtIdnekUGtpUvHnu5uHVqgV9JJc8mXDzmzmwcw3AGdKdXiAhlMuhUeF7iCVPiLtpG1t42epUwyLYRNBtxs-PsreTBe_K6t0MTSWRBHFv9od7rHGuiLO3n0eWEMmWEn_4vhflmHFes6-0_F-9PBFu8uqEnufUwvx6ua5H97yzTh9oy6dMTpR8_-fuwkblcNJzksN2YIlM9qGZj3MgVRneweeoiTLiV2EZFZsrqGKOFrw4dAMyYvj8X8nqgCVKT7iErikCKdx8DydlIDB2LW3G01ex0WOnKTTzGS7cB9d9S-uaTV4gSovYDn1Am3FZ3hbeUKhFqFIOTOJjb1ClNpwXzN78VFay5YylKGHCpNEi1R0jO8JvgeN0evI7APhGhPHYC8DYwOXxMbi2ioHM2j9UBliuwW83vFYVazkbjjGMGYVeem87WsB_USNS1aOX57ns8KM8yIbguXokrmIOH_PWxAuQPFFCx78HXoKa73LKL676d4ewnrNK9lmR9DIJ1NzDKvqLR9kk5NC0z8AAEr3SA
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%3Ajournal&rft.genre=article&rft.atitle=Fast+and+scalable+parallel+matrix+computations+with+reconfigurable+pipelined+optical+buses&rft.jtitle=Parallel+algorithms+and+applications&rft.au=Li%2C+Keqin&rft.date=2004-12-01&rft.pub=Taylor+%26+Francis+GroupAbingdon%2C+UK&rft.issn=1063-7192&rft.volume=19&rft.issue=4&rft.spage=195&rft.epage=209&rft_id=info:doi/10.1080%2F10637190410001700604&rft.externalDocID=10052458
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-7192&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-7192&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-7192&client=summon