{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:02:33Z","timestamp":1736514153344,"version":"3.32.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J VLSI Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1007\/bf02477177","type":"journal-article","created":{"date-parts":[[2006,8,11]],"date-time":"2006-08-11T02:26:05Z","timestamp":1155263165000},"page":"115-125","source":"Crossref","is-referenced-by-count":16,"title":["Scheduling a system of nonsingular affine recurrence equations onto a processor array"],"prefix":"10.1007","volume":"1","author":[{"given":"Yoav","family":"Yaacoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter R.","family":"Cappello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1989,10,1]]},"reference":[{"key":"BF02477177_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"Richard M. Karp","year":"1967","unstructured":"Richard M. Karp, Richard E. Miller, and Shmuel Winograd. The organization of computations for uniform recurrence equations.J. ACM, 14:563\u2013590, 1967.","journal-title":"J. ACM"},{"key":"BF02477177_CR2","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1137\/0114108","volume":"14","author":"Richard M. Karp","year":"1966","unstructured":"Richard M. Karp, Richard E. Miller, and Shmuel Winograd. Properties of a model for parallel computations: determinacy, termination, queueing.SIAM J. Appl. Math, 14:1390\u20131411, 1966.","journal-title":"SIAM J. Appl. Math"},{"key":"BF02477177_CR3","volume-title":"VLSI Architectures for Digital Signal Processing","author":"Peter R. Cappello","year":"1982","unstructured":"Peter R. Cappello.VLSI Architectures for Digital Signal Processing. PhD thesis, Princeton University, Princeton, NJ, Oct. 1982."},{"key":"BF02477177_CR4","doi-asserted-by":"crossref","unstructured":"Peter R. Cappello and Kenneth Steiglitz. Unifying VLSI array design with linear transformations of space-time. In F.P. Preparata, editor,Advances in Computing Research, pages 23\u201365, JAI Press, Inc., 1984.","DOI":"10.1117\/12.944011"},{"key":"BF02477177_CR5","unstructured":"Jean-Marc Delosme and Ilse C.F. Ipsen. An illustration of a methodology for the construction of efficient systolic architectures in VLSI.Proc. 2nd Int. Symp. on VLSI Technology, Systems and Applications, pages 268\u2013273, Taipei, 1985."},{"key":"BF02477177_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0743-7315(85)90029-2","volume":"2","author":"Jos\u00e9 A.B. Fortes","year":"1985","unstructured":"Jos\u00e9 A.B. Fortes and Dan I. Moldovan. Parallelism detection and algorithm transformation techniques useful for VLSI architecture design.J. Parallel Distrib. Comput, 2:277\u2013301, Aug. 1985.","journal-title":"J. Parallel Distrib. Comput"},{"key":"BF02477177_CR7","volume-title":"VLSI Array Processors","author":"Sun Yuan Kung","year":"1988","unstructured":"Sun Yuan Kung.VLSI Array Processors. Prentice-Hall, Englewood Cliffs, NJ, 1988."},{"key":"BF02477177_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02253685","volume":"32","author":"Willard L. Miranker","year":"1984","unstructured":"Willard L. Miranker and Andrew Winkler. Spactime representations of computational structures.Computing, 32:93\u2013114, 1984.","journal-title":"Computing"},{"key":"BF02477177_CR9","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TC.1982.1675929","volume":"C-31","author":"Dan I. Moldovan","year":"1982","unstructured":"Dan I. Moldovan. On the analysis of VLSI algorithms.IEEE Trans. Computers., C-31:1121\u20131126, Nov. 1982.","journal-title":"IEEE Trans. Computers."},{"issue":"1","key":"BF02477177_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"Dan I. Moldovan","year":"1983","unstructured":"Dan I. Moldovan. On the design of algorithms for VLSI systolic arrays.Proc. IEEE, 71(1):113\u2013120, Jan. 1983.","journal-title":"Proc. IEEE"},{"issue":"1","key":"BF02477177_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"Dan I. Moldovan","year":"1986","unstructured":"Dan I. Moldovan and Jos\u00e9 A.B. Fortes. Partitioning and mapping algorithms into fixed systolic arrays.IEEE Trans. Computers, C-35(1):1\u201312, Jan. 1986.","journal-title":"IEEE Trans. Computers"},{"key":"BF02477177_CR12","doi-asserted-by":"crossref","unstructured":"Patrice Quinton. Automatic synthesis of systolic arrays from uniform recurrent equations.Proc. 11th Ann. Symp. on Computer Architecture, pages 208\u2013214, 1984.","DOI":"10.1145\/800015.808184"},{"issue":"3","key":"BF02477177_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TC.1986.1676744","volume":"C-35","author":"I.V. Ramakrishnan","year":"1986","unstructured":"I.V. Ramakrishnan, D.S. Fussell, and A. Silberschatz. Mapping homogeneous graphs on linear arrays.IEEE Trans. Computers, C-35(3):189\u2013209, March 1986.","journal-title":"IEEE Trans. Computers"},{"key":"BF02477177_CR14","unstructured":"Sailash K. Rao.Regular Iterative Algorithms and Their Implementation on Processor Arrays. PhD thesis, Stanford University, Oct. 1985."},{"key":"BF02477177_CR15","unstructured":"Jos\u00e9 A.B. Fortes and E Parisi-Presicce. Optimal linear schedules for the parallel execution of algorithms.Int. Conf. on Parallel Processing, pages 322\u2013328, Aug. 1984."},{"key":"BF02477177_CR16","unstructured":"Jean-Marc Delosme and Ilse C.F. Ipsen.Systolic Array Synthesis: Computability and Time Cones. Technical Report Yale\/DCS\/RR-474, Yale, May 1986."},{"key":"BF02477177_CR17","unstructured":"Mathew T. O\u2019Keefe and Jos\u00e9 A.B. Fortes. A comparative study of two systematic design methodologies for systolic arrays.Proc. Int. Conf. Parallel Processing, 672\u2013675, Aug. 1986."},{"key":"BF02477177_CR18","doi-asserted-by":"crossref","unstructured":"Weija Shang and and Jos\u00e9 A.B. Fortes. Time optimal linear schedules for algorithms with uniform dependencies.Int. Conf. on Systolic Arrays, pages 393\u2013402, San Diego, May 1988.","DOI":"10.1109\/ARRAYS.1988.18079"},{"key":"BF02477177_CR19","volume-title":"Proc. Third Caltech Conf. on VLSI","author":"Charles E. Leiserson","year":"1983","unstructured":"Charles E. Leiserson, Flavio M. Rose, and James B. Saxe. Optimizing synchronous circuitry by retiming.Proc. Third Caltech Conf. on VLSI, Computer Science Press, Rockville, MD, 1983."},{"key":"BF02477177_CR20","doi-asserted-by":"crossref","unstructured":"Charles E. Leiserson and James B. Saxe. Optimizing synchronous systems.Proc. IEEE 22nd Annual Symp. Foundations of Computer Science, Oct. 1981.","DOI":"10.1109\/SFCS.1981.34"},{"key":"BF02477177_CR21","doi-asserted-by":"crossref","unstructured":"Yiwan Wong and Jean-Marc Delosme. Broadcast removal in systolic algorithms.Int. Conf on Systolic Arrays, pages 403\u2013412, San Diego, May 1988.","DOI":"10.1109\/ARRAYS.1988.18080"},{"key":"BF02477177_CR22","series-title":"Technical Report","volume-title":"Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations","author":"Yoav Yaacoby","year":"1988","unstructured":"Yoav Yaacoby and Peter R. Cappello.Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations. Technical Report 18, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988."},{"key":"BF02477177_CR23","series-title":"Technical Report","volume-title":"Decoupling the Dimensions of a System of Affine Recurrence Equations","author":"Yoav Yaacoby","year":"1988","unstructured":"Yoav Yaacoby and Peter R. Cappello.Decoupling the Dimensions of a System of Affine Recurrence Equations. Technical Report 12, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, April 1988."},{"key":"BF02477177_CR24","unstructured":"Gene H. Golub and Charles F. Van Loan.Matrix Computations. The Johns Hopkins University Press, 1983."},{"key":"BF02477177_CR25","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Christos H. Papadimitriou","year":"1982","unstructured":"Christos H. Papadimitriou and Kenneth Steiglitz.Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982."}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02477177.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02477177\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02477177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T12:16:40Z","timestamp":1736511400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02477177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["BF02477177"],"URL":"https:\/\/doi.org\/10.1007\/bf02477177","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}