1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorTSAY, JCen_US
dc.contributor.authorCHANG, PYen_US
dc.date.accessioned2014-12-08T15:03:27Z-
dc.date.available2014-12-08T15:03:27Z-
dc.date.issued1995-04-01en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://dx.doi.org/10.1109/71.372789en_US
dc.identifier.urihttp://hdl.handle.net/11536/2000-
dc.description.abstractIn this paper, we present some new regular iterative algorithms for matrix multiplication and transitive closure. With these algorithms, by spacetime mapping the 2-D arrays with 2N-1 and [(3N-1)/2] execution times for matrix multiplication can be obtained, Meanwhile, we can derive a 2-D array with 4N-2 execution time for transitive closure based on the sequential Warshall-Floyd algorithm. All these new 2-D arrays for matrix multiplication and transitive closure have the advantages of faster and more regular than other previous designs.en_US
dc.language.isoen_USen_US
dc.subjectALGORITHM MAPPINGen_US
dc.subjectMATRIX MULTIPLICATIONen_US
dc.subjectMESH ARRAYen_US
dc.subjectSYSTOLIC ARRAYen_US
dc.subjectSPHERICAL ARRAYen_US
dc.subjectTRANSITIVE CLOSUREen_US
dc.subjectVLSIen_US
dc.titleSOME NEW DESIGNS OF 2-D ARRAY FOR MATRIX MULTIPLICATION AND TRANSITIVE CLOSUREen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/71.372789en_US
dc.identifier.journalIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSen_US
dc.citation.volume6en_US
dc.citation.issue4en_US
dc.citation.spage351en_US
dc.citation.epage362en_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:A1995QP14200002-
dc.citation.woscount3-
Appears in Collections:Articles


Files in This Item:

  1. A1995QP14200002.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.

Related Contents
Loading...