A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
New conception and algorithm of allocation mapping for processor arrays implemented into multi-context FPGA devices
2009
2009 International Multiconference on Computer Science and Information Technology
In the paper authors present new concept of realization of algorithms with regular graphs of information dependencies, in form of systolic arrays realized in multi-context programmable devices. Processor matrix efficiency depends on both allocation and schedule mapping. Authors use evolution algorithms and constraint programming to determine allocation mapping and optimize runtime of set algorithm. Authors compared the runtime of Cholesky's algorithm for banded matrices in which the new concept
doi:10.1109/imcsit.2009.5352752
dblp:conf/imcsit/RatuszniakM09
fatcat:zrqzorliprazrashjqygd5eqyy