1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, PYen_US
dc.contributor.authorTSAY, JCen_US
dc.date.accessioned2014-12-08T15:03:55Z-
dc.date.available2014-12-08T15:03:55Z-
dc.date.issued1994-07-01en_US
dc.identifier.issn0018-9340en_US
dc.identifier.urihttp://dx.doi.org/10.1109/12.293256en_US
dc.identifier.urihttp://hdl.handle.net/11536/2436-
dc.description.abstractIt has been shown that the method of decomposing a dependence graph into multiple phases with appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. In this paper, we will further apply this method to design several parallel algorithms for Algebraic Path Problem and derive N x N 2-D regular arrays with execution time [9N/2] - 2 (cylindrical array and orthogonal one) and 4N - 2 (spherical one).en_US
dc.language.isoen_USen_US
dc.subjectALGEBRAIC PATH PROBLEMen_US
dc.subjectCYLINDRICAL ARRAYen_US
dc.subjectPARALLEL ALGORITHM DESIGNen_US
dc.subjectSYSTOLIC ARRAYen_US
dc.subjectSPHERICAL ARRAYen_US
dc.subjectTRANSITIVE CLOSUREen_US
dc.subjectVLSI ARCHITECTUREen_US
dc.titleA FAMILY OF EFFICIENT REGULAT ARRAYS FOR ALGEBRAIC PATH PROBLEMen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/12.293256en_US
dc.identifier.journalIEEE TRANSACTIONS ON COMPUTERSen_US
dc.citation.volume43en_US
dc.citation.issue7en_US
dc.citation.spage769en_US
dc.citation.epage777en_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:A1994NW45800001-
dc.citation.woscount8-
Appears in Collections:Articles


Files in This Item:

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