Spatial Management of Distributed Social Systems

The paper describes the use of invented,developed,and tested in different countries of the high-level spatial grasp model and technology capable of solving important problems in large social systems,which may be represented as dynamic,self-evolving and distributed social networks.The approach allows us to find important solutions on a holistic level by spatial navigation and parallel pattern matching of social networks with active self-propagating scenarios represented in a special recursive language.This approach effectively hides inside the distributed and networked language implementation traditional system management routines,often providing hundreds of times shorter and simpler high-level solution code.The paper highlights the demands to efficient simulation of social systems,briefs the technology used,and provides some programming examples for solutions of practical problems.

Java Parallel Implementations of Kohonen Self-Organizing Feature Maps

The Kohonen self-organizing map (SOM) is an important tool to find a mapping from high-dimensional space to low dimensional space. The time a SOM requires increases with the number of neurons. A parallel implementation of the algorithm can make it faster. This paper investigates the most recent parallel algorithms on SOMs. Using Java network programming utilities, improved parallel and distributed system are set up to simulate these algorithms. From the simulations, we conclude that those algorithms form good feature maps.

Construction of parallel and distributed static simulation system based on augmented reality

This article puts forward a kind of parallel and distributed static augmented scene system structure to improve the performance of real time augmented simulation system. Based on static registration technique, several groups of processing nodes do parallel scene pictures taking, 3D registration and virtual-real merging. Process on different nodes is controlled by uniform synchronization mechanism and network transmitting. Wide field of view image can be obtained from image mosaic operation and displayed by wide view display system. Detailed system architecture, registration algorithm, method how to determine camera position and synchronization mechanism between each process node are introduced. The experiment result can validate the good performance of the designed system.

Thread-Oriented Online Load Balancing

Dynamic task assignment and migration are the key technique to load balancing which plays an important role in the achievement of high performance in distributed computing system. In this paper, we describe the design and implementation of an online thread scheduling and migration system (S&M) based on a previous work of LWP -MPI. Experimental results show that performance is enhanced.

An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling

Optimized task scheduling is one of the most important challenges to achieve high performance in multiprocessor environments such as parallel and distributed systems. Most introduced task-scheduling algorithms are based on the so-called list scheduling technique. The basic idea behind list scheduling is to prepare a sequence of nodes in the form of a list for scheduling by assigning them some priority measurements, and then repeatedly removing the node with the highest priority from the list and allocating it to the processor providing the earliest start time （EST）. Therefore, it can be inferred that the makespans obtained are dominated by two major factors： （1） which order of tasks should be selected （sequence subproblem）; （2） how the selected order should be assigned to the processors （assignment subproblem）. A number of good approaches for overcoming the task sequence dilemma have been proposed in the literature, while the task assignment problem has not been studied much. The results of this study prove that assigning tasks to the processors using the traditional EST method is not optimum; in addition, a novel approach based on the ant colony optimization algorithm is introduced, which can find far better solutions.

Two Physics-Based Schwarz Preconditioners for Three-Temperature Radiation Diffusion Equations in High Dimensions

We concentrate on the parallel,fully coupled and fully implicit solution of the sequence of 3-by-3 block-structured linear systems arising from the symmetrypreserving finite volume element discretization of the unsteady three-temperature radiation diffusion equations in high dimensions.In this article,motivated by[M.J.Gander,S.Loisel,D.B.Szyld,SIAM J.Matrix Anal.Appl.33(2012)653–680]and[S.Nardean,M.Ferronato,A.S.Abushaikha,J.Comput.Phys.442(2021)110513],we aim to develop the additive and multiplicative Schwarz preconditioners subdividing the physical quantities rather than the underlying domain,and consider their sequential and parallel implementations using a simplified explicit decoupling factor approximation and algebraic multigrid subsolves to address such linear systems.Robustness,computational efficiencies and parallel scalabilities of the proposed approaches are numerically tested in a number of representative real-world capsule implosion benchmarks.

An Algebraic Multigrid-Based Physical Factorization Preconditioner for the Multi-Group Radiation Diffusion Equations in Three Dimensions

The paper investigates the robustness and parallel scaling properties of a novel physical factorization preconditioner with algebraic multigrid subsolves in the iterative solution of a cell-centered finite volume discretization of the threedimensional multi-group radiation diffusion equations.The key idea is to take advantage of a particular kind of block factorization of the resulting system matrix and approximate the left-hand block matrix selectively spurred by parallel processing considerations.The spectral property of the preconditioned matrix is then analyzed.The practical strategy is considered sequentially and in parallel.Finally,numerical results illustrate the numerical robustness,computational efficiency and parallel strong and weak scalabilities over the real-world structured and unstructured coupled problems,showing its competitiveness with many existing block preconditioners.