论文信息 - A faster parallel algorithm for a matrix searching problem

A faster parallel algorithm for a matrix searching problem

We give an improved parallel algorithm for the problem of computing the tube minima of a totally monotonen ×n ×n matrix, an important matrix searching problem that was formalized by Aggarwal and Park and has many applications. Our algorithm runs inO(log logn) time withO(n2/log logn) processors in theCRCW-PRAM model, whereas the previous best ran inO((log logn)2) time withO(n2/(log logn)2 processors, also in theCRCW-PRAM model. Thus we improve the speed without any deterioration in thetime ×processors product. Our improved bound immediately translates into improvedCRCW-PRAM bounds for the numerous applications of this problem, including string editing, construction of Huffmann codes and other coding trees, and many other combinatorial and geometric problems.

Mikhail J. Atallah

[1] Mikhail J. Atallah,et al. Efficient Parallel Algorithms for String Editing and Related Problems , 1990, SIAM J. Comput..

[2] Uzi Vishkin,et al. Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[3] Leslie G. Valiant,et al. Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[4] Mikhail J. Atallah,et al. Constructing trees in parallel , 1989, SPAA '89.

[5] Richard P. Brent,et al. The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[6] F. Frances Yao,et al. Efficient dynamic programming using quadrangle inequalities , 1980, STOC '80.

[7] Alok Aggarwal,et al. Parallel searching in generalized Monge arrays with applications , 1990, SPAA '90.

[8] Mikhail J. Atallah,et al. An efficient parallel algorithm for the row minima of a totally monotone matrix , 1991, SODA '91.