Fast processing method of ergodic synchronous data flow system node parameter based on graphs

Abstract

The invention discloses a fast ergodic synchronous data flow (SDF) system node parameter processing method based on graphs. The fast ergodic synchronous data flow system node parameter processing method includes that an SDF graph is built for a real-time system, communication parameters of nodes connected at two ends on the side are marked at the two ends of each side in the graph, a node needed to be temporarily stored in the SDF graph stacking and storing ergodic process is built, any one node in the SDF is selected and operation parameters of the selected node are initialized, scanning is started, whether rings exist in the graph can be judged when each node is scanned, operation parameter consistency judgment is performed on yes judgment, otherwise, the operation parameters of the node are determined on the basis of communication parameters of the node, and the operation parameters of the scanned nodes in the graph are subjected to overall normalized adjustment. The fast ergodic synchronous data flow system node parameter processing method is few in processing steps, small in calculating amount, high in efficiency and accurate in calculating result, has the universalizaion advantage of being capable of processing parameters in different attributes, and improves speed and efficiency of computers for processing real-time SDF system node operation parameters.

Description

technical field [0001] The invention relates to the construction of a synchronous data flow system model in real-time system scheduling, in particular to a fast processing method for node parameters in a synchronous data flow (Synchronous Data Flow, abbreviated as SDF) system model. Background technique [0002] The SDF system model was proposed by Dr. Edward Ashford Lee of Berkeley in 1987. It is mainly oriented to DSP applications to model and analyze each computing unit (node) and its communication behavior. In the SDF model, a program or system is divided into multiple modules, and there is a data communication relationship between the modules. Each module starts to execute after the required data arrives through the data path. The program is described by a data flow graph. The data flow graph is a directed graph. The nodes in the graph represent modules, and the directed edges between nodes represent the data paths between modules. The head of each directed edge is mark...

AI Technical Summary

Problems solved by technology

[0004] Aiming at the problems of waste of resources, inaccurate results, serious time-consuming, large storage demand and other problems in the node parameter processing method in the traditional SDF system model graph, the present invention provides a graph-based traversal method for quickly processing node parameters of the synchronous data flow system , in order to improve the performance and efficiency of the computer when dealing with the corresponding problem

Images