Handling of recursion in dataflow model

Authors:
S. Ghosh;S. Bandyopadhyay;C. Mazumdar;S. Bhattacharya
Affiliations:
-;-;-;-
Venue:
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
Year:
1984

Citing 5
Cited 0

Data-Driven and Demand-Driven Computer Architecture

ACM Computing Surveys (CSUR)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Petri Net Theory and the Modeling of Systems

Petri Net Theory and the Modeling of Systems
First version of a data flow procedure language

Programming Symposium, Proceedings Colloque sur la Programmation
The architecture and system method of DDM1: A recursively structured Data Driven Machine

ISCA '78 Proceedings of the 5th annual symposium on Computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programs for dataflow machines often require efficient support for recursive procedure invocation to achieve high performance and programming flexibility. This paper discusses different methods presently used in contemporary dataflow models for handling recursion. Also, an alternative approach is proposed for handling recursion in token storage type of packet communication dataflow architecture.