Resource-independent Description of Information Graphs with Distributive Operations in the Set@l Programming Language

Abstract

In the paper, we suggest to transform a standard sequential topology of an information graph with distributive operations into its hybrid version with sequential and parallel fragments. Such transformation allows to provide efficient description of calculations in the resource-independent form. The result topology depends on available hardware resource of a reconfigurable system and provides an increase in the special performance in comparison to the initial topology. We have developed an algorithm of a linear structure transformation into various hybrid topologies according to the configuration of the computing system. The algorithm is described in the Set@l programming language.