The problem of mining hidden associations present in the large amounts of data has seen widespread applications in many practical domains such as customer-oriented planning and marketing, telecommunication network mon...
详细信息
Let T=(V, E) be a tree with vertex set V and edge set E. Let n=|V|. Each eisin/E has a non-negative length. In this paper, we first present an algorithm on the CREW PRAM for solving the V/V/r-dominating set problem on...
详细信息
In this paper based on the advantages of both optical transmission and electronic computation, we first provide an O(log log N) bus cycles parallel algorithm for the medial axis transform of an N/spl times/N binary im...
详细信息
ISBN:
(纸本)0769517609
In this paper based on the advantages of both optical transmission and electronic computation, we first provide an O(log log N) bus cycles parallel algorithm for the medial axis transform of an N/spl times/N binary image on a linear array with a reconfigurable pipelined bus system using N/sup 2/ processors. By increasing the number of processors, the proposed algorithm can be modified to run in O(log log/sub q/ N) and O(1) bus cycles using qN/sup 2/ and N/sup 2+1//spl isin// processors respectively, where 1/spl les/q/spl les//spl radic/N, /spl isin/ is a constant and /spl isin//spl ges/1. These results improve on previously known algorithms developed on various parallel computation models. Key Words: Medial axis transform, image processing, image compression, computer vision, parallel algorithms, linear array with a reconfigurable pipelined bus system.
The degree-constrained minimum spanning tree (d-MST) problem attempts to find a minimum spanning tree with an added constraint that no nodes in the tree have a degree larger than a specified integer d. It is known tha...
详细信息
The degree-constrained minimum spanning tree (d-MST) problem attempts to find a minimum spanning tree with an added constraint that no nodes in the tree have a degree larger than a specified integer d. It is known that computing the d-MST is NP-hard for every d in the range 2 /spl les/ d /spl les/ (n - 2), where n denotes the total number of nodes. Several approximate algorithms (heuristics) have been proposed in the literature. We have previously proposed three approximate algorithms, IR, TC-RNN, and TC-NNC, for solving the d-MST problem, the last two (TC-RNN and TC-NNC) take advantage of nearest neighbors and their properties. Our experimental results showed that both the TC-RNN and TC-NNC algorithms consistently produce spanning trees with a smaller weight (better quality-of-solution) than that of IR, but using slightly longer execution time. We propose a new heap traversal technique that further improves the time efficiency of TC-RNN and TC-NNC. Our experiments using randomly generated, weighted graphs as inputs show that the TC-NNC algorithm outperforms the other two approximate algorithms in terms of the execution time and quality-of-solution.
parallel processing is a promising technology to obtain on-line dynamic security assessment and real time simulation of power system. Many kinds of parallel computers have been used to implement the present algorithms...
详细信息
parallel processing is a promising technology to obtain on-line dynamic security assessment and real time simulation of power system. Many kinds of parallel computers have been used to implement the present algorithms. With the advantages of low cost, upgradability and scalability, PC cluster is attracting more and more attentions for parallel processing. In this paper, several parallel algorithms for transient stability simulation are discussed. The advantages and disadvantages of these algorithms on a PC cluster are of special concern. The parallel processing technologies discussed in the paper include network partition, linear equation solution, Newton type algorithms and some parallel-in-time algorithms.
The use of parallel computation for scientific research is so widespread today that it's easy to forget it started on a large scale as recently as the late 1980s. With the increasing attention given to parallel al...
详细信息
The use of parallel computation for scientific research is so widespread today that it's easy to forget it started on a large scale as recently as the late 1980s. With the increasing attention given to parallel algorithms for scientific research, researchers soon realized that certain common applications, such as Monte Carlo algorithms, were embarrassingly parallel: they required very little interprocessor communication and could be effectively deployed on networks of modest communications bandwidth, including the Internet.
View-Oriented parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into views according to the memory access pa...
详细信息
View-Oriented parallel Programming is based on Distributed Shared Memory which is friendly and easy for programmers to use. It requires the programmer to divide shared data into views according to the memory access pattern of the parallel algorithm. One of the advantages of this programming style is that it offers the performance potential for the underlying Distributed Shared Memory system to optimize consistency maintenance. Also it allows the programmer to participate in performance optimization of a program through wise partitioning of the shared data into views. In this paper, we compare the performance of View- Oriented parallel Programming against Message Passing Interface. Our experimental results demonstrate a performance gap between View-Oriented parallel Programming and Message Passing Interface. The contributing overheads behind the performance gap are discussed and analyzed, which sheds much light on further performance improvement of View-Oriented parallel Programming. Key Words: Distributed Shared Memory, View-based Consistency, View-Oriented parallel Programming, Cluster Computing, Message Passing Interface
暂无评论