Offline and online aspects of defragmenting the module layout of a partially reconfigurable device

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 16, Issue 9, 2008, Pages 1210-1219

  Fekete, Sándor P ^b   Van Der Veen, Jan C ^b   Ahmadinia, Ali ^c   Göhringer, Diana ^c   Majer, Mateusz ^c   Teich, Jürgen ^a,c  

^a IEEE

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^c UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

2 D packing; Defragmentation; Exact algorithms; NP hard problems; Partial reconfiguration; Reconfigurable computing

Indexed keywords

LASER PRODUCED PLASMAS; NUCLEAR PROPULSION; PACKING;

2-D PACKING; DEFRAGMENTATION; EXACT ALGORITHMS; FIELD-PROGRAMMABLE GATE ARRAYS; INTERFERENCE FITS; NP-HARD; NP-HARD PROBLEMS; OPTIMALITY; PARTIAL RECONFIGURATION; RECONFIGURABLE COMPUTING; RECONFIGURABLE DEVICES; STRIP PACKING PROBLEMS;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

ALGORITHMS; ELECTRIC CIRCUITS; NUCLEAR POWER; PACKING; PROBLEM SOLVING;

EID: 50549090198     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2008.2000677     Document Type: Article

References (30)

1. J. van der Veen, S. Fekete, M. Majer, A. Ahmadinia, C. Bobda, F. Hannig, and J. Teich, "Defragmenting the module layout of a partially reconfigurable devices," in Proc. Int. Conf. Eng. Reconfigurable Syst. Algorithms, T. P. Plaks, Ed., 2005, pp. 92-101 [Online]. Available: http://arxiv.org/abs/cs.AR/0505005
2. C. Steiger, H. Walder, and M. Platzner, "Operating systems for reconfigurable embedded platforms: Online scheduling of real-time tasks," IEEE Trans. Computers, vol. 53, no. 11, pp. 1393-1407, Nov. 2004.
3. O. Diessel, H. ElGindy, M. Middendorf, H. Schmeck, and B. Schmidt, "Dynamic scheduling of tasks on partially reconfigurable FPGAs," IEE Proc. - Computers Digital Techniques, vol. 147, no. 3, pp. 181-188, May 2000.
4. Xilinx Inc., San Jose, CA, "Virtex-II Platform FPGAs: Complete data sheet," Jun. 2004.
5. C. Bobda, M. Majer, D. Koch, A. Ahmadinia, and J. Teich, "A dynamic NoC approach for communication in reconfigurable devices," in Proc. Int. Conf. Field-Program. Logic Appl. (FPL). Antwerp, Belgium: Springer, Aug. 2004, vol. 3203, pp. 1032-1036.
6. E. L. Lawler, J. K. Lenstra, A. H. G. Rinooy Kan, and D. B. Shmoys, "Sequencing and scheduling: Algorithms and complexity," in Logistics of Production and Inventory, ser. Handbooks in Operations Research and Management, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, Eds. Amsterdam: North-Holland, 1993, vol. 4, pp. 445-522.
7. A. Ahmadinia and J. Teich, "Speeding up online placement for XILINX FPGAs by reducing configuration overhead," in Proc. IFIP Int. Conf. VLSI-SOC, Darmstadt, Germany, Dec. 2003, pp. 118-122.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
9. M. Grötschel, "On the symmetric travelling salesman problem: Solution of a 120-city problem," Mathematical Programming Study, vol. 12, pp. 61-77, 1980.
10. D. Applegate, R. Bixby, V. Chvátal, and W. Cook, "On the solution of traveling salesman problems," Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, vol. ICM III, pp. 645-656, 1998.
11. S. P. Fekete and J. Schepers, "A new exact algorithm for general orthogonal d-dimensional knapsack problems," in Algorithms - ESA. New York: Springer, 1997, vol. 1284, Lecture Notes in Computer Science, pp. 144-156.
12. S. P. Fekete and J. Schepers, "A combinatorial characterization of higher-dimensional orthogonal packing," Math. Operations Res., vol. 29, pp. 353-368, 2004.
13. J. E. Beasley, "An exact two-dimensional non-guillotine cutting tree search procedure," Operations Res., vol. 33, pp. 49-64, 1985.
14. E. Hadjiconstantinou and N. Christofides, "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," Eur. J. Operations Res., vol. 83, pp. 39-56, 1995.
15. S. Martello, M. Monaci, and D. Vigo, "An exact approach to the strippacking problem," INFORMS J. Comput, vol. 15, no. 3, pp. 310-319, 2003.
16. S. P. Fekete and J. Schepers, "A general framework for bounds for higher-dimensional orthogonal packing problems," Math. Methods Operations Res., vol. 60, pp. 311-329, 2004.
17. S. P. Fekete, J. Schepers, and J. van der Veen, "An exact algorithm for higher-dimensional orthogonal packing," Operations Res., vol. 55, pp. 569-587, 2007.
18. J. Teich, S. P. Fekete, and J. Schepers, "Optimal hardware reconfiguration techniques," J. Supercomput., vol. 19, pp. 57-75, 2001.
19. S. P. Fekete and J. Schepers, "New classes of lower bounds for bin packing problems," in Proc. Integer Program. Combinatorial Optimization (IPCO'98), 1998, vol. 1412, pp. 257-270.
20. S. P. Fekete and J. Schepers, "New classes of lower bounds for the bin packing problem," Math. Program., vol. 91, pp. 11-31, 2001.
21. S. P. Fekete, E. Köhler, and J. Teich, "Multi-dimensional packing with order constraints," in Proceedings 7th International Workshop on Algorithms and Data Structures. New York:, "," ser. Lecture Notes in Computer Science, vol. 2.125, Springer-Verlag, 2001, pp. 300-312.
22. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980.
23. R. H. Möhring, "Algorithmic aspects of comparability graphs and interval graphs," in Graphs and Order, I. Rival, Ed. Dordrecht, Germany: Reidel Publishing Company, 1985, pp. 41-101.
24. J. Schepers, Exakte Algorithmen für orthogonale Packungsprobleme Universität Köln, Tech. Rep. 97-302, 1997.
25. A. Ghouilà-Houri, "Caractérization des graphes non orientés dont on peut orienter les arrêtes de manière à obtenir le graphe d'une relation d'ordre," CR. Acad. Sci. Paris, vol. 254, pp. 1370-1371, 1962.
26. P. C. Gilmore and A. J. Hoffmann, "A characterization of comparability graphs and of interval graphs," Canadian J. Math., vol. 16, pp. 539-548, 1964.
27. B. S. Baker and J. S. Schwarz, "Shelf algorithms for two-dimensional packing problems," SIAM J. Comput, vol. 12, no. 3, pp. 508-525, 1983.
28. S. S. Seiden, "On the online bin packing problem," J. ACM, vol. 49, no. 5, pp. 640-671, 2002.
29. C. Bobda, M. Majer, A. Ahmadinia, T. Haller, A. Linarth, J. Teich, and J. van der Veen, "The erlangen slot machine: A highly flexible fpga-based reconfigurable platform," in Proc. FCCM, 2005, pp. 319-320.
30. C. Imreh, "Online strip packing with modifiable boxes," Oper. Res. Lett., vol. 29, no. 2, pp. 79-85, 2001.