Modeling Resolution of Resources Contention in Synchronous Data Flow Graphs

Abstract

Synchronous Data Flow graphs are widely adopted in the designing of streaming applications, but were originally formulated to describe only how an application is partitioned and which data are exchanged among different tasks. Since Synchronous Data Flow graphs are often used to describe and evaluate complete design solutions, missing information (e.g., mapping, scheduling, etc.) has to be included in them by means of further actors and channels to obtain accurate evaluations. To address this issue preserving the simplicity of the representation, techniques that model data transfer delays by means of ad-hoc actors have been proposed, but they model independently each communication ignoring contentions. Moreover, they do not usually consider at all delays due to buffer contentions, potentially overestimating the throughput of a design solution.In this paper a technique to extend Synchronous Data Flow graphs by adding ad-hoc actors and channels to model resolution of resources contentions is proposed. The results show that the number of added actors and channels is limited but that they can significantly increase the Synchronous Data Flow graph accuracy.

Task coordination organization model and the task allocation algorithm for resource contention of the syncretic system

“…For example, Hyun et al [11] proposed a decentralized Multi-Robot Task Allocation (MRTA) approach, taking into account the residual expendable resources of robots and their limited communication range. Lattuada and Ferrandi [12] modeled the resolution of resources contention in synchronous data flow graphs by adding a function member and communication channel. de Blanche and Lundqvist [13] proposed addressing characterization methods for memory contention aware co-scheduling.…”