{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:04:27Z","timestamp":1743073467250,"version":"3.40.3"},"publisher-location":"Dordrecht","reference-count":48,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9789048134847"},{"type":"electronic","value":"9789048134854"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-90-481-3485-4_10","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T18:47:34Z","timestamp":1265741254000},"page":"199-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["ReCoNodes\u2014Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices"],"prefix":"10.1007","author":[{"given":"Ali","family":"Ahmadinia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Angermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Kamphans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mateusz","family":"Majer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nils","family":"Schweer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Teich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Tessars","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan C.","family":"van\u00a0der Veen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"unstructured":"Ahmadinia, A., Teich, J.: Speeding up online placement for XILINX FPGAs by reducing configuration overhead. In: Proc. IFIP Internat. Conf. VLSI-SOC, pp. 118\u2013122 (2003)","key":"10_CR1"},{"doi-asserted-by":"crossref","unstructured":"Ahmadinia, A., Bobda, C., Bednara, M., Teich, J.: A new approach for on-line placement on reconfigurable devices. In: Proc. Internat. Parallel Distr. Proc. Sympos., p. 134 (2004)","key":"10_CR2","DOI":"10.1109\/IPDPS.2004.1303104"},{"doi-asserted-by":"crossref","unstructured":"Ahmadinia, A., Bobda, C., Fekete, S., Teich, J., van\u00a0der Veen, J.: Optimal routing-conscious dynamic placement for reconfigurable devices. In: Internat. Conf. Field-Programm. Logic Appl., pp. 847\u2013851 (2004)","key":"10_CR3","DOI":"10.1007\/978-3-540-30117-2_87"},{"doi-asserted-by":"crossref","unstructured":"Ahmadinia, A., Bobda, C., Ding, J., Majer, M., Teich, J., Fekete, S., van\u00a0der Veen, J.: A\u00a0practical approach for circuit routing on dynamically reconfigurable devices. In: Proc. 16th IEEE Internat. Workshop Rapid System Prototyping (RSP), pp. 84\u201390 (2005)","key":"10_CR4","DOI":"10.1109\/RSP.2005.7"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"B.S. Baker","year":"1983","unstructured":"Baker, B.S., Schwarz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM J.\u00a0Comput. 12(3), 508\u2013525 (1983)","journal-title":"SIAM J.\u00a0Comput."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/54.825678","volume":"17","author":"K. Bazargan","year":"2000","unstructured":"Bazargan, K., Kastner, R., Sarrafzadeh, M.: Fast template placement for reconfigurable computing systems. IEEE Des. Test Comput. 17, 68\u201383 (2000)","journal-title":"IEEE Des. Test Comput."},{"doi-asserted-by":"crossref","unstructured":"Becker, T., Luk, W., Cheung, P.Y.: Enhancing relocatability of partial bitstreams for run-time reconfiguration. In: Proc. 15th Annu. Sympos. Field-Programm. Custom Comput. Mach., pp. 35\u201344 (2007)","key":"10_CR7","DOI":"10.1109\/FCCM.2007.51"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/S0097539701389956","volume":"35","author":"M.A. Bender","year":"2005","unstructured":"Bender, M.A., Demaine, E.D., Farach-Colton, M.: Cache-oblivious B-trees. SIAM J. Comput. 35, 341\u2013358 (2005)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Bender, M.A., Fineman, J.T., Gilbert, S., Kuszmaul, B.C.: Concurrent cache-oblivious B-trees. In: Proc. 17th Annu. ACM Sympos. Parallel. Algor. Architect., pp. 228\u2013237 (2005)","key":"10_CR9","DOI":"10.1145\/1073970.1074009"},{"doi-asserted-by":"crossref","unstructured":"Bobda, C., Ahmadinia, A., Majer, M., Teich, J., Fekete, S., van\u00a0der Veen, J.: DyNoC: A dynamic infrastructure for communication in dynamically reconfigurable devices. In: Internat. Conf. Field-Programmable Logic and Applications, pp. 153\u2013158 (2005)","key":"10_CR10","DOI":"10.1109\/FPL.2005.1515715"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00288539","volume":"14","author":"G. Bromley","year":"1980","unstructured":"Bromley, G.: Memory fragmentation in buddy methods for dynamic storage allocation. Acta Inform. 14, 107\u2013117 (1980)","journal-title":"Acta Inform."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/ijoc.1040.0083","volume":"17","author":"A. Caprara","year":"2005","unstructured":"Caprara, A., Salazar-Gonzalez, J.J.: Laying out sparse graphs with provably minimum bandwidth. INFORMS J.\u00a0Comput. 17, 356\u2013373 (2005)","journal-title":"INFORMS J.\u00a0Comput."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TVLSI.2002.1043324","volume":"10","author":"K. Compton","year":"2002","unstructured":"Compton, K., Li, Z., Cooley, J., Knol, S., Hauck, S.: Configuration relocation and defragmentation for run-time reconfigurable systems. IEEE Trans. VLSI 10, 209\u2013220 (2002)","journal-title":"IEEE Trans. VLSI"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1049\/ip-cdt:20000485","volume":"147","author":"O. Diessel","year":"2000","unstructured":"Diessel, O., ElGindy, H., Middendorf, M., Schmeck, H., Schmidt, B.: Dynamic scheduling of tasks on partially reconfigurable FPGAs. IEEE Proc. Comput. Dig. Tech. 147, 181\u2013188 (2000)","journal-title":"IEEE Proc. Comput. Dig. Tech."},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S.P. Fekete","year":"2001","unstructured":"Fekete, S.P., Schepers, J.: New classes of lower bounds for the bin packing problem. Math. Program. 91, 11\u201331 (2001)","journal-title":"Math. Program."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/moor.1030.0079","volume":"29","author":"S.P. Fekete","year":"2004","unstructured":"Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Math. Oper. Res. 29, 353\u2013368 (2004)","journal-title":"Math. Oper. Res."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S.P. Fekete","year":"2004","unstructured":"Fekete, S.P., Schepers, J.: A general framework for bounds for higher-dimensional orthogonal packing problems. Math. Methods Oper. Res. 60, 311\u2013329 (2004)","journal-title":"Math. Methods Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., K\u00f6hler, E., Teich, J.: Optimal FPGA module placement with temporal precedence constraints. In: Proc. Design Automat. Test Europe (DATE), pp. 658\u2013665 (2001)","key":"10_CR18","DOI":"10.1109\/DATE.2001.915093"},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., van der Veen, J.C., Majer, M., Teich, J.: Minimizing communication cost for reconfigurable slot modules. In: Proceedings of 16th International Conference on Field Programmable Logic and Applications (FPL06), pp. 535\u2013540 (2006)","key":"10_CR19","DOI":"10.1109\/FPL.2006.311263"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/opre.1060.0369","volume":"55","author":"S.P. Fekete","year":"2007","unstructured":"Fekete, S.P., Schepers, J., van\u00a0der Veen, J.: An exact algorithm for higher-dimensional orthogonal packing. Oper. Res. 55, 569\u2013587 (2007)","journal-title":"Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Kamphans, T., Schweer, N., Tessars, C., van der Veen, J.C., Angermeier, J., Koch, D., Teich, J.: No-break dynamic defragmentation of reconfigurable devices. In: Proc. 18th Internat. Conf. Field Programm. Logic Appl., pp. 113\u2013118 (2008)","key":"10_CR21","DOI":"10.1109\/FPL.2008.4629917"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.1109\/TVLSI.2008.2000677","volume":"16","author":"S.P. Fekete","year":"2008","unstructured":"Fekete, S.P., van der Veen, J.C., Ahmadinia, A., G\u00f6hringer, D., Majer, M., Teich, J.: Offline and online aspects of defragmenting the module layout of a partially reconfigurable device. IEEE Trans. VLSI 16, 1210\u20131219 (2008)","journal-title":"IEEE Trans. VLSI"},{"doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Kamphans, T., Schweer, N.: Online square packing. In: Proc. 20th Algorithms and Data Structure Symposium (WADS), Banff, Alberta, Canada, pp.\u00a0302\u2013314","key":"10_CR23","DOI":"10.1007\/978-3-642-03367-4_27"},{"key":"10_CR24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"unstructured":"Gericota, M.G., Alves, G.R., Silva, M.L., Ferreira, J.M.: Run-time defragmentation for dynamically reconfigurable hardware. In: New Algorithms, Architectures and Applications for Reconfigurable Computing (2005)","key":"10_CR25"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","volume":"12","author":"M. Gr\u00f6tschel","year":"1980","unstructured":"Gr\u00f6tschel, M.: On the symmetric travelling salesman problem: solution of a 120-city problem. Math. Program. Study 12, 61\u201377 (1980)","journal-title":"Math. Program. Study"},{"doi-asserted-by":"crossref","unstructured":"Hagemeyer, J., Kettelhoit, B., Koester, M., Porrmann, M.: Design of homogeneous communication infrastructures for partially reconfigurable FPGAs. In: Proc. Internat. Conf. Engineering of Reconf. Systems and Algor., Las Vegas, USA (2007)","key":"10_CR27","DOI":"10.1109\/FPL.2007.4380668"},{"key":"10_CR28","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/362375.362392","volume":"16","author":"D.S. Hirschberg","year":"1973","unstructured":"Hirschberg, D.S.: A class of dynamic memory allocation algorithms. Commun. ACM 16, 615\u2013618 (1973)","journal-title":"Commun. ACM"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/365628.365655","volume":"8","author":"K.C. Knowlton","year":"1965","unstructured":"Knowlton, K.C.: A fast storage allocator. Commun. ACM 8, 623\u2013625 (1965)","journal-title":"Commun. ACM"},{"key":"10_CR30","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn. vol. 1, Addison\u2013Wesley, Reading (1997)","edition":"3"},{"doi-asserted-by":"crossref","unstructured":"Koch, D., Ahmadinia, A., Bobda, C., Kalte, H.: FPGA architecture extensions for preemptive multitasking and hardware defragmentation. In: Proc. IEEE Internat. Conf. Field-Programmable Technology, Brisbane, Australia, pp. 433\u2013436 (2004)","key":"10_CR31","DOI":"10.1109\/FPT.2004.1393318"},{"doi-asserted-by":"crossref","unstructured":"Koch, D., Beckhoff, C., Teich, J.: ReCoBusBuilder\u2014a novel tool and technique to build static and dynamically reconfigurable systems for FPGAs. In: Proc. 18th Internat. Conf. Field Programm. Logic Appl., pp. 119\u2013124 (2008)","key":"10_CR32","DOI":"10.1109\/FPL.2008.4629918"},{"key":"10_CR33","first-page":"41","volume":"240","author":"M. Koester","year":"2007","unstructured":"Koester, M., Kalte, H., Porrmann, M., Ruckert, U.: Defragmentation algorithms for partially reconfigurable hardware. Int. Fed. Inf. Process. Publ.-IFIP 240, 41 (2007)","journal-title":"Int. Fed. Inf. Process. Publ.-IFIP"},{"key":"10_CR34","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TCAD.2006.884574","volume":"26","author":"I. Kuon","year":"2007","unstructured":"Kuon, I., Rose, J.: Measuring the gap between FPGAs and ASICs. IEEE Trans. CAD Integr. Circuits Syst. 26, 203\u2013215 (2007)","journal-title":"IEEE Trans. CAD Integr. Circuits Syst."},{"key":"10_CR35","series-title":"Handbooks in Operations Research and Management","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory. Handbooks in Operations Research and Management, vol.\u00a04, pp. 445\u2013522. North\u2013Holland, Amsterdam (1993)"},{"doi-asserted-by":"crossref","unstructured":"Lysaght, P., Blodget, B., Mason, J., Young, J., Bridgford, B.: Invited paper: Enhanced architecture, design methodologies and CAD tools for dynamic reconfiguration of Xilinx FPGAs. In: Proc. 16th Internat. Conf. Field Programm. Logic Appl., pp. 1\u20136 (2006)","key":"10_CR36","DOI":"10.1109\/FPL.2006.311188"},{"doi-asserted-by":"crossref","unstructured":"Majer, M., Bobda, C., Ahmadinia, A., Teich, J.: Packet routing in dynamically changing networks on chip. In: Proc. Internat. Parallel Distr. Proc. Sympos. (IPDPS), p. 154 (2005)","key":"10_CR37","DOI":"10.1109\/IPDPS.2005.323"},{"issue":"3","key":"10_CR38","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1287\/ijoc.15.3.310.16082","volume":"15","author":"S. Martello","year":"2003","unstructured":"Martello, S., Monaci, M., Vigo, D.: An exact approach to the strip-packing problem. INFORMS J.\u00a0Comput. 15(3), 310\u2013319 (2003)","journal-title":"INFORMS J.\u00a0Comput."},{"issue":"5","key":"10_CR39","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/585265.585269","volume":"49","author":"S.S. Seiden","year":"2002","unstructured":"Seiden, S.S.: On the online bin packing problem. J. ACM 49(5), 640\u2013671 (2002). doi:10.1145\/585265.585269","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Shi, J., Bhatia, D.: Performance driven floorplanning for FPGA based designs. In: Internat. Sympos. Field Programm. Gate Arrays, pp. 112\u2013118 (1997)","key":"10_CR40","DOI":"10.1145\/258305.258321"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TC.2004.99","volume":"53","author":"C. Steiger","year":"2004","unstructured":"Steiger, C., Walder, H., Platzner, M.: Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks. IEEE Trans. Comput. 53, 1393\u20131407 (2004)","journal-title":"IEEE Trans. Comput."},{"unstructured":"Teich, J., Fekete, S., Schepers, J.: Compile-time optimization of dynamic hardware reconfigurations. In: Internat. Conf. Parallel Distr. Proc. Techn. Appl., pp. 1097\u20131103 (1999)","key":"10_CR42"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1011188411132","volume":"19","author":"J. Teich","year":"2001","unstructured":"Teich, J., Fekete, S.P., Schepers, J.: Optimal hardware reconfiguration techniques. J.\u00a0Supercomput. 19, 57\u201375 (2001)","journal-title":"J.\u00a0Supercomput."},{"unstructured":"Tessier, R.G.: Fast place and route approaches for fpgas. PhD thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science (1999)","key":"10_CR44"},{"unstructured":"van\u00a0der Veen, J., Fekete, S., Majer, M., Ahmadinia, A., Bobda, C., Hannig, F., Teich, J.: Defragmenting the module layout of a partially reconfigurable devices. In: Plaks, T.P. (ed.) Proc. Internat. Conf. Engin. Reconf. Syst. Algor., pp. 92\u2013101 (2005)","key":"10_CR45"},{"doi-asserted-by":"crossref","unstructured":"Walder, H., Platzner, M.: Online scheduling for block-partitioned reconfigurable devices. In: Proc. Design Automat. Test Europe (DATE), pp. 290\u2013295 (2003)","key":"10_CR46","DOI":"10.1109\/DATE.2003.1253622"},{"key":"10_CR47","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/785411.785414","volume":"8","author":"X. Yang","year":"2003","unstructured":"Yang, X., Wang, M., Kastner, R., Ghiasi, S., Sarrafzadeh, M.: Fast placement approaches for FPGAs. ACM Trans. Des Automat. Electr. Syst. 8, 316\u2013333 (2003)","journal-title":"ACM Trans. Des Automat. Electr. Syst."},{"unstructured":"Yuh, P.H., Yang, C.L., Chang, Y.W.: Temporal floorplanning using the T-tree formulation. In: Proc. Internat. Conf. Comput. Aided Design, pp. 300\u2013305 (2004)","key":"10_CR48"}],"container-title":["Dynamically Reconfigurable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-90-481-3485-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T03:43:12Z","timestamp":1739850192000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-90-481-3485-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9789048134847","9789048134854"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-90-481-3485-4_10","relation":{},"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"10 February 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}