{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:42:04Z","timestamp":1736538124428,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377832"},{"type":"electronic","value":"9783540377849"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823285_125","type":"book-chapter","created":{"date-parts":[[2006,9,5]],"date-time":"2006-09-05T18:04:04Z","timestamp":1157479444000},"page":"1181-1191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Realization of Data Dependencies in Algorithm Partitioning Under Resource Constraints"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Siegel","sequence":"first","affiliation":[]},{"given":"Renate","family":"Merker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"125_CR1","unstructured":"Motomura, M.: A Dynamically Reconfigurable Processor Architecture. In: Microprocessor Forum (2002)"},{"key":"125_CR2","doi-asserted-by":"crossref","unstructured":"Duller, A., Towner, D., Panesar, G., Gray, A., Robbins, W.: picoArray Technology: The Tool\u2019s Story. In: Design, Automation and Test in Europe (DATE 2005), vol.\u00a03, pp. 106\u2013111 (2005)","DOI":"10.1109\/DATE.2005.239"},{"key":"125_CR3","doi-asserted-by":"crossref","unstructured":"Siegel, S., Merker, R.: Optimized Data-Reuse in Processor Arrays. In: Proc. IEEE Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP 2004), pp. 315\u2013325 (2004)","DOI":"10.1109\/ASAP.2004.1342481"},{"issue":"3","key":"125_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R.M. Karp","year":"1967","unstructured":"Karp, R.M., Miller, R.E., Winograd, S.: The organisation of computations for uniform recurrence equations. JACM\u00a014(3), 563\u2013590 (1967)","journal-title":"JACM"},{"key":"125_CR5","doi-asserted-by":"crossref","unstructured":"Siegel, S., Merker, R.: Algorithm Partitioning including Optimized Data-Reuse for Processor Arrays. In: Proc. IEEE International Conference on Parallel Computing in Electrical Engineering (PARELEC 2004) pp. 85\u201390 (2004)","DOI":"10.1109\/PCEE.2004.1335593"},{"key":"125_CR6","doi-asserted-by":"crossref","unstructured":"Derrien, S., Rajopadhye, S., Sur-Kolay, S.: Combining Instruction and Loop Level Parallelism for Array Synthesis on FPGAs. In: International Symposium on System Synthesis (2001)","DOI":"10.1145\/500001.500039"},{"key":"125_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0025867","volume-title":"Languages and Compilers for Parallel Computing","author":"P. Feautrier","year":"1995","unstructured":"Feautrier, P.: Fine-grain Scheduling under Resource Constraints. In: Pingali, K.K., Gelernter, D., Padua, D.A., Banerjee, U., Nicolau, A. (eds.) LCPC 1994. LNCS, vol.\u00a0892, pp. 1\u201315. Springer, Heidelberg (1995)"},{"key":"125_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02120034","volume":"10","author":"L. Thiele","year":"1995","unstructured":"Thiele, L.: Resource constraint scheduling of uniform algorithms. Journal of VLSI Signal Processing\u00a010, 295\u2013310 (1995)","journal-title":"Journal of VLSI Signal Processing"},{"key":"125_CR9","unstructured":"Teich, J., Thiele, L.: A New Approach to Solving Resource-Constrained Scheduling Problems based on a Flow-Model. Technical Report\u00a017, TIK, Swiss Federal Institute of Technology (ETH) Z\u00fcrich (1996)"},{"key":"125_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0167-9260(95)00022-4","volume":"20","author":"M. Dion","year":"1996","unstructured":"Dion, M., Risset, T., Robert, Y.: Resource-constrained scheduling of partitioned algorithms on processor arrays. Integration, the VLSI Journal\u00a020, 139\u2013159 (1996)","journal-title":"Integration, the VLSI Journal"},{"key":"125_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-48311-X_52","volume-title":"Euro-Par\u201999 Parallel Processing","author":"D. Fimmel","year":"1999","unstructured":"Fimmel, D., Merker, R.: Localization of Data Transfer in Processor Arrays. In: Amestoy, P.R., Berger, P., Dayd\u00e9, M., Duff, I.S., Frayss\u00e9, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol.\u00a01685, pp. 401\u2013408. Springer, Heidelberg (1999)"},{"key":"125_CR12","unstructured":"Eisenbeis, C., Sawaya, A.: Optimal loop parallelization under register constraints. Technical Report 2781, INRIA (1996)"},{"key":"125_CR13","doi-asserted-by":"crossref","unstructured":"M\u00fcller, J., Fimmel, D., Merker, R.: Optimal Loop Scheduling with Register Constraints Using Flow Graphs. In: Proc. of the 7th Int. Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), Hong Kong, China (2004)","DOI":"10.1109\/ISPAN.2004.1300478"},{"key":"125_CR14","unstructured":"Fimmel, D.: Optimaler Entwurf paralleler Rechenfelder unter Verwendung ganzzahliger linearer Optimierung. PhD thesis, Dresden University of Technology, Institute of Circuits and Systems (2002)"},{"key":"125_CR15","doi-asserted-by":"crossref","unstructured":"Siegel, S., Merker, R.: Minimum Cost for Channels and Registers in Processor Arrays by Avoiding Redundancy. In: IEEE 17th Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP 2006) (2006)","DOI":"10.1109\/ASAP.2006.46"},{"key":"125_CR16","doi-asserted-by":"crossref","unstructured":"Siegel, S., Merker, R.: Optimal Realization of Uniform Data Dependencies in Algorithm Partitioning Under Resource Constraints. Technical report, Dresden University of Technology, Institute of Circuits and Systems (2006), http:\/\/www.iee.et.tu-dresden.de\/~siegel\/paper\/SM06a.pdf","DOI":"10.1007\/11823285_125"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2006 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823285_125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T19:26:06Z","timestamp":1736537166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823285_125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377832","9783540377849"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11823285_125","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}