A data preprocessing Model is discussed in this paper, which included processes of source data preparing, data cleaning, user recognition, dialog recognition, path supplementation and data formatting. In order to prom...
详细信息
ISBN:
(纸本)9781424437092
A data preprocessing Model is discussed in this paper, which included processes of source data preparing, data cleaning, user recognition, dialog recognition, path supplementation and data formatting. In order to promote compute efficiency and apply parallel technique to the algorithm, a parallel mining algorithm fitted to web log is put forward. And in the last, the feasibility of algorithm is verified by an instance.
In this paper, we briefly introduce the basic theory and method of tight-binding molecular dynamics(TBMD), and study the quantum oscillation of graphene at about the absolute zero Kelvin. By using the TBMD method and ...
详细信息
ISBN:
(纸本)9781612841021
In this paper, we briefly introduce the basic theory and method of tight-binding molecular dynamics(TBMD), and study the quantum oscillation of graphene at about the absolute zero Kelvin. By using the TBMD method and parallel program to simulate the graphene and analyzing the simulated results, we propose some improvements on computing the forces by perturbation and sparse matrix method.
In this paper,we present new formulae of point doubling,addition and tripling on Jacobi Quartics Curve in projective *** efficiency of new paralleled formulae increased 41%-49%.Simple power analysis is the most devast...
详细信息
In this paper,we present new formulae of point doubling,addition and tripling on Jacobi Quartics Curve in projective *** efficiency of new paralleled formulae increased 41%-49%.Simple power analysis is the most devastating attack to the security of elliptic curve scalar multiplication and can retrieve the secret key in some *** avoid this attack,a fast and secure side channel atomic parallel scalar multiplication algorithm is put *** with the previous methods,the new algorithm is more *** 192 bit scalar using NAF recoding,the efficiency of the new algorithm is increased by about 4.4%～56% if S/M=0.8 or 4.4%-61% if S/M=0.6.
The mean-time-between-failure of current high-performance computer systems is much shorter than the running times of many computational applications, whereas those applications are the main workload for those systems....
详细信息
ISBN:
(纸本)9783540768364
The mean-time-between-failure of current high-performance computer systems is much shorter than the running times of many computational applications, whereas those applications are the main workload for those systems. Currently, checkpoint/restart is the most commonly used scheme for such applications to tolerate hardware failures. But this scheme has its performance limitation when the number of processors becomes much larger. In this paper, we propose a novel fault-tolerant parallel algorithm FPAPR. First, we introduce the basic idea of FPAPR. Second, we specify the details of how to implement a FPAPR program by using two NPB kernels as examples. Third, we theoretically analyze the overhead of FPAPR, and find out that the overhead of FPAPR decreases with the increase of the number of processors. At last, the experimental results on a 512-CPU cluster show the overhead introduced by the algorithm is very small.
Mining frequent itemsets is a crucial issue in data mining applications. The complexity of the problem has been shown as NP-hard. parallel techniques are widely used to improve the efficiency of mining algorithms. A n...
详细信息
ISBN:
(纸本)9781934272084
Mining frequent itemsets is a crucial issue in data mining applications. The complexity of the problem has been shown as NP-hard. parallel techniques are widely used to improve the efficiency of mining algorithms. A novel and powerful parallel algorithm for mining maximal frequent itemsets, called P-MinMax, is proposed in this paper, which is based on its serial version MinMax. The new algorithm decomposes the search space by prefix-based equivalence classes, distributes work among the processors by complete inclusive relation between equivalence class gene itemsets and selectively duplicates databases in such a way that each processor can compute the frequent itemsets independently. These techniques eliminate the need for synchronization, drastically cutting down the I/O overhead. The analysis and experimental results demonstrate the superb efficiency of the approach in comparison with the previous work.
Let G be a connected graph with n vertices. A spanning tree of G is an acyclic subgraph of G that has n vertices and n - 1 edges. In this paper, we propose a simple optimal parallel algorithm for constructing a spanni...
详细信息
Let G be a connected graph with n vertices. A spanning tree of G is an acyclic subgraph of G that has n vertices and n - 1 edges. In this paper, we propose a simple optimal parallel algorithm for constructing a spanning tree of a trapezoid graph in O (log n) time with O (n / log n) processors on the EREW PRAM computational model.
In this paper, we propose a parallel algorithm for H.264/AVC deblocking filter which is scalable to the number of processors. Unlike the conventional approach, which is limited by the independent data units, the desig...
详细信息
ISBN:
(纸本)9781424410163
In this paper, we propose a parallel algorithm for H.264/AVC deblocking filter which is scalable to the number of processors. Unlike the conventional approach, which is limited by the independent data units, the designed algorithm allows issuing dependent data units concurrently to decrease the penalty from synchronization of data units. For the general-purpose dual-core processors, experimental results show that our method speeds up 1.72 and 1.39 times as compared with optimized sequential method and the well-known wavefront parallelizing method, respectively.
Existing algorithms in conic curves cryptosystem are all sequential ones. It is important to have fast parallel algorithms to both encrypt and decrypt data for cryptosystem on conic curves. This paper proposes our own...
详细信息
Existing algorithms in conic curves cryptosystem are all sequential ones. It is important to have fast parallel algorithms to both encrypt and decrypt data for cryptosystem on conic curves. This paper proposes our own parallel algorithms for conic curves cryptosystem over finite field Fp. Our main works are paralleling the basic multiple-precision integer algorithms and the point-addition operation on conic curves over finite field Fp. We also calculate the speedup ratio based on computing the runtime of sequential arithmetic and parallel arithmetic in this cryptosystem. The performance evaluation demonstrates that our methodology could reduce time complexity and improve efficiency for conic curves cryptosystem over finite field Fp.
A two-level hierarchical parallelization scheme including the second-order Moller-Plesset perturbation (MP2) theory in the divide-and-conquer method is presented. The scheme is a combination of coarse-grain paralleliz...
详细信息
A two-level hierarchical parallelization scheme including the second-order Moller-Plesset perturbation (MP2) theory in the divide-and-conquer method is presented. The scheme is a combination of coarse-grain parallelization assigning each subsystem to a group of processors, with fine-grain parallelization, where the computational tasks for evaluating MP2 correlation energy of the assigned subsystem are distributed among processors in the group. Test calculations demonstrate that the present scheme shows high parallel efficiency and makes MP2 calculations practical for very large molecules. (C) 2011 Wiley Periodicals, Inc. J Comput Chem 32: 2756-2764, 2011
The solution of reactive flows using fully implicit methods on distributed memory machines is investigated in detail. Three different parallel implementations of Newton's method are described and tested on the sol...
详细信息
The solution of reactive flows using fully implicit methods on distributed memory machines is investigated in detail. Three different parallel implementations of Newton's method are described and tested on the solution of two-dimensional laminar axisymmetric coflow diffusion flames. Each implementation has different computational requirements, both in the amount of communication among the processes and in the computational overhead due to the calculation of physical quantities at the interfaces between subdomains. An effective trade-off is established between communications and calculations so that the most communication-intensive implementation results in computational speedup only if the network is sufficiently fast. Benchmark results are presented for a variety of chemical mechanisms, grid decomposition techniques, and hardware. parallelization efficiencies of about 80% and speedups of 20-100 are reported for most test cases. The method developed here is well suited for complex chemistry problems with very large mechanisms;in particular, the numerical solution of a laminar axisymmetric JP-8/air coflow diffusion flame with a 222-species mechanism is made possible using this approach.
暂无评论