Referenced Items are not available for this document.
The authors build upon research by E. A. Lee (1991) concerning the token flow model, an analytical model for the behavior of dataflow graphs with data-dependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state. Necessary and sufficient conditions are given for the existence of a bounded cyclic schedule as well as sufficient conditions for execution of the graph in bounded memory. The techniques presented apply to a more general class of dataflow graphs than previous methods.<
Published in:
Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on
(Volume:1
)
Date of Conference: 27-30 April 1993
- Page(s):
- 429 - 432 vol.1
- Meeting Date :
- 27 Apr 1993-30 Apr 1993
- ISSN :
- 1520-6149
- Print ISBN:
- 0-7803-7402-9
- INSPEC Accession Number:
- 4758422
- Conference Location :
- Minneapolis, MN, USA
- Digital Object Identifier :
- 10.1109/ICASSP.1993.319147
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
