Configuration sharing optimized placement and routing

This source preferred by Jon Cobb

Authors: Stepien, P. and Cobb, J.E.

http://eprints.bournemouth.ac.uk/15752/

Pages: 430-435

Publisher: IEEE

ISBN: 978-1-4244-9523-8

DOI: 10.1109/ReConFig.2010.58

Reconfigurable systems have been shown to achieve very high computational performance. However, the overhead associated with reconfiguration of hardware remains a critical factor in overall system performance. This paper discusses the development and evaluation of a technique to minimize the delay associated with reconfiguration based upon optimized sharing of configuration bit streams between design contexts. This is achieved through modified placement and routing algorithms.

This data was imported from DBLP:

Authors: Stepien, P. and Cobb, J.

Editors: Prasanna, V.K., Becker, J. and Cumplido, R.

http://eprints.bournemouth.ac.uk/15752/

http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5692850

Pages: 430-435

Publisher: IEEE Computer Society

DOI: 10.1109/ReConFig.2010.58

This data was imported from Scopus:

Authors: Stepien, P. and Cobb, J.

http://eprints.bournemouth.ac.uk/15752/

Pages: 430-435

ISBN: 9780769543147

DOI: 10.1109/ReConFig.2010.58

Reconfigurable systems have been shown to achieve very high performance. However, the overhead associated with reconfiguration of hardware remains a critical factor in overall system performance. This paper discusses the development and evaluation of a technique to minimize the delay associated with reconfiguration based upon optimized sharing of configuration bit streams between design contexts. This is achieved through modified placement and routing algorithms. © 2010 IEEE.

The data on this page was last updated at 04:43 on November 23, 2017.