Investigations of the parallel computing of the non-ideal 3-D space detonation wave propagation are presented in this paper on the hi-performance computer based on CC-NUMA architecture. Upon analyzing and testing the ...
详细信息
ISBN:
(纸本)0769515126
Investigations of the parallel computing of the non-ideal 3-D space detonation wave propagation are presented in this paper on the hi-performance computer based on CC-NUMA architecture. Upon analyzing and testing the previous serial program, the computation of curvature, the first-order and the second-order difference were determined to be the main objects of parallelization. Some processing techniques were applied to convert the serial program into parallel program, such as the strategy of "Divide and Conquer", the balance of the loading distribution. Numerical simulation computation of the parallel program results in a great increase of computing speed of the non-ideal 3-D space detonation wave propagation.
An algorithm, which solves the cooperative concurrent computing tasks by using the idle cycle of a number of high performance heterogeneous workstations interconnected by a high-speed network, is proposed. In order to...
详细信息
ISBN:
(纸本)0769515126
An algorithm, which solves the cooperative concurrent computing tasks by using the idle cycle of a number of high performance heterogeneous workstations interconnected by a high-speed network, is proposed. In order to get better parallel computation performance, this paper gives a model and an algorithm of task scheduling among heterogeneous workstations, in which the costs of loading data, computing, communication and collecting results are considered. Using this efficient algorithm, an optimal subset of heterogeneous workstations withthe shortest parallel executing time of tasks can be selected.
this paper presents tensor product formulas for modeling fault tolerant architectures and their corresponding reconfiguration algorithms. In our approaches, a network topology is first described with simple tensor pro...
详细信息
there are significant difficulties in radar automatic data processing arising from poor flexibility of known algorithms and low computational capacity of traditional computer devices. Neural networks can help the rada...
详细信息
ISBN:
(纸本)9810475241
there are significant difficulties in radar automatic data processing arising from poor flexibility of known algorithms and low computational capacity of traditional computer devices. Neural networks can help the radar designer to overcome these difficulties as a result of computational power of neural parallel hardware and adaptive capabilities of neural algorithms. the idea of neural net application in the most difficult radar problems is proposed and analized. Some examples of neural methods for radar information processing are proposed and discussed: phase array antenna weights adaptation, genetic algorithms for optimization of multibased coded signals, data associations in multi-target environment, neural training for decision making systems. Results of the analysis for proposed methods prove that a considerable increase in efficiency can be achieved when neural networks are used for radar information processing problems.
It is presented in this paper that the design and analysis of finite difference domain decomposition algorithms for the two-dimensional heat equation and the numerical results have shown the stability and accuracy of ...
详细信息
ISBN:
(纸本)0769515126
It is presented in this paper that the design and analysis of finite difference domain decomposition algorithms for the two-dimensional heat equation and the numerical results have shown the stability and accuracy of the algorithms. the algorithms in the paper have further extended those developed by Dawson and the others [6].
In this paper, the discrete state space recursive filters are implemented in the form of parallel array processors. the state space description permits the straightforward application of systolic architectures to real...
详细信息
ISBN:
(纸本)0780375963
In this paper, the discrete state space recursive filters are implemented in the form of parallel array processors. the state space description permits the straightforward application of systolic architectures to realize recursive filters of 1D and 2D types. We show that the recursivity inherent to the filtering algorithm introduces a latency proportional to the filter order. Morover, we show that the use of CTP decomposition technique together withthe cylindrical-type structures reduces significantly this latency and improves the computation throughput of these arrays. the processing cells of the systolic array are designed via Switched-Capacitor techniques.
A type of incomplete decomposition preconditioner based on local block factorization is considered, for the matrices derived from discreting 2-D or 3-D elliptic partial differential equations. We prove that the condit...
详细信息
ISBN:
(纸本)0769515126
A type of incomplete decomposition preconditioner based on local block factorization is considered, for the matrices derived from discreting 2-D or 3-D elliptic partial differential equations. We prove that the condition numbers of the preconditioned matrices are small, which means that the constructed preconditioners are effective. Further we consider an efficient parallel version of the preconditioner which depends only on a single integer argument. When its value is small, the iterations needed on multiple processors to converge is much more than on a single processor But withthe increase of this value, the difference decreases step by step. Finally, we have many experiments on a cluster of 6 PCs with main frequencies of 1.8GHz the results show that the local block factorizations constructed are efficient in serial implementation, if compared to some well-known effective preconditioners, and the parallel versions are efficient also.
Improving the computation efficiency is a key issue in image processing, especially in edge detection, because edge detection is very computationally intensive. Withthe development of real-time application of image p...
详细信息
ISBN:
(纸本)0769515126
Improving the computation efficiency is a key issue in image processing, especially in edge detection, because edge detection is very computationally intensive. Withthe development of real-time application of image processing, fast processing response is becoming more critical. In this paper, a technique for distributed image processing on Spiral Architecture is proposed, which provides a platform for speeding up image processing based on clusters.
A consensus on a parallel architecture for very large database management has emerged. this architecture is based on a shared-nothing hardware organization. the computation model is very sensitive to skew in tuple dis...
详细信息
We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a, set S of n weighted elements, where an element is on weighted rank k if it is the smallest ele...
详细信息
ISBN:
(纸本)0769515126
We study parallel solutions to the problem of weighted multiselection to select r elements on given weighted-ranks from a, set S of n weighted elements, where an element is on weighted rank k if it is the smallest element such that the aggregated weight of all elements not greater than it in S is not smaller than k. We propose efficient algorithms on two of the most popular parallelarchitectures, hypercube and mesh. For a hypercube with p < n processors, we present a parallel algorithm running in O(n(epsilon) min{r, log p}) time for p = n(1-epsilon), 0 < epsilon < 1, which is cost optimal when r greater than or equal to p. Our algorithm on rootp x rootp mesh runs in O(rootp + n/p log(3) p) time P which is the same as multiselection on mesh when r greater than or equal to log p, and thus has the same optimality as multiselection in this case.
暂无评论