Title: Non-contiguous linear placement for reconfigurable fabrics

Authors: Cristinel Ababei, Kia Bazargan

Addresses: Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN 55455, USA. ' Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN 55455, USA

Abstract: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabric. A preorder tree-expression or a general graph is placed in a strip, which can have active and/or inactive preplaced cores representing blockages and/or cores available for reuse. Two very efficient algorithms are proposed to solve the simpler problem of non-contiguous placement with blockages but without core reuse for tree graphs. The linear ordering obtained with any of the above algorithms is used as input for a third efficient algorithm to solve the problem of non-contiguous placement with both active and inactive cores. A fourth algorithm is proposed to solve the problem of non-contiguous placement with both core and connectivity reuse. Simulations results are reported.

Keywords: non-contiguous placement; linear placement; reconfigurable architectures; reconfigurable fabrics.

DOI: 10.1504/IJES.2006.010167

International Journal of Embedded Systems, 2006 Vol.2 No.1/2, pp.86 - 94

Published online: 05 Jul 2006 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article