Modular Computing Networks: A New Methodology for Analysis and Design of Parallel Algorithms/Architectures,

Several methods for modeling and analysis of parallel algorithms and architecture have been proposed in the recent years. These include recursion-type methods, like recursion equations, z-transform descriptions and do-loops in high-level programming languages, and precedence-graph-type methods like data-flow graphs marked graphs and related Petri-net derived models. This paper presents a new methodology for modeling and analysis of parallel algorithms and architectures. This methodology provides a unified conceptual framework that clearly displays the key properties of parallel systems. This methodology is largely based upon the theory of directed graphs and can, therefore, be expressed both informally, in pictorial fashion, and formally, in the language of precedence relations and compositions of functions. This duality will, hopefully, help to bridge the gap between the two schools of research in this field.