Defining Processing Elements in Dependence Graphs from for-do Programming Constructs.

Abstract: The modeling of processing elements (PEs) in dependence graphs (DGs), defined on 2 and 3 level for-do constructs, is presented. Dependence graphs model algorithms described by computer languages, like Fortran, Pascal, C, and C++ and are developed in cases when the mentioned algorithms are to be implemented in FPGA or embedded hardware, in the form of shift-invariant and systolic processing arrays. The paper is focused on defining the function and the input/output signals of the PEs that are used to build shift-invariant DGs. Key–Words: Dependence graphs, processing elements, parallel algorithms