A parallel algorithm for constrained optimization problems
β Scribed by Chen Zhong; Fei Pusheng
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 421 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc
The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used