Description of Graphs With Associative Operations in Set@l Programming Language

Evaluation of Computer Technologies for Calculation of Exact Approximations of Statistics Probability Distributions

“…The type "set" (set) corresponds to the classical clearly distinguished collection of elements, the type "semi-set" (sm) corresponds to a fuzzy collection and the type "class" (cls) corresponds to a set of objects, the type and partition of which cannot be uniquely determined at a given level of abstraction. An example of a computational problem that requires the Set@l fuzzy collections for its description is the Jacobi SLAE algorithm [31]. Unlike other approaches to parallel programming of high-performance computer systems, the Set@l programming language specifies not only boundary cases of the algorithm implementation, but also a family of intermediate options.…”

“…The language Set@l has been successfully used to solve algorithmically complex and resource-intensive problems, such as solving SLAE by the Gaussian [28] and Jacobi [31] methods and implementing the fast Fourier transform algorithm [32] and others with the same structure.…”