{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T15:14:15Z","timestamp":1675955655251},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2007,3,19]]},"DOI":"10.1007\/s11227-006-0013-4","type":"journal-article","created":{"date-parts":[[2007,3,8]],"date-time":"2007-03-08T21:00:22Z","timestamp":1173387622000},"page":"49-66","source":"Crossref","is-referenced-by-count":3,"title":["Computing all-pairs shortest paths on a linear systolic array and hardware realization on a reprogrammable FPGA platform"],"prefix":"10.1007","volume":"40","author":[{"given":"E. I.","family":"Milovanovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. \u017d.","family":"Milovanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. P.","family":"Bekakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. N.","family":"Tselepis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"13_CR1","volume-title":"Design and analysis of computer algorithms","author":"V Aho","year":"1975","unstructured":"Aho V, Hopcroft JE, Ullman JD (1975) Design and analysis of computer algorithms. Addison-Wesley, Reading"},{"key":"13_CR2","first-page":"9","volume":"7","author":"M Bekakos","year":"2002","unstructured":"Bekakos M, Milovanovi\u0107 E, Stojanovi\u0107 NT, Toki\u0107 T, Milovanovi\u0107 I, Milentijevi\u0107 I (2002) Transformation matrices for systolic array synthesis. J Electrotechn Math 7:9\u201315","journal-title":"J Electrotechn Math"},{"key":"13_CR3","first-page":"175","volume-title":"Series: Advances in high performance computing, vol 5","author":"MP Bekakos","year":"2001","unstructured":"Bekakos MP, Milovanovi\u0107 I\u017d, Milovanovi\u0107 EI, Toki\u0107 TI, Stoj\u010dev MK (2001) Hexagonal systolic arrays for matrix multiplications. In: Bekakos MP (ed) Series: Advances in high performance computing, vol 5. WITpress, Southampton Boston, pp 175\u2013209"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bondhugula U, Devulapalli A, Fernando J, Wyckoff P, Sadayappan P (2006) Parallel FPGA-based all-pairs shortest paths in a directed graph. In: Proc 20th IEEE international parallel and distributed processing symposium (IPDPS\u201906), Rhodos, Greece, 2006","DOI":"10.1109\/IPDPS.2006.1639347"},{"issue":"4","key":"13_CR5","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/71.995819","volume":"13","author":"SM Chai","year":"2002","unstructured":"Chai SM, Wills DS (2002) Systolic opportunities for multidimensional data streams. IEEE Trans Parallel Distrib Syst 13(4):388\u2013398","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"7","key":"13_CR6","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/12.293256","volume":"C-43","author":"P-Y Chang","year":"1994","unstructured":"Chang P-Y, Tsay J-C (1994) A family of efficient regular arrays for algebraic path problem. IEEE Trans Comput C-43(7):769\u2013777","journal-title":"IEEE Trans Comput"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1016\/S0167-8191(00)00039-9","volume":"26","author":"CT Djamegni","year":"2000","unstructured":"Djamegni CT, Quinton P, Rajopadhye S, Risset T (2000) Derivation of systolic algorithms for the algebraic path problem by recurrence transformations. Parallel Comput 26:1429\u20131445","journal-title":"Parallel Comput"},{"key":"13_CR8","unstructured":"Efremides OB, Bekakos MP (1999) Nonlinear approach to designing processor time optimal systolic arrays for matrix vector multiplication. In: Lipitakis EA (ed) Proc Fourth hellenic-european conference on computer mathematics and its applications, Athens\u201998, Publ. LEA, 1998, pp 327\u2013336"},{"key":"13_CR9","first-page":"339","volume-title":"Series: Advances in high performance computing, vol 5","author":"OB Efremides","year":"2001","unstructured":"Efremides OB, Bekakos MP (2001) Designing processor-time optimal systolic configurations. In: Bekakos MP (ed) Series: Advances in high performance computing, vol 5. WITpress, Southampton Boston, pp 339\u2013364"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97, Shortest path, C. ACM 5:345","journal-title":"C. ACM"},{"key":"13_CR11","unstructured":"Fortes JAB, Wah BW, Shang W, Ganapathy KN (1994) Algorithm-specific parallel processing with linear processor arrays. In: Advances in computers. Academic Press, vol 33, pp 1\u201339"},{"key":"13_CR12","unstructured":"Guibas J, Kung HT, Thompson CD (1979) Direct VLSI implementation of combinatorial algorithms. In: Proc caltech conference on VLSI: architecture, design, fabrication, 1979, pp 509\u2013525"},{"key":"13_CR13","volume-title":"VLSI array processors","author":"SY Kung","year":"1988","unstructured":"Kung SY (1988) VLSI array processors. Prentice Hall, Englewood Cliffs"},{"issue":"5","key":"13_CR14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"C-36","author":"SY Kung","year":"1987","unstructured":"Kung SY, Lo SC, Lewis PS (1987) Optimal systolic design for the transitive closure problem. IEEE Trans Comput C-36(5):603\u2013614","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.80125","volume":"1","author":"P-Z Lee","year":"1990","unstructured":"Lee P-Z, Kedem ZM (1990) Mapping nested loop algorithms into multidimensional systolic arrays. IEEE Trans Parallel Distrib Syst 1(1):64\u201376","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"13_CR16","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"FT Leighton","year":"1992","unstructured":"Leighton FT (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufman, San Mateo"},{"issue":"1","key":"13_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/12.67325","volume":"C-40","author":"PS Lewis","year":"1991","unstructured":"Lewis PS, Kung SY (1991) An optimal systolic array for algebraic path problem. IEEE Trans Comput C-40(1):100\u2013105","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"13_CR18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0898-1221(96)00100-9","volume":"32","author":"I\u017d Milovanovi\u0107","year":"1996","unstructured":"Milovanovi\u0107 I\u017d, Milovanovi\u0107 EI, Milentijevi\u0107 IZMK, Stoj\u010dev MK (1996) Designing of processor-time optimal systolic arrays for band-matrix vector multiplication. Comput Math Appl 32(2):21\u201331","journal-title":"Comput Math Appl"},{"issue":"5","key":"13_CR19","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1109\/71.503769","volume":"7","author":"JF Myoupo","year":"1996","unstructured":"Myoupo JF, Fabret AC (1996) A modular systolic linearization of the Warshal-Floyd algorithm. IEEE Trans Parallel Distrib Syst 7(5):449\u2013455","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02309554","volume":"39","author":"Y Robert","year":"1987","unstructured":"Robert Y, Trystram D (1987) An orthogonal systolic array for algebraic path problem. Comput 39:187\u2013199","journal-title":"Comput"},{"issue":"3","key":"13_CR21","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/71.139208","volume":"3","author":"W Shang","year":"1992","unstructured":"Shang W, Fortes JAB (1992) On time mapping of uniform dependence algorithms into lower dimensional processor arrays. IEEE Trans Parallel Distrib Syst 3(3):350\u2013363","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"13_CR22","first-page":"20","volume":"2","author":"SG Sedukhin","year":"1990","unstructured":"Sedukhin SG (1990) The designing and analysis of systolic algorithms and structures. Programming 2:20\u201340 (in Russian)","journal-title":"Programming"},{"key":"13_CR23","unstructured":"Toki\u0107 TI, Milovanovi\u0107 I\u017d, Randjelovi\u0107 DM, Milovanovi\u0107 EI (1998) Determining VLSI array size for one class of nested loop algorithms. In: Gudukbay V, Dagar T, Gursay A, Gelembe E (eds) Proc advances in computer and information sciences, Antalya\u201998, IOS Press, Amsterdam, 1998, pp 389\u2013396"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-9260(93)90011-Z","volume":"14","author":"R Varadarajan","year":"1993","unstructured":"Varadarajan R, Ravichandran B (1993) Refinement based techniques for mapping nested loop algorithms onto linear systolic arrays, INTEGRATION. VLSI J 14:249\u2013277","journal-title":"INTEGRATION. VLSI J"},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall S (1962) Theorem on Boolean matrices. J ACM 9:11\u201312","journal-title":"J ACM"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-0013-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-006-0013-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-0013-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:53Z","timestamp":1559384633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-006-0013-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,9]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,19]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s11227-006-0013-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,9]]}}}