For example,Бобцов

PARALLEL ALGORITHMS FOR COMPLEX NETWORKS SIMULATIONS

Annotation

The set of parallel algorithms which allow reproducing a complex network as a stochastic graph with probabilistic properties is proposed in the paper. Each of algorithms is based on natural properties of graph structure parallelization and corresponds to features of the certain parallel computer architecture, including systems with the shared and distributed memory, and cluster systems as well. Results of experiments of parallel efficiency on hierarchical parallel computer systems and cluster systems (T-Forge mini) are presented.

Keywords

Постоянный URL

Articles in current issue

CONTENT © ITMO UNIVERSITY 1993-2026