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.
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 |
Similar Items
-
Experimental Study of the Time Complexity of Basic Algorithms for Optimal Separation of Graphs
by: G. I. Borzunov, et al.
Published: (2010-03-01) -
Visual Parallel Programming as PaaS cloud service with Graph-Symbolic Programming Technology
by: Darya Egorova, et al.
Published: (2018-10-01) -
A speedup technique for dynamic graphs using partitioning strategy and multithreaded approach
by: R. Kalpana, et al.
Published: (2014-01-01) -
Label Propagation-Based Parallel Graph Partitioning for Large-Scale Graph Data
by: Minho Bae, et al.
Published: (2020-01-01) -
Parallelization of algorithms by explicit partitioning
by: Bahoshy, Nimatallah M.
Published: (1992)