Online placement for dynamically reconfigurable devices

International Journal of Embedded Systems

Volumn 1, Issue 3-4, 2005, Pages 165-178

  Ahmadinia, Ali ^a   Bobda, Christophe ^a   Teich, Jürgen ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

FPGA; hardware operating systems; reconfigurable computing; temporal placement

Indexed keywords

EID: 33746863976     PISSN: 17411068     EISSN: 17411076     Source Type: Journal    
DOI: 10.1504/ijes.2005.009947     Document Type: Article

References (16)

1. Ahmadinia, A. and Teich, J. (2003) ‘Speeding up online placement for XILINX FPGAs by reducing configuration overhead’, Proceedings of the IFIP International Conference on VLSI-SOC, Darmstadt, Germany, December, pp.118–122.
2. Ahmadinia, A., Bobda, C. and Teich, J. (2004) ‘A new approach for online placement on reconfigurable devices’, Proc. of the International Parallel and Distributed Processing Symposium (IPDPS-2004), Reconfigurable Architectures Workshop (RAW-2004), IEEE-CS Press, Santa Fe NM, USA, 26-27 April, p.134a.
3. Ahmadinia, A., Bobda, C. and Teich, J. (2004) ‘A dynamic scheduling and placement algorithm for reconfigurable hardware’, In Proc. of 17th International Conference on Architecture of Computing Systems (ARCS 2004), LNCS 2981, Springer, Augsburg, Germany, 23-26 March, pp.125–139.
4. Bazargan, K., Kastner, R. and Sarrafzadeh, M. (2000) ‘Fast template placement for reconfigurable computing systems’, IEEE Design and Test of Computers, Vol. 17, pp.68–83.
5. Bobda, C., Majer, M., Koch, D., Ahmadinia, A. and Teich, J. (2004) ‘A dynamic NoC approach for communication in reconfigurable devices’, International Conference on Field-Programmable Logic and its applications (FPL), Antwerp, Belgium, 30th August – 1st September, pp.1032–1036.
6. Brebner, G. (1996) ‘A virtual hardware operating system for the Xilinx XC6200’, Proceedings of 6th International Workshop on Field-Programmable Logic, Darmstadt, Germany, 23-25 September, pp.327–336.
7. Burns, A. and Wellings, A.J. (2001) Real-Time Systems and Programming Languages, Addison Wesley, Boston, MA, USA.
8. Dally, W.J. and Towles, B. (2001) ‘Route packets, not wires: on-chip interconnection networks’, Proceedings of the Design Automation Conference, Las Vegas, NV, June, pp.684–689.
9. DeHon, A. (1996) Reconfigurable Architectures for General-Purpose Computing, Technical Report AITR-1586, October 1996, MIT.
10. Diessel, O. and ElGindy, H. (1998) ‘On scheduling dynamic FPGA reconfigurations’, in Hawick, K.A. and James, H.A. (Eds.): Proceedings of Australasian Conference on Parallel and Real-Time Systems (PART), Springer-Verlag, pp.191–200.
11. Fekete, S., Köhler, E. and Teich, J. (2001) ‘Optimal FPGA module placement with temporal precedence constraints’, Proc. of Design Automation and Test in Europe, IEEE-CS Press, pp.658–665.
12. Walder, H., Steiger, C. and Platzner, M. (2003) ‘Fast online task placement on FPGAs: free space partitioning and 2D-hashing’, Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS)/Reconfigurable Architectures Workshop (RAW), IEEE Computer Society, April, p.178.
13. Wigley, G. and Kearney, D. (2002) ‘Research issues in operating systems for reconfigurable computing’, Proceedings of the 2nd International Conference on Engineering of Reconfigurable Systems and Architectures (ERSA), CSREA Press, June, pp.10–16.
14. Xilinx Inc. http://www.xilinx.com.
15. A network is strongly connected, if for each pair of network elements a path exists which connects the two elements.
16. The neighbour-routers of the routers around the chips are assumed to be the package pins through which external modules can access the network.