No-break dynamic defragmentation of reconfigurable devices

Proceedings - 2008 International Conference on Field Programmable Logic and Applications, FPL

Volumn , Issue , 2008, Pages 113-118

  Fekete, Sdndor P ^a   Kamphans, Tom ^a   Schweer, Nils ^a   TessarsK, Christopher ^a   Veen, Jan C Van Der ^a   Angermeier, Josef ^b   Kocffi, Dirk ^b   Teich, Jürgen ^b  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE;

ALGORITHMIC ASPECTS; FREE SPACES; ON DYNAMICS; OPTIMIZATION METHODS; RECONFIGURABLE DEVICES; RECONFIGURATION OVERHEADS;

TABU SEARCH;

EID: 54949106649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2008.4629917     Document Type: Conference Paper

References (20)

1. I. Kuon and J. Rose, "Measuring the gap between FPGAs and ASICs," IEEE Trans. CAD Integr. Circuits Systems, vol. 26, pp. 203-215, Feb. 2007.
2. P. Lysaght, B. Blodget, J. Mason, J. Young, and B. Bridgford, "Invited paper: Enhanced architecture, design methodologies and CAD tools for dynamic reconfiguration of Xilinx FPGAs," in Proc. 16th Internal. Conf. Field Programm. Logic Appl, Aug 2006, pp. 1-6.
3. J. Hagemeyer, B. Kettelhoit, M. Koester, and M. Porrmann, "Design of homogeneous communication infrastructures for partially reconfigurable FPGAs," in Proc. Internal. Conf. Engineering of Reconf. Systems and Algor., Las Vegas, USA, June 2007.
4. D. Koch, C. Haubelt, and J. Teich, "Efficient reconfigurable on-chip buses for FPGAs," in Proc. 16th Annu. IEEE Sympos. Field-Programm. Custom Corn-put. Mach., Palo Alto, CA, USA, Apr. 2008.
5. D. Koch, C. Beckhoff, and J. Teich, "ReCoBusBuilder - a novel tool and technique to build static and dynamically reconfigurable systems for FPGAs," in Proc. 18th Internat. Conf. Field Programm. Logic Appl., 2008, submitted to.
6. D. E. Knuth, The Art of Computer Programming: Fundamental Algorithms, 3rd ed. Reading, Massachusetts: Addison Wesley, June 1997, vol. 1.
7. P. R. Wilson, M. S. Johnstone, M. Neely, and D. Boles, "Dynamic storage allocation: A survey and critical review," in Proceedings of International Workshop on Memory Management, ser. Lecture Notes in Computer Science, H. Baker, Ed., vol. 986. Kinross, Scotland: Springer-Verlag, Sept. 1995. [Online]. Available: ftp://ftp.cs.utexas.edu/pub/garbage/allocsrv.ps
8. G. Bromley, "Memory fragmentation in buddy methods for dynamic storage allocation," Ada Inform., vol. 14, pp. 107-117, 1980.
9. J. A. Hinds, "An algorithm for locating adjacent storage blocks in the buddy system," Commun. ACM, vol. 18, pp. 221-222, 1975.
10. D. S. Hirschberg, "A class of dynamic memory allocation algorithms," Commun. ACM, vol. 16, pp. 615-618, 1973.
11. K. C. Knowlton, "A fast storage allocator," Commun. ACM, vol. 8, pp. 623-625, 1965.
12. K. K. Shen and J. L. Peterson, "A weighted buddy method for dynamic storage allocation," Commun. ACM, vol. 17, pp. 558-562, 1974.
13. M. A. Bender, E. D. Demaine, and M. Farach-Colton, "Cache-oblivious B-trees," SI AM J. Comput., vol. 35, pp. 341-358, 2005.
14. M. A. Bender, J. T. Fineman, S. Gilbert, and B. C. Kuszmaul, "Concurrent cache-oblivious B-trees," in Proc. 17th Annu. ACM Sympos. Parallel. Algor. Architect, 2005, pp. 228-237.
15. T. Becker, W. Luk, and P. Y. Cheung, ''Enhancing relo-catability of partial bitstreams for run-time reconfiguration," in Proc. 15th Annu. Sympos. Field-Programm. Custom Comput. Mach., 2007, pp. 35-44.
16. K. Compton, Z. Li, J. Cooley, S. Knol, and S. Hauck, "Configuration relocation and defragmentation for runtime reconfigurable systems," IEEE Transact. VLSI, vol. 10, pp. 209-220, 2002.
17. D. Koch, A. Ahmadinia, C. Bobda, and H. Kalte, "FPGA architecture extensions for preemptive multitasking and hardware defragmentation," in Proc. IEEE Internat. Conf. Field-Programmable Technology, Brisbane, Australia, 2004, pp. 433-436.
18. D. Koch, C. Haubelt, and J. Teich, "Efficient hardware checkpointing - concepts, overhead analysis, and implementation," in Proc. 15th ACM/SIGDA Internat. Sympos. Field-Programm. Gate Arrays. Monterey, California, USA: ACM, 2007, pp. 188-196.
19. M. R. Garey and D. S. Johnson, Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, 1979.
20. S. P. Fekete, T. Kamphans, N. Schweer, C. Tessars, J. van der Veen, J. Angermeier, D. Koch, and J. Teich, "No-break dynamic defragmentation of reconfigurable devices," submitted. 2008.