We show that the problem of finding the element with the highest frequency in a set, the mode of the set, is bounded by the problem of sorting multisets. As a consequence, we obtained an improvement of the upper bound...
详细信息
We show that the problem of finding the element with the highest frequency in a set, the mode of the set, is bounded by the problem of sorting multisets. As a consequence, we obtained an improvement of the upper bound for finding the mode. This result was obtained by presenting an algorithm that requires linear time when the set is initially sorted. The same algorithm was parallelized to produce the first optimal parallel algorithm for finding the mode.
The author presents a parallel algorithm for finding a maximum 2-chain edge packing of an undirected graph G = (V, E). It runs in O(log n) time using O(n + m) processors on a CRCW PRAM, where n = !V! and m = !E!.
The author presents a parallel algorithm for finding a maximum 2-chain edge packing of an undirected graph G = (V, E). It runs in O(log n) time using O(n + m) processors on a CRCW PRAM, where n = !V! and m = !E!.
A new parallel algorithm for finding the maximum value of a data set is proposed. Execution times are investigated by taking into account the effect of the overhead time of communication for four kinds of interconnect...
详细信息
A new parallel algorithm for finding the maximum value of a data set is proposed. Execution times are investigated by taking into account the effect of the overhead time of communication for four kinds of interconnection networks; cube connection array, linear array, mesh array, and three-dimensional mesh array. The optimal numbers of processors are derived in the case where the number of processors is less than the number of data. Those are O (N 1 2 ), O (N 2 3 ), O (N 3 4 ), and O (N) , respectively, for linear array, mesh array, three-dimensional mesh array, and cube-connected arrays.
Extraction of two-dimensional object locations using current techniques is a computationally intensive process. In this paper a parallel algorithm is presented that can specify the location of objects from edge streak...
详细信息
Extraction of two-dimensional object locations using current techniques is a computationally intensive process. In this paper a parallel algorithm is presented that can specify the location of objects from edge streaks produced by an edge operator. Best-first searches are carried out in a number of non-interacting and localized edge streak spaces. The outcome of each search is a hypothesis. Each edge streak votes for a single hypothesis; it may also take part in the formation of other hypotheses. A poll of the votes determined the stronger hypotheses. The algorithm can be used as a ❉ end to a visual pattern recognition system where features are extracted from the hypothesized object boundary or from the area localized by the hypothesized boundary. Experimental results from a biomedical domain are presented.
This letter presents the modelling of a morphological thinning algorithm suggested by Jang and Chin [1] on the four models of shared memory SIMD computers. The time and cost complexity analyses for the models have bee...
详细信息
This letter presents the modelling of a morphological thinning algorithm suggested by Jang and Chin [1] on the four models of shared memory SIMD computers. The time and cost complexity analyses for the models have been given. The performance of this algorithm on SIMD computers has been compared with the performance of a conventional thinning algorithm [2] proposed recently.
We present a new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm [7] for the same problem. Next we propose a sui...
详细信息
We present a new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm [7] for the same problem. Next we propose a suitable VLSI systolic architecture to map our algorithm and evaluate the performance of the proposed architecture in terms of execution time and inter-processor communication time. We show that our implementation has O(log2n) execution time (compare-exchange time) and O(nlogn) communication time compared to O(nlogn) and O(n2) in [7].
All sequential algorithms for sampling select items one at a time, making updates to a data structure after each selection. None lends itself to a straightforward parallelization. A fast sampling algorithm, SAMPLE, ...
详细信息
All sequential algorithms for sampling select items one at a time, making updates to a data structure after each selection. None lends itself to a straightforward parallelization. A fast sampling algorithm, SAMPLE, is presented that works on the concurrent read, exclusive write parallel random access machine. SAMPLE is a parallel algorithm for drawing an unbiased random sample of M items from a population of size N, where N is typically much larger than M. It relies on the sorting permutation and its inverse. The sorted array and the permutation of the inverse are simultaneously obtained by sorting the tuples. When the population and the random sample are equal, SAMPLE generates a random permutation of N elements in O(log M) time with M processors. It uses O(M) space. The random numbers used in the algorithm may be generated by using a parallel pseudorandom number generator. The loop bounds in SAMPLE are also examined, yielding a theorem.
A new algorithm for molecular dynamics on the Connection Machine is presented and compared to an algorithm known from literature. The algorithms have been in implemented in CM Fortran 8x. Their performances, measured ...
详细信息
We introduce a parallel variant of a randomised heuristical algorithm for solving the problem of colouring vertices of a graph, which is known to be NP-complete. The algorithm is based on an inter-particle system from...
详细信息
We introduce a parallel variant of a randomised heuristical algorithm for solving the problem of colouring vertices of a graph, which is known to be NP-complete. The algorithm is based on an inter-particle system from statistical mechanics, namely on the antivoter model recently studied by Donnely and Welsh. Since the algorithm works locally, it is likely to be highly parallel. We simulate the parallel execution on a massively parallel machine to estimate the expected parallel time complexity. A weak convergence property of the parallel variant is proved.
暂无评论