{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:28:05Z","timestamp":1725550085390},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_89","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T09:59:18Z","timestamp":1128419958000},"page":"786-795","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Blocked Algorithm for Solving the Algebraic Path Problem on a Matrix Processor"],"prefix":"10.1007","author":[{"given":"Akihito","family":"Takahashi","sequence":"first","affiliation":[]},{"given":"Stanislav","family":"Sedukhin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"89_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/3-540-44985-X_36","volume-title":"Algorithm Theory - SWAT 2000","author":"G. Venkataraman","year":"2000","unstructured":"Venkataraman, G., Sahni, S., Mukhopadhyaya, S.: A blocked all-pairs shortest-paths algorithm. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, p. 419. Springer, Heidelberg (2000)"},{"key":"89_CR2","doi-asserted-by":"crossref","unstructured":"Penner, M., Prasanna, V.K.: Cache-friendly implementations of transitive closure. In: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques (PACT 2001), Barcelona, Spain (September 2001)","DOI":"10.1109\/PACT.2001.953299"},{"key":"89_CR3","unstructured":"Griem, G., Oliker, G.: Transitive closure on the Imagine stream processor. In: The 5th Workshop on Media and Stream Processors (MSP-5), San Diego, CA (December 2003)"},{"issue":"9","key":"89_CR4","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPDS.2004.44","volume":"15","author":"J.-S. Park","year":"2004","unstructured":"Park, J.-S., Penner, M., Prasanna, V.K.: Optimizing graph algorithms for improved cache performance. IEEE Transactions on Parallel and Distributed Systems\u00a015(9), 769\u2013782 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"6","key":"89_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Communications ACM\u00a05(6), 345 (1962)","journal-title":"Communications ACM"},{"key":"89_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"Rote, G.: A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion). Computing\u00a034, 191\u2013219 (1985)","journal-title":"Computing"},{"key":"89_CR7","doi-asserted-by":"crossref","unstructured":"Robert, Y., Trystram, D.: Parallel implementation of the algebraic path problem. In: Proceedings of the Conference on Algorithms and Hardware for Parallel Processing (CONPAR 1986), pp. 149\u2013156 (1986)","DOI":"10.1007\/3-540-16811-7_165"},{"key":"89_CR8","doi-asserted-by":"crossref","unstructured":"Nunez, F.J., Valero, M.: A block algorithm for the algebraic path problem and its execution on a systolic array. In: Proceedings of the International Conference on Systolic Arrays, pp. 265\u2013274 (1988)","DOI":"10.1109\/ARRAYS.1988.18067"},{"key":"89_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0020-0190(88)90185-8","volume":"26","author":"B.M. Maggs","year":"1988","unstructured":"Maggs, B.M., Plotkin, S.A.: Minimum-cost spanning tree as a path-finding problem. Information Processing Letters\u00a026, 291\u2013293 (1988)","journal-title":"Information Processing Letters"},{"key":"89_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-7091-9076-0_9","volume":"7","author":"G. Rote","year":"1990","unstructured":"Rote, G.: Path problems in graphs. Computing Supplementum\u00a07, 155\u2013189 (1990)","journal-title":"Computing Supplementum"},{"issue":"3","key":"89_CR11","first-page":"269","volume":"11","author":"S. Sedukhin","year":"1992","unstructured":"Sedukhin, S.: Design and analysis of systolic algorithms for the algebraic path problem. Computers and Artificial Intelligence\u00a011(3), 269\u2013292 (1992)","journal-title":"Computers and Artificial Intelligence"},{"key":"89_CR12","unstructured":"Fink, E.: A survey of sequential and systolic algorithms for the algebraic path problem, Technical report CS-92-37, Department of Computer Science, University of Waterloo (1992)"},{"key":"89_CR13","unstructured":"Cachera, D., Rajopadhye, S., Risset, T., Tadonki, C.: Parallelization of the algebraic path problem on linear SIMD\/SPMD arrays, Technical report 1346, Irisa (2001)"},{"key":"89_CR14","unstructured":"Olson, T.: Advanced processing techniques using the Intrinsity FastMATH processor, in: Embedded Processor Forum, California, USA (May 2002)"},{"key":"89_CR15","unstructured":"Anantha, V., Harle, C., Olson, T., Yost, G.: An innovative high-performance architecture for vector and matrix math algorithms. In: Proceedings of the 6th Annual Workshop on High Performance Embedded Computing (HPEC 2002), Massachusetts, USA (September 2002)"},{"key":"89_CR16","unstructured":"Intrinsity Software Application Writer\u2019s Manual, ver. 0.3, Intrinsity, Inc (2003)"},{"key":"89_CR17","unstructured":"Using MATLAB Version 6, The Math Works, Inc. (2002)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T22:53:26Z","timestamp":1552431206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11557654_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}