By Topic

Token relabeling in a tagged token data-flow architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. -L. Gaudiot ; Dept. of Electr. Eng.-Syst. Univ. of Southern California, Los Angeles, CA, USA ; Y. -H. Wei

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 relabeling is directly applicable to arrays which are entirely consumed. Graph constructs which allow partial consumption are also designed. The effectiveness and efficiency of this parallel random access construct verifies the feasibility and applicability of the token relabeling scheme. A deterministic simulation of Arvind and K.P. Gostelow's tagged-token data-flow architecture (1982) is undertaken to validate the graph designs and evaluate the performance of the graphs. It is shown that the direct access graphs present better performance with regard to execution time, speedup, and resource utilization

Published in:

IEEE Transactions on Computers  (Volume:38 ,  Issue: 9 )