On the compatibility of the topologies of parallel tasks and computing systems

DOI10.1088/1742-6596/1864/1/012103MaRDI QIDQ6356122zbMATH OpenWikidataFDO

Authors A. Zadorozhnyi, V. A. Melent'ev

Publication date 14 December 2020

Full work available at URL https://doi.org/10.1088/1742-6596/1864/1/012103

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Abstract: Aspects of compatibility of topologies of parallel computing systems and tasks are investigated. The introduction of appropriate indexes based on the original topological model of parallel computations and on the nontraditional description of a graph by its projections is proposed and elucidated. On the example of hypercubic computing system (CS) and tasks with ring and star information topologies, we demonstrate determining the indexes and their use in a comparative analysis of the applicability of interconnect with a given topology for solving tasks with the same and different types of information topologies.

This page was built for publication: On the compatibility of the topologies of parallel tasks and computing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356122)