Parallel Searching in Generalized Monge Arrays
Algorithmica(1997)
摘要
. This paper investigates the parallel time and processor complexities of several searching problems involving Monge , staircase-Monge , and Monge-composite arrays. We present array-searching algorithms for concurrent-read-exclusive-write (CREW) PRAMs, hypercubes, and several hypercubic networks. All these algorithms run in near-optimal time, and their processor-time products are all within an O ( n) factor of the worst-case sequential bounds. Several applications of these algorithms are also given. Two applications improve previous results substantially, and the others provide novel parallel algorithms for problems not previously considered.
更多查看译文
关键词
Key words. Monge arrays, CREW-PRAM algorithms, Hypercubes.
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络