{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:30:01Z","timestamp":1743111001136,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539513"},{"type":"electronic","value":"9783540464785"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bfb0032956","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:53:45Z","timestamp":1133416425000},"page":"402-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mapping systolic algorithms on distributed memory computers"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Clauss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00264230","volume":"22","author":"N. Chiba","year":"1985","unstructured":"N. Chiba, K. Onoguchi and T. Nishizeki, Drawing plane graphs nicely, Acta Informatica 22, pages 187\u2013201, 1985.","journal-title":"Acta Informatica"},{"key":"40_CR2","unstructured":"Choo Y., Chen M.C., A theory of program optimization, TR-608, Yale Univ., 1988."},{"key":"40_CR3","unstructured":"Clauss Ph., Synth\u00e8se d'algorithmes systoliques et implantation optimale en place sur r\u00e9seaux de processeurs synchrones, Th\u00e8se Univ. Franche-Comt\u00e9 (France), 1990."},{"key":"40_CR4","volume-title":"An illustration of a methodology for the construction of efficient systolic architectures in VLSI","author":"J.M. Delosme","year":"1985","unstructured":"Delosme J.M., Ipsen I.C.F., An illustration of a methodology for the construction of efficient systolic architectures in VLSI, Int. Symp. on VLSI Technology, Taipei, 1985."},{"key":"40_CR5","unstructured":"Delosme J.M., A parallel algorithm for the algebraic path problem, Int. Workshop on Parallel and distributed Algorithms, North-Holland, 1988."},{"key":"40_CR6","unstructured":"Fortes J.A.B., Fu K.S., Wah B.W., Systematic approaches to the design of algorithmically specified systolic arrays, Int. Conf. on Acoustics, 1987."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"J. Hopcroft and R. Tarjan, Efficient planarity testing, JACM, Vol 21, 4, October 74, pages 549\u2013568.","DOI":"10.1145\/321850.321852"},{"key":"40_CR8","first-page":"3","volume":"14","author":"R.M. Karp","year":"1967","unstructured":"Karp R.M., Miller R.E., Winograd S., The organization of computations for uniform recurrence equations, JACM, 14, 3, 1967.","journal-title":"JACM"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H.T. Kung","year":"1982","unstructured":"Kung H.T., Why systolic architectures?, Computer, 15, 1, 1982.","journal-title":"Computer"},{"key":"40_CR10","first-page":"5","volume":"36","author":"S.Y. Kung","year":"1987","unstructured":"Kung S.Y., Lo S.C., Lewis P.S., Optimal systolic design for the transitive closure and the shortest path problem, IEEE Trans. Computers, C-36, 5, 1987.","journal-title":"IEEE Trans. Computers, C-"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"D.I Moldovan","year":"1983","unstructured":"Moldovan D.I, On the design of algorithms for VLSI systolic arrays, IEEE, 71, 1, 1983.","journal-title":"IEEE"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"35","author":"D.I. Moldovan","year":"1986","unstructured":"Moldovan D.I., Fortes J.A.B., Partitioning and mapping algorithms into fixed size systolic arrays, IEEE Trans. on Computers, 35, 1, 1986.","journal-title":"IEEE Trans. on Computers"},{"key":"40_CR13","unstructured":"Mongenet C., Une m\u00e9thode de conception d'algorithmes systoliques, Th\u00e8se INPL, Nancy (France), 1985."},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Mongenet C., Perrin G.R., Synthesis of systolic arrays for inductive problems, PARLE, Lect. Notes in Comp. Sc., 259, 1987.","DOI":"10.1007\/3-540-17943-7_133"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Quinton P., Automatic syntheses of systolic arrays from uniform recurrence equations, IEEE Symp. on Computer Architectures, 1984.","DOI":"10.1145\/800015.808184"},{"key":"40_CR16","doi-asserted-by":"crossref","unstructured":"Quinton P., Van Dongen V., The mapping of linear recurrence equations on regular arrays, Journal of VLSI Signal processing, 1, 1989.","DOI":"10.1007\/BF02477176"},{"key":"40_CR17","volume-title":"Systolic solution of the algebraic path problem, Int. Workshop on systolic arrays","author":"Y. Robert","year":"1987","unstructured":"Robert Y., Trystram D., Systolic solution of the algebraic path problem, Int. Workshop on systolic arrays, Oxford, Adam-Hilger, 1987."},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Rote G., A systolic array algorithm for the algebraic path problem, Computing, 34, 1985.","DOI":"10.1007\/BF02253318"},{"key":"40_CR19","unstructured":"Yaacobi Y., Cappello P.R., Scheduling a system of affine recurrence equations onto a systolic array, Int. Conf. on systolic arrays, San Diego, 1988."},{"key":"40_CR20","unstructured":"Y. Wong and J.-M. Delosme, Optimization of processor count for systolic arrays, research report YALEU\/DCS\/RR-697, May 1989."}],"container-title":["Lecture Notes in Computer Science","Distributed Memory Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T11:18:10Z","timestamp":1634296690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0032956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539513","9783540464785"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032956","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"17 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}