The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and cos...
详细信息
Let A = (aij) be a nonsingular n×n integer matrix such that log A ≤ no(1), maxi,j |aij| ≤ A ≤ n maxi,j |aij|. Then adj A, A−1 and all the coefficients of the characteristic polynomial of A including det A can ...
详细信息
One of the important problems in parallel computing is the mapping of the parallel algorithm to the parallel computing platform. Hereby, for each parallel node the corresponding code for the parallel nodes must be imp...
详细信息
This paper describes usage of CUDA parallelization scheme for forward and inverse gravity problems for structural boundaries. For- ward problem is calculated using the finite elements approach. This means that the who...
详细信息
This paper describes usage of CUDA parallelization scheme for forward and inverse gravity problems for structural boundaries. For- ward problem is calculated using the finite elements approach. This means that the whole calculation volume is split into parallelepipeds and then the gravity effect of each is calculated using known formula. In- verse problem solution is found using iteration local corrections method. This method requires only forward problem calculation on each iteration and does not use the operator inversion. Obtained results show that even cheap consumer video cards are highly effective for algorithm parallelization.
This paper analyzes energy characteristics of parallel algorithms executed on scalable multicore processors. Specifically, we provide a methodology for evaluating energy scalability of parallel algorithms while satisf...
详细信息
We develop a nature-inspired generic programming language for parallel algorithms, one that works for all data structures and control structures. Any parallel algorithm satisfying intuitively-appealing postulates can ...
详细信息
parallel forms of algorithms for the computation of multiple weighted sums are obtained. Appropriate models of parallel-pipelined VLSI array processors are synthesized. The number of processor elements is independent ...
详细信息
parallel forms of algorithms for the computation of multiple weighted sums are obtained. Appropriate models of parallel-pipelined VLSI array processors are synthesized. The number of processor elements is independent of the multiplicity of sums to be calculated. The asymptotic load of the array processors is equal or close to 1.
We propose three synchronous parallel algorithms for scalable parallel test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI ...
详细信息
We propose three synchronous parallel algorithms for scalable parallel test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors. The test set partitioning inherent in the algorithms overcomes the good circuit logic simulation bottleneck that exists in traditional fault partitioned approaches to parallel fault simulation. The implementations were done on a shared memory multiprocessor and on a network of workstations. Two of the algorithms show a small degree of pessimism in a few cases, with respect to the fault coverage as compared with a uniprocessor run, while the third algorithm provides the same results as in a uniprocessor run. All algorithms provide excellent speedups and perform much better than a traditional fault partitioned approach, on both shared and distributed memory parallel platforms.
We propose in this paper two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI c...
详细信息
We propose in this paper two new asynchronous parallel algorithms for test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors. These algorithms provide the same result as the previous synchronous two stage approach. However, due to the dynamic characteristics of these algorithms and due to the fact that there is very minimal redundant work, they run faster than the previous synchronous approach. A theoretical analysis comparing the various algorithms is also given to provide an insight into these algorithms. The implementations were done in MPI and are therefore portable to many parallel platforms. Results are shown for a shared memory multiprocessor.
Animation of algorithms makes understanding them intuitively easier. This paper describes the software tool Raft (Robust Animator of Fault Tolerant algorithms) which allows the user to animate a number of fault tolera...
详细信息
暂无评论