Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions

This paper proposes a new approach to the allocation of tasks with a positive listing set partitions. The proposed approach provides a more even distribution of the processing load on multiprocessor systems when looking for extreme set partitions.

Bibliographic Details
Main Authors: G.I. Borzunov, T. V. Petrova, E. A. Suchkova
Format: Article
Language:English
Published: Moscow Engineering Physics Institute 2011-09-01
Series:Bezopasnostʹ Informacionnyh Tehnologij
Subjects:
Online Access:https://bit.mephi.ru/index.php/bit/article/view/628
id doaj-14a54ce63df74b6794c269bc7a632cd7
record_format Article
spelling doaj-14a54ce63df74b6794c269bc7a632cd72020-11-24T23:56:01ZengMoscow Engineering Physics Institute Bezopasnostʹ Informacionnyh Tehnologij2074-71282074-71362011-09-01183116120618Effectiveness of Scaling a Set of Problems in Finding Extreme PartitionsG.I. BorzunovT. V. PetrovaE. A. SuchkovaThis paper proposes a new approach to the allocation of tasks with a positive listing set partitions. The proposed approach provides a more even distribution of the processing load on multiprocessor systems when looking for extreme set partitions.https://bit.mephi.ru/index.php/bit/article/view/628clusterparallel programminggraph separation
collection DOAJ
language English
format Article
sources DOAJ
author G.I. Borzunov
T. V. Petrova
E. A. Suchkova
spellingShingle G.I. Borzunov
T. V. Petrova
E. A. Suchkova
Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
Bezopasnostʹ Informacionnyh Tehnologij
cluster
parallel programming
graph separation
author_facet G.I. Borzunov
T. V. Petrova
E. A. Suchkova
author_sort G.I. Borzunov
title Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
title_short Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
title_full Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
title_fullStr Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
title_full_unstemmed Effectiveness of Scaling a Set of Problems in Finding Extreme Partitions
title_sort effectiveness of scaling a set of problems in finding extreme partitions
publisher Moscow Engineering Physics Institute
series Bezopasnostʹ Informacionnyh Tehnologij
issn 2074-7128
2074-7136
publishDate 2011-09-01
description This paper proposes a new approach to the allocation of tasks with a positive listing set partitions. The proposed approach provides a more even distribution of the processing load on multiprocessor systems when looking for extreme set partitions.
topic cluster
parallel programming
graph separation
url https://bit.mephi.ru/index.php/bit/article/view/628
work_keys_str_mv AT giborzunov effectivenessofscalingasetofproblemsinfindingextremepartitions
AT tvpetrova effectivenessofscalingasetofproblemsinfindingextremepartitions
AT easuchkova effectivenessofscalingasetofproblemsinfindingextremepartitions
_version_ 1725460036618027008