Handling of recursion in dataflow model

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.