{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:22:37Z","timestamp":1755220957062,"version":"3.43.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Supercomputing"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1023\/a:1011136427062","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T03:43:03Z","timestamp":1040614983000},"page":"41-56","source":"Crossref","is-referenced-by-count":3,"title":["Design of Processor Arrays for Reconfigurable Architectures"],"prefix":"10.1007","volume":"19","author":[{"given":"Dirk","family":"Fimmel","sequence":"first","affiliation":[]},{"given":"Renate","family":"Merker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"333397_CR1","doi-asserted-by":"crossref","unstructured":"J. Bu, E. Deprettere, and P. Dewild. A design methodology for fixed-size systolic arrays. In Proc. IEEE Int. Conf. on Application Specfic Array Processors. pp. 591-602, 1990.","DOI":"10.1109\/ASAP.1990.145495"},{"key":"333397_CR2","doi-asserted-by":"crossref","unstructured":"W. Chou and S. Kung. Scheduling partitioned algorithms on processor arrays with Limited Communication Support. In Proc. IEEE Int. Conf. on Application Specific Systems, Architectures and Processors'93. Venice, pp. 53-64, 1993.","DOI":"10.1109\/ASAP.1993.397120"},{"key":"333397_CR3","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1109\/71.298207","volume":"5","author":"A. Darte","year":"1994","unstructured":"A. Darte and Y. Robert. Constructive methods for scheduling uniform loop nests. IEEE Trans. on Parallel and Distributed Systems 5:814-822, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"333397_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-9260(95)00022-4","volume":"20","author":"M. Dion","year":"1996","unstructured":"M. Dion, T. Risset, and Y. Robert. Resource constraint scheduling of partitioned algorithms on processor arrays. Integration, the VLSI Journal 20:139-159, 1996.","journal-title":"Integration, the VLSI Journal"},{"key":"333397_CR5","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/43.739055","volume":"18","author":"U. Eckhard","year":"1999","unstructured":"U. Eckhard and R. Merker. Hierarchical Algorithm Partitioning at System Level for an Improved Utilization of Memory Structures. IEEE Trans. on CAD 18, 14-24, 1999.","journal-title":"IEEE Trans. on CAD"},{"key":"333397_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF03356744","volume":"24","author":"A. Eichenberger","year":"1996","unstructured":"A. Eichenberger, E. Davidson, and S. Abraham. Minimizing Register Requirements of a Modulo Schedule via optimum stae scheduling. International Journal of Parallel Programming 24:103-132, 1996.","journal-title":"International Journal of Parallel Programming"},{"key":"333397_CR7","first-page":"313","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"P. Feautrier. Some eficient solutions to the afine scheduling problem, part I, one-dimensional time, Int. Journal of Parallel Computing 21:313-348, 1992.","journal-title":"Int. Journal of Parallel Computing"},{"key":"333397_CR8","doi-asserted-by":"crossref","unstructured":"P. Feautrier. Fine-grain scheduling under resource constraints. In Proc. 7th Int. Workshop on Languages and Compilers for Parallel Computing. Ithaca, New York, pp. 1-15, 1994.","DOI":"10.1007\/BFb0025867"},{"key":"333397_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1109\/43.748156","volume":"18","author":"J. Fernando","year":"1999","unstructured":"J. Fernando and J.-N. Jean. Processor Array Design with FPGA Area Constraint. IEEE Trans. on Computer Aided Design 18:253-264, 1999.","journal-title":"IEEE Trans. on Computer Aided Design"},{"key":"333397_CR10","doi-asserted-by":"crossref","unstructured":"D. Fimmel. Generation of scheduling functions supporting LSGP-partitioning. In Proc. IEEE Int. Conf. on Application Specfic Systems, Architectures and Processors'00. Boston, pp. 349-358, 2000.","DOI":"10.1109\/ASAP.2000.862405"},{"key":"333397_CR11","doi-asserted-by":"crossref","unstructured":"D. Fimme and R. Merker. Determination of the Processor Functionally in the Design of Processor Arrays. In Proc. IEEE Int. Conf. on Application Specfic Systems, Architectures and Processors'97. Z\u00fcrich, pp. 199-208, 1997.","DOI":"10.1109\/ASAP.1997.606826"},{"key":"333397_CR12","doi-asserted-by":"crossref","unstructured":"D. Fimmel, and R. Merker. Design of Processor Arrays for Real-time Applications. In Proc. Int. Conf. Euro-par'98. Southampton, pp. 1018-1028, 1998a.","DOI":"10.1007\/BFb0057962"},{"issue":"3-4","key":"333397_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0141-9331(98)00074-X","volume":"22","author":"D. Fimmel","year":"1998","unstructured":"D. Fimmel and R. Merker. Determination of Processor Allocation in the Design of Processor Arrays. Microprocessors and Microsystems 22(3-4), 149-155, 1998b.","journal-title":"Microprocessors and Microsystems"},{"key":"333397_CR14","volume-title":"High-Level Synthesis, Introduction to Chip and System Design","author":"D. Gajski","year":"1992","unstructured":"D. Gajski, N. Dutt, A. Wu, and S. Lin. High-Level Synthesis, Introduction to Chip and System Design. Boston\/Dordrecht\/London: Kluwer Academic Publishers, 1992."},{"key":"333397_CR15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-1-4615-2762-6_2","volume-title":"VLSI Design methodologies for Digital Signal Processing Architectures","author":"C. Gebotys","year":"1994","unstructured":"C. Gebotys. VLSI Design methodologies for Digital Signal Processing Architectures, Chapt. Synthesizing Optimal Application-Specfic DSP Architectures, pp. 43-92. Boston\/Dordrecht\/London: Kluwer Academic Publishers, M.A. Bayoumi edition, 1994.","edition":"M.A. Bayoumi ed"},{"issue":"4","key":"333397_CR16","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1109\/43.75629","volume":"10","author":"C.-T. Hwang","year":"1991","unstructured":"C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu. A Formal Approach to the Scheduling Problem in High-Level Synthesis. IEEE Trans. on Computer-Aided Design 10(4), 464-474, 1991.","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"333397_CR17","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. Karp","year":"1967","unstructured":"R. Karp, R. Miller, and S. Winograd. The Oranization of Computations for Uniform Recurrence Equations. Journal of the ACM 14, 563-590, 1967.","journal-title":"Journal of the ACM"},{"key":"333397_CR18","volume-title":"VLSI Array Processors","author":"S. Kung","year":"1987","unstructured":"S. Kung. VLSI Array Processors. Englewood Cliffs: Prentice Hall, 1987."},{"key":"333397_CR19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/71.80125","volume":"1","author":"P. Lee","year":"1990","unstructured":"P. Lee and Z. Kedem. Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays. IEEE Trans. on Parallel and Distributed Systems 1, 64-76, 1990.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"333397_CR20","first-page":"66","volume":"34","author":"G. Li","year":"1985","unstructured":"G. Li and B. Wah. The Design of Optimal Systolic Arrays. IEEE Trans. on Computers 34, 66-77, 1985.","journal-title":"IEEE Trans. on Computers"},{"key":"333397_CR21","unstructured":"G. Megson. An Introduction to Systolic Algorithm Design. Oxford Science Publications, 1992."},{"key":"333397_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"35","author":"D. Moldovan","year":"1986","unstructured":"D. Moldovan, and J. Fortes. Partitioning and Mapping Algorithms into Fixed Sized Systolic Arrays. IEEE Transactions on Computers 35, 1-12, 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"333397_CR23","doi-asserted-by":"crossref","unstructured":"Q. Ning and G. Gao. A Novel Framework of Register Allocation for Software Pipelining. In Proceedings of the 20th Annual Symposium on Principals of Programming Languages POPL93. Charleston, SC, USA, pp. 29-42, 1993.","DOI":"10.1145\/158511.158519"},{"key":"333397_CR24","unstructured":"P. Quinton. Automata Networks in Computer Science, Chapt. The Systematic Design of Systolic Arrays, pp. 229-260. Manchester University Press, 1987."},{"key":"333397_CR25","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/3-540-17179-7_30","volume":"241","author":"S. Rajopadhye","year":"1986","unstructured":"S. Rajopadhye, S. Purushothaman, and R. Fujimoto. On Synthesizing Systolic Arrays from Recurrence Equations with Linear Dependencies. In Proc. of the 6th Conf. Foundations of Software Technology and Theoretical Computer Science, Vol. 241. New Delhi, pp. 488-503, 1986.","journal-title":"Proc. of the 6th Conf. Foundations of Software Technology and Theoretical Computer Science"},{"key":"333397_CR26","unstructured":"S. Rao, Regular Iterative Algorithms and their Implementations on Processor Arrays. Ph.D. thesis, Stanford University, 1985."},{"key":"333397_CR27","doi-asserted-by":"crossref","unstructured":"J. Rossel, F. Catthoor, and H. de Man. Extensions to Linear Mapping for Regular Arrays with Complex Processing Elements. In Proc. Int. Conf. on Application Specfic Array Processors. Princeton, New Jersey, pp. 156-167, 1990.","DOI":"10.1109\/ASAP.1990.145452"},{"key":"333397_CR28","volume-title":"Theory of Integer and Linear Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver, Theory of Integer and Linear Programming. New York: John Wiley & Sons, 1986."},{"key":"333397_CR29","doi-asserted-by":"crossref","unstructured":"M. Schwiegershausen, M. Sch\u00f6nfeld, and P. Pirsch. Mapping Complex Image Processing Algorithms onto Heterogenous Multiprocessors Regarding Architecture Dependent Performance Parameters. In Proc. Int. Workshop of Algorithms and Parallel VLSI Architectures III. pp. 353-364, 1994.","DOI":"10.1016\/B978-044482106-5\/50031-4"},{"key":"333397_CR30","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/12.90251","volume":"40","author":"W. Shang","year":"1991","unstructured":"W. Shang and J. Fortes. Time Optimal Linear Schedules for Algorithms with Uniform Dependencies. IEEE Transactions on Computers 40, 723-742, 1991.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"333397_CR31","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0167-9260(93)90013-3","volume":"14","author":"J. Teich","year":"1993","unstructured":"J. Teich, and L. Thiele. Partitioning of Processor Arrays: a Piecewise Regular Approach. Integration, the VLSI Journal 14(2), 297-332, 1993.","journal-title":"Integration, the VLSI Journal"},{"issue":"1","key":"333397_CR32","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1007935215591","volume":"17","author":"J. Teich","year":"1997","unstructured":"J. Teich, L. Thiele, and L. Zhang. Scheduling of Partitioned Regular Algorithms on Processor Arrays with Constrained Ressources. J. on VLSI and Signal Processing 17(1), 5-20, 1997.","journal-title":"J. on VLSI and Signal Processing"},{"key":"333397_CR33","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4615-3506-5_4","volume-title":"The State of the Art in Computer Systems and Software Engineering","author":"L. Thiele","year":"1992","unstructured":"L. Thiele. The State of the Art in Computer Systems and Software Engineering, Chapt. Compiler Techniques for Massive parallel Architectures, pp. 101-151. Boston: Kluwer Academic Publishers, p. dewilde edition, 1992.","edition":"p. dewilde edit"},{"key":"333397_CR34","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02120034","volume":"10","author":"L. Thiele","year":"1995","unstructured":"L. Thiele. Resource Constrained Scheduling of Uniform Algorithms. Int. Journal on VLSI and Signal Processing 10, 295-310, 1995.","journal-title":"Int. Journal on VLSI and Signal Processing"},{"key":"333397_CR35","unstructured":"Y. Wong and J. Delosme. Optimal Systolic Implementation of n-dimensional Recurrences. In Proc. ICCD. pp. 618-621, 1985."},{"key":"333397_CR36","unstructured":"XILINX: 1994, The Programmable Data Book."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011136427062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011136427062\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011136427062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:19:59Z","timestamp":1754630399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011136427062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["333397"],"URL":"https:\/\/doi.org\/10.1023\/a:1011136427062","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}