A class of Adams-type parallel hybrid multistep algorithms is constructed. A-stable formula of 3-step 3rd order, A(α)-stable formula of 4-step 4th order with α = 89.99° and A(α)-stable formula of 5-step 5th or...
详细信息
A class of Adams-type parallel hybrid multistep algorithms is constructed. A-stable formula of 3-step 3rd order, A(α)-stable formula of 4-step 4th order with α = 89.99° and A(α)-stable formula of 5-step 5th order with α = 84.92° are obtained. The numerical example shows that these methods are efficient for solving stiff ordinary equations.
We present optimal parallel algorithms that run in time on mesh-connected computer for a number of fundamental problems concerning proximity and visibility in a simple polygon. These include computing shortest paths, ...
详细信息
We present optimal parallel algorithms that run in time on mesh-connected computer for a number of fundamental problems concerning proximity and visibility in a simple polygon. These include computing shortest paths, shortest path trees, shortest path partitions, all-farthest neighbors, the visibility polygon of a point, the weak visibility polygon of an edge, and the ray shooting problem.
In this paper, using the metric of iso--efficiency function [if. we analyze the scalability of PSRS (parallel. Sorting by Regular Sample) algorithm I2] on two popular architectures (Mesh and Hypercube) The Isoefficien...
详细信息
In this paper, using the metric of iso--efficiency function [if. we analyze the scalability of PSRS (parallel. Sorting by Regular Sample) algorithm I2] on two popular architectures (Mesh and Hypercube) The Isoefficiency function of PSRS on 2-dimensional mesh With p processors reaches the lower bound for that of sorting algorithms on this architecture. In nils sense, we say the scalabilify of PSRS is optimal on 2-dimensional mesh. The lso-efficiency function of PSRS on hypercube is equal to that of PSRS on 2-dimensional mesh. After changing the data exchanging scheme of PSRS, -cafe get a ne'v iso-efficiency function . which is better than that of PSRS on 2-dimensional mesh So we say that hypercube is more suitable for PSRS than 2--dimensional mesh.
This article describes the pack & unpack performance of the vector using YH-1 supercomputer as its platform, with its emphasis on the pack & unpack technique's unique application to vector computation, in ...
详细信息
This article describes the pack & unpack performance of the vector using YH-1 supercomputer as its platform, with its emphasis on the pack & unpack technique's unique application to vector computation, in the light of vector computer's characteristics and some practical cases. The practical numerical experiment proves that the pack & unpack techniques is a key method to the depth parallel development and vectorization research of large scale scientific computation project, and which is a highly effective method to vectorizing application programs.
We consider a new supercube architecture, a new interconnection network derived from the hypercube. The supcrcube retains the connectivity and diameter properties of the corresponding hypercube. The embedding of one i...
详细信息
We consider a new supercube architecture, a new interconnection network derived from the hypercube. The supcrcube retains the connectivity and diameter properties of the corresponding hypercube. The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. In this paper, the problem of embedding and reconfiguring complete binary tree structures is considered in a supercube with faulty nodes. We also propose a new method for embedding and reconfiguring complete binary trees in a faulty supercube. Furthermore, the results enable us to obtain a good method for embedding complete binary tree structures into a faulty supercube with n-expansion. The result enables us to obtain O(n2 - m2) faults which can be tolerated, where (n - 1) is the dimension of a supercube and (m - 1) is the height of a complete binary tree.
This paper presents a strategy to tackle the multiple sequence alignment (MSA) problem, which is one of the most important tasks in the biological sequence analysis. Its role is to align the sequences in their entiret...
详细信息
This paper presents a strategy to tackle the multiple sequence alignment (MSA) problem, which is one of the most important tasks in the biological sequence analysis. Its role is to align the sequences in their entirety to derive relationships and common characteristics between a set of protein or nucleotide sequences. The MSA problem was proved to be an NP-Hard problem. The proposed strategy incorporates a new idea based on the well-known divide-and-conquer paradigm. This paper presents a novel method of clustering sequences as a preliminary step to improve the final alignment;this decomposition can be used as an optimization procedure with any MSA aligner to explore promising alignments of the search space. In their solution, the authors proposed to align the clusters in a parallel and distributed way in order to benefit from parallel architectures. The strategy was tested using classical benchmarks like BAliBASE, Sabre, Prefab4, and Oxm, and the experimental results show that it gives good results by comparing to the other aligners.
Data currency is a temporal reference of the data, it reflects the degree to which the data is current with the world it models. Currency has a significant impact on the quality and value of the data. Once the time st...
详细信息
Data currency is a temporal reference of the data, it reflects the degree to which the data is current with the world it models. Currency has a significant impact on the quality and value of the data. Once the time stamp of the data is lost or tampered with, it is difficult to perform an absolute and precise repair. Based on data currency research, the basic currency rules were extended to support the parallelization of rule extraction and incremental updating and theoretically reduce the algorithm time complexity from O(n - 1) to O(log (n)). In practical experiments, the repair efficiency of multithreading is improved by up to 75.2% compared with single-threaded operation. According to the problems and requirements encountered in data cleaning, rulebased methods for relative currency repair and anomaly data detection were proposed, a relative currency repair algorithm was implemented, models for evaluating repair results were established, and the method of applying a repair algorithm to detect abnormal currency data was also discussed. The experimental results and analysis show that the extended currency rules that provide more valuable features are feasible and available, and the relative currency repair algorithm can effectively perform data currency repair and anomaly detection.
A new dynamic data structure has been proposed recently in 2011. There are several algorithms for matrix multiplication. But none of them has used r-train data structure for storing and multiplying the matrices. In th...
详细信息
A new dynamic data structure has been proposed recently in 2011. There are several algorithms for matrix multiplication. But none of them has used r-train data structure for storing and multiplying the matrices. In this paper algorithm for matrix multiplication using r-train for parallel machine has been proposed.
parallel processing of algorithms is an effective way to achieve higher performance on multiprocessor systems rather. During parallelization, it is critical to minimize the difference between the processing time for t...
详细信息
This paper presents a contour line generation parallel method based on quadratic isoparametric element. In this method, the whole area is divided into many quadratic isoparametric elements by means of finite element m...
详细信息
This paper presents a contour line generation parallel method based on quadratic isoparametric element. In this method, the whole area is divided into many quadratic isoparametric elements by means of finite element method. The contour line in each isoparametric element is generated in parallel, and the whole contour is assembled. The result shows that this method improves the computation efficiency under the condition that the precision can be guaranteed.
暂无评论