The Community for Technology Leaders
RSS Icon
Issue No.09 - September (1989 vol.38)
pp: 1225-1239
A direct structure access approach called token relabeling scheme is presented in which all array operations can be performed without the use of any intermediary structure memory. The graph constructs for both approaches are described. Four numerical algorithms including fast Fourier transform, bitonic sort, LU decomposition, and matrix multiplication are implemented in both approaches. Token r
tagged token data-flow architecture; direct structure access; token relabeling; array operations; graph constructs; numerical algorithms; fast Fourier transform; bitonic sort; LU decomposition; matrix multiplication; deterministic simulation; execution time; speedup; resource utilization; fast Fourier transforms; graph theory; parallel architectures.
J.-L. Gaudiot, Y.-H. Wei, "Token Relabeling in a Tagged Token Data-Flow Architecture", IEEE Transactions on Computers, vol.38, no. 9, pp. 1225-1239, September 1989, doi:10.1109/12.29463
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool