Selection of network topologies at solving certain class of problems on distributed computer systems

P.K. Uskenbayeva, А.А. Куандыков, Amanzholova Saule Toksanovna, Aliya Kalizhanova

2015

Closed access Metadata (CSL-JSON)
DOI 10.1109/iccas.2015.7364991
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

The work hereby considers principles of distributed time-consuming tasks, identifies notions of computational problem parallelism based on selected types of parallelism and defines optimal topologies for solving definite class of problems in distributed computer systems.