Distinctive features of structural programming of synchronous sorting algorithms

Parallel (synchronous) algorithms of sorting arrays are considered. A modified synchronous sorting algorithm based on the pairwise exchange method is proposed and simulated. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 122–133, September–October 2006.     

A parallel sorting algorithm for a novel model of computation

The computational complexity of a parallel algorithm depends critically on the model of computation. We describe a simple and elegant rule-based model of computation in which processors apply rules asynchronously to pairs of objects from a global object space. Application of a rule to a pair of objects results in the creation of a new object if the objects satisfy the guard of the rule. The model can be efficiently implemented as a novel MIMD array processor architecture, the Intersecting Broadcast Machine. For this model of computation, we describe an efficient parallel sorting algorithm based on mergesort. The computational complexity of the sorting algorithm isO(nlog² n), comparable to that for specialized sorting networks and an improvement on theO(n ^1.5) complexity of conventional mesh-connected array processors.     

随机脉冲干扰对雷达信号分选的影响

验证了k已知条件下K-means聚类分选算法的准确性,并以此建立评估随机脉冲干扰效果的评价标准,通过软件仿真,得出影响干扰效果的随机脉冲参数规律,为工程实现提供了一定的理论依据.