With the new trends in signals analysis for permanent improvement of the investigation systems there is a growing demand for fast and smart parallel algorithms to work on ID long datasets. The idea is to compute the t...
详细信息
With the new trends in signals analysis for permanent improvement of the investigation systems there is a growing demand for fast and smart parallel algorithms to work on ID long datasets. The idea is to compute the transform coefficients witch usually takes a long processing time even with the fast sequential wavelet algorithms like FWT by I. Daubechies (1992), in a close to real time manner using variant number of processors with minimum communication requirements and optimal load balancing. We propose here a parallel method for the wavelet transform of signals based of the SIMD philosophy applied on distributed memory machines. We implemented and optimized the code to work whatever the number of time entries are by introducing a splitting step and dedicating for tests a number of new generation processors on a parallel Linux cluster.
Fast control chart pattern recognition aids in instantaneous detection of abnormal functioning of a system. In this paper, we present a parallel algorithm for fast control chart pattern recognition. It addresses three...
详细信息
Fast control chart pattern recognition aids in instantaneous detection of abnormal functioning of a system. In this paper, we present a parallel algorithm for fast control chart pattern recognition. It addresses three major issues of control chart pattern recognition: (i) transparency (ii) accuracy and (iii) fast detection of abnormal patterns. The algorithm uses novel shape features extracted from a control chart pattern (CCP) instead of the unprocessed CCP data or its statistical properties. These shape features can be extracted in parallel. A parallel algorithm that is based on distributed and synergistic neural network structure for recognition of CCPs is described. The paper presents the results of analyzing several hundred control chart patterns and gives a comparison with those reported in previous work.
In this paper we report our experiences in the definition of the component structure of a remote visualization parallel software using Ccaffeine, a common component architecture (CCA) framework for high performance co...
详细信息
In this paper we report our experiences in the definition of the component structure of a remote visualization parallel software using Ccaffeine, a common component architecture (CCA) framework for high performance computing. Remote visualization is a key issue in many grid applications and a demanding task both from the design and the computational point of view. For this reason adequate parallel algorithms and programming tools are necessary in order to face problems that arise implementing a remote visualization system for grid architectures. The use of Ccaffeine for the componentization of a parallel software module for isosurface extraction is described. Programming aspects and performance overheads of the Ccaffeine component for parallel isosurface extraction are discussed.
The multiple genome sequence alignment problem falls in the domain of problems that can be parallelized to address large sequence lengths. Although there is communication required for the computation of the aligned se...
详细信息
The multiple genome sequence alignment problem falls in the domain of problems that can be parallelized to address large sequence lengths. Although there is communication required for the computation of the aligned sequences, the proper distribution can reduce the overall problem to a set of tasks to be solved independently and then merged. A parallel algorithm for the alignment of multiple genome sequences is described. The algorithm is experimentally evaluated in a distributed Grid environment that provides very scalable and low cost computation performance. The Grid environment is evaluated with respect to a traditional cluster environment and results are compared to evaluate the effectiveness of a Grid environment for large computational biology.
Computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a paral...
详细信息
Computing reversal distance of two signed permutations has gained increasing attention over the last decade with the study of genome rearrangements in computational molecular biology. In this paper, we present a parallel algorithm to computing reversal distance of two signed permutations. Our algorithm consists three parts and runs in O(lg2(n)) time using O(n2) processors in SIMD-CREW model.
As power systems continue to develop, realtime simulation and online dynamic security analysis using parallel computing are becoming increasingly important. This paper presents a novel multilevel partition scheme for ...
详细信息
ISBN:
(纸本)0769523803
As power systems continue to develop, realtime simulation and online dynamic security analysis using parallel computing are becoming increasingly important. This paper presents a novel multilevel partition scheme for parallel computing based on power network regional characteristics and describes the design and implementation of a hierarchical block bordered diagonal form (BBDF) algorithm for power network computation. Some optimization schemes are also proposed to reduce the computing and communication time and to improve the scalability of the program. The simulation results of a large network having 10188 nodes, 13499 branches, 1072 generators and 3003 loads show that the proposed algorithms and schemes running on a cluster system with 12 CPUs can provide a 15 times faster speed than the single CPU one, to satisfy the realtime simulation requirements for large scale power grids.
There is today an increasing diversity of parallel execution supports. New characteristics are influencing the execution of parallel applications, like for instance the hierarchical structure and the heterogeneity of ...
详细信息
There is today an increasing diversity of parallel execution supports. New characteristics are influencing the execution of parallel applications, like for instance the hierarchical structure and the heterogeneity of the processors. Designing efficient software that takes full advantages of such systems remains difficult Indeed, solving a target problem by using a single algorithm is not always efficient on any computational support. We present in this paper a poly-algorithmic approach for selecting the most suitable algorithm among various ones for given problem size and available metacomputing platform, like hierarchical clusters of SMPs (Symmetric Multi-Processors) which become more and more popular. Our principal objective here is to illustrate such an approach on the well-known matrix multiplication problem which is one of the most important basic numerical kernels
Many algorithms have been proposed in literature for digital film restoration; unfortunately, none of them ensures a perfect restoration whichever is the image sequence to be restored. In this paper, we adopt an appro...
详细信息
Many algorithms have been proposed in literature for digital film restoration; unfortunately, none of them ensures a perfect restoration whichever is the image sequence to be restored. In this paper, we adopt an approach to digital scratch restoration based on the combination of relatively well settled distinct techniques. We propose P-LSR, a parallel version focusing on strategies based on both task and data partitioning to achieve good load balancing, that well adapts also to be distributed. parallel performance is deeply investigated for several real image sequences.
Multiple sequences alignment is a fundamental and challenging problem in computational molecular biology. It is commonly used to analyse the DNA/protein sequences. To develop a high efficient parallel algorithm is a v...
详细信息
Multiple sequences alignment is a fundamental and challenging problem in computational molecular biology. It is commonly used to analyse the DNA/protein sequences. To develop a high efficient parallel algorithm is a very important solution to speedup this time consuming problem. However, due to the irregular computation behaviors based on tree, it is difficult to achieve good load balancing, so the utilization of processor is very low. This paper presents a parallel multiple sequences alignment algorithm featuring a mixed fine and coarse grained parallelization approach. The parallel algorithm is suitable to be implemented in SMP cluster, which is the main architecture of current cluster systems. We implemented the parallel algorithm in SMP cluster using a hybrid MPI/OpenMP method and the experimental results shows that the mixed fine and coarse algorithm achieves higher speedup
The main feature of neural network using for accuracy improvement of physical quantities (for example, temperature, humidity, pressure etc.) measurement by data acquisition systems is insufficient volume of input data...
详细信息
The main feature of neural network using for accuracy improvement of physical quantities (for example, temperature, humidity, pressure etc.) measurement by data acquisition systems is insufficient volume of input data for predicting neural network training at an initial exploitation period of sensors. The authors have proposed the technique of data volume increasing for predicting neural network training using integration of historical data method. In this paper we have proposed enhanced integration historical data method with its simulation results on mathematical models of sensor drift using single-layer and multi-layer perceptrons. We also considered a parallelization technique of enhanced integration historical data method in order to decrease its working time. A modified coarse-grain parallel algorithm with dynamic mapping on processors of parallel computing system using neural network training time as mapping criterion is considered. Fulfilled experiments have showed that modified parallel algorithm is more efficient than basic parallel algorithm with dynamic mapping, which does not use any mapping criterion.
暂无评论