{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:50Z","timestamp":1725663830772},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558958"},{"type":"electronic","value":"9783540473060"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55895-0_421","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:41:33Z","timestamp":1330252893000},"page":"265-270","source":"Crossref","is-referenced-by-count":2,"title":["Designing modular linear systolic arrays using dependence graph regular partitions"],"prefix":"10.1007","author":[{"given":"Jean-Fr\u00e9d\u00e9ric","family":"Myoupo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-C\u00e9cile","family":"Fabret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"31_CR1","unstructured":"A. V. Aho, J. Hopchoft and J. D. Ullman: The design and analysis of computer algorithms Addison-Wesley (1974)."},{"key":"31_CR2","unstructured":"A. Benaini and M. Tchuente: Matrix product on linear systolic arrays, in Parallel and Distributed Algorithms, M. Cosnard and al. eds, North Holland, (1989)."},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"A. L. Fischer and H. T. Kung: Synchronizing large VLSI processor arrays. Proc. Tenth Annual IEEE\/ACM Symposium on Computer Architecture, June 1983, PP. 54\u201358","DOI":"10.1145\/800046.801638"},{"key":"31_CR4","unstructured":"L. J. Guibas, H. T. Kung and C. D. Thompson: Direct VLSI implementation of combinatorial algorithms; Proc. Conference on very large Scale Integration: Architecture, Design, Fabrication; California Institute of Technology (January 1979) pp. 509\u2013525."},{"issue":"1","key":"31_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H. T. Kung","year":"1980","unstructured":"H. T. Kung: Why systolic architecture. IEEE Computer, 15(1) January, 1980, PP. 37\u201346","journal-title":"IEEE Computer"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"F. T. Leighton and C.E. Leiserson: Wafer-Scale integration of systolic arrays. Proc. Twenty-third Symp. Foundations of Computer Science, November 1982, PP. 297\u2013311.","DOI":"10.1109\/SFCS.1982.49"},{"key":"31_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00265150","volume":"27","author":"C. H. Huang","year":"1989","unstructured":"C. H. Huang and C. Langauer: An incremental mechanical development of systolic solutions to the algebraic path problem. Acta Informatica 27, (1989), 97\u2013124.","journal-title":"Acta Informatica"},{"key":"31_CR8","unstructured":"S. Y. Kung, P. S. Lewis and S. C. Lo: On optimal mapping algorithms to systolic arrays with application to the transitive closure problem, in Proc. 1986 IEEE Int. Symp. Circuits Syst., PP. 1316\u20131322."},{"key":"31_CR9","unstructured":"S. Y. Kung and S. C. Lo: A spiral systolic architecture algorithm for transitive closure problems, Proc. IEEE Int. Conf. Comput. Design, 1985."},{"issue":"No.5","key":"31_CR10","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TC.1987.1676945","volume":"C-36","author":"S. Y. Kung","year":"1987","unstructured":"S. Y. Kung, S. C. Lo and P. S. Lewis: Optimal systolic design for transitive closure and the shortest path problems; IEEE Trans. Comput. C-36, No. 5, 1987, PP. 603\u2013614.","journal-title":"IEEE Trans. Comput."},{"key":"31_CR11","first-page":"1578","volume":"C-37","author":"P. Lee","year":"1988","unstructured":"P. Lee and Z. Kedem: Synthesizing linear array algorithms from nested for loop algorithms. IEEE Trans. Comput., C-37 (1988), 1578\u20131598.","journal-title":"IEEE Trans. Comput."},{"key":"31_CR12","unstructured":"P. S. Lewis and S. Y. Kung: Dependence graph based design of systolic arrays for the algebraic path problem. Proc. 12 th ann. Asilomar Conf. Signals Syst., Com-put., 1986."},{"key":"31_CR13","unstructured":"F. C. Lin and Wu: Systolic arrays for transitive closure algorithms in Proc. Int. Symp.VLSI Syst. Designs, Taipei May 1985."},{"key":"31_CR14","first-page":"617","volume":"I","author":"J. F. Myoupo","year":"1990","unstructured":"J. F. Myoupo: A linear systolic array for transitive closure problems, Proc. Int. Conf. Parallel Process. (ICPP), 1990. Vol. I, PP. 617\u2013618.","journal-title":"Proc. Int. Conf. Parallel Process. (ICPP)"},{"key":"31_CR15","first-page":"575","volume":"I","author":"J. F. Myoupo","year":"1991","unstructured":"J. F. Myoupo: A way of deriving linear systolic arrays from a mathematical algorithm description: Case of the Warshall-Floyd Algorithm.Proc. Int. Conf. Parallel Process. (ICPP), 1991. Vol. I, PP. 575\u2013579.","journal-title":"Proc. Int. Conf. Parallel Process. (ICPP)"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"J. F. Myoupo and A.C. Fabret: Designing Modular Linear Systolic Arrays Using Dependence Graph Regular Partitions. Rapport Interne, L.R.I., Universit\u00e9 Paris-Sud, 1992.","DOI":"10.1007\/3-540-55895-0_421"},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/0743-7315(89)90030-0","volume":"7","author":"V. K. Prasanna Kumar","year":"1989","unstructured":"V. K. Prasanna Kumar and Y. C. Tsai: Designing linear systolic arrays. J. parallel distrib. Comput. 7 (1989), 441\u2013463.","journal-title":"J. parallel distrib. Comput."},{"issue":"No.3","key":"31_CR18","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1109\/12.21135","volume":"38","author":"S. K. Prasanna Kumar","year":"1989","unstructured":"S. K. Prasanna Kumar and Y. C. Tsai: On mapping algorithms to linear and fault-tolerant systolic srrays, IEEE Trans. Comput., vol. 38, No. 3 PP. 470\u2013478, 1989.","journal-title":"IEEE Trans. Comput."},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"I. V. Ramakrishnan, P. J. Varman: Dynamic programming and transitive closure on linear pipelines; Proc. Int. Conf. on Parallel Processing, (ICPP) 1984.","DOI":"10.21236\/ADA143527"},{"key":"31_CR20","unstructured":"I. V. Ramakrishnan and P. J. Varman: An Optimal Family of Matrix multiplication algorithms on linear arrays; ICPP (1985), IEEE press, pp.376\u2013383."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"I. V. Ramakrishnan and P. J. Varman: Synthesis of an optimal family of matrix multiplication algorithms on linear arrays; IEEE Trans. Computers, C-35(11), 1986.","DOI":"10.1109\/TC.1984.1676369"},{"key":"31_CR22","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF02309554","volume":"39","author":"Y. Robert","year":"1987","unstructured":"Y. Robert and D. Trystram: An orthogonal systolic array for the algebraic path problem.Computing, 39,PP. 187\u2013199, 1987.","journal-title":"Computing"},{"key":"31_CR23","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"G. Rote: A systolic array algorithm for the algebraic path problem; Computing; Vol. 34 PP. 192\u2013219, 1985.","journal-title":"Computing"},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0743-7315(89)90050-6","volume":"7","author":"U. Schwiegelshohn","year":"1989","unstructured":"U. Schwiegelshohn and L. Thiele: Linear systolic arrays for matrix computation. J. parallel distrib. Comput. 7 (1989), 28\u201339.","journal-title":"J. parallel distrib. Comput."},{"key":"31_CR25","unstructured":"T. Risset: Linear systolic arrays for matrix multiplication: Comparison of existing synthesis methods and new results; Tech. Repport, No. 91\u201312 LIP, Ecole Normale Sup\u00e9rieure de Lyon, 1991."},{"key":"31_CR26","unstructured":"J. D. Ullman Computational aspects of VLSI, Computer Science Press (1984)."},{"key":"31_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0167-6423(86)90005-5","volume":"7","author":"J. L. A. A. Snepscheut Van de","year":"1986","unstructured":"J. L. A. Van de Snepscheut: A derivation of a distributed implementation of Warshall's algorithm. Science of Computer Programming 7 (1986), 55\u201360.","journal-title":"Science of Computer Programming"},{"issue":"No.4","key":"31_CR28","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"S. W. Warman Jr.","year":"1975","unstructured":"S. W. Warman, Jr.: A modification of Warshall's algorithm for the transitive closure of binary relations; CACM. Vol. 18 No. 4 PP. 218\u2013220, 1975.","journal-title":"CACM."},{"issue":"No.1","key":"31_CR29","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1972","unstructured":"S. Warshall: A theorem on boolean matrices; JACM, Vol. 9 No. 1 PP. 11\u201312, 1972.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 92\u2014VAPP V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55895-0_421.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:00Z","timestamp":1605646920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55895-0_421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558958","9783540473060"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-55895-0_421","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}