𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for generating dataflow diagrams

✍ Scribed by Shuichiro Yamamoto; Kenji Ohta

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
877 KB
Volume
25
Category
Article
ISSN
0882-1666

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Various methods of generating dataflow diagrams use an algebraic transformation system for a given input‐output relationship. These methods require mutual transformations between the input‐output relationship and algebraic expressions, and also a consistency check between the generated dataflow diagram and input‐output relationship. This paper proposes a deterministic algorithm that uniquely generates a unique dataflow diagram with a minimal number of processes from a given input‐output relationship.

πŸ“œ SIMILAR VOLUMES

Computer generation of Feynman diagrams
Computer generation of Feynman diagrams for perturbation theory I. General algorithm
✍ J. Paldus; H.C. Wong πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 623 KB

A general algorithm which generates all the topologically distinct, linked, non-Hartree-Fock vacuum and Greenfunction Hugenholtz-type diagrams is presented. Both the particle-hole and particle-particleGreen-functions are considered. The one-particle Green function diagrams are not treated separately