Full metadata record
DC FieldValueLanguage
dc.contributor.authorTSAY, JCen_US
dc.contributor.authorCHANG, PYen_US
dc.date.accessioned2014-12-08T15:03:31Z-
dc.date.available2014-12-08T15:03:31Z-
dc.date.issued1995-02-01en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://dx.doi.org/10.1109/71.342137en_US
dc.identifier.urihttp://hdl.handle.net/11536/2057-
dc.description.abstractA two-step regularization method in which first permutation sequences and then broadcast planes are selected is proposed to design various regular iterative algorithms for matrix multiplication. The regular iterative algorithms are then spacetime mapped to regular arrays, such as mesh, cylindrical, two-layered mesh, and orbital arrays. The proposed method can be used to design regular arrays with execution time of less than N (problem size).en_US
dc.language.isoen_USen_US
dc.subjectBROADCASTen_US
dc.subjectCYLINDRICAL ARRAYen_US
dc.subjectMESH ARRAYen_US
dc.subjectORBITAL ARRAYen_US
dc.subjectPARALLEL ALGORITHM DESIGNen_US
dc.subjectPERMUTATION SEQUENCEen_US
dc.subjectPROPAGATIONen_US
dc.subject2-LAYERED MESH ARRAYen_US
dc.subjectVLSI ARCHITECTUREen_US
dc.titleDESIGN OF EFFICIENT REGULAR ARRAYS FOR MATRIX MULTIPLICATION BY 2-STEP REGULARIZATIONen_US
dc.typeNoteen_US
dc.identifier.doi10.1109/71.342137en_US
dc.identifier.journalIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSen_US
dc.citation.volume6en_US
dc.citation.issue2en_US
dc.citation.spage215en_US
dc.citation.epage222en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department工學院zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentCollege of Engineeringen_US
dc.identifier.wosnumberWOS:A1995QF36400015-
dc.citation.woscount6-
Appears in Collections:Articles


Files in This Item:

  1. A1995QF36400015.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.