By Topic

Static tokens: using dataflow to automate concurrent pipeline synthesis

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
$31 $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)
Teifel, J. ; Comput. Syst. Lab., Cornell Univ., Ithaca, NY, USA ; Manohar, R.

We describe a new intermediate compiler representation, static token form, that is suitable for dataflow-style synthesis of high-level asynchronous specifications. Static token form transforms variables into tokens, and simplifies the pipelining of asynchronous computations according to their dataflow graphs. We present a compiler framework that automates this synthesis method, and show how it can be applied to pipelined asynchronous FPGA architectures.

Published in:

Asynchronous Circuits and Systems, 2004. Proceedings. 10th International Symposium on

Date of Conference:

19-23 April 2004