ANSV Problem on BSRs

Abstract Optimal parallel algorithms for the ANSV ( All Nearest Smaller Values ) problem are known on CREW, CRCW, and EREW PRAMs, and on the Hypercube. In this paper, optimal parallel algorithms of constant time for the ANSV problem are discussed on BSR (broadcasting with selective reduction), BSR with multiple criteria, and BSR + . The solution in this paper is the first constant time solution to the ANSV problem on any model of computation.

[1]  Albert Y. Zomaya.  Parallel and Distributed Computing Handbook , 1995 .

[2]  Ivan Stojmenovic,et al.  Constant Time BSR Solutions to Parenthesis Matching, Tree Decoding, and Tree Reconstruction From Its Traversals , 1996, IEEE Trans. Parallel Distributed Syst..

[3]  Selim G. Akl,et al.  An Optimal Implementation of Broadcasting with Selective Reduction , 1993, IEEE Trans. Parallel Distributed Syst..

[4]  Ivan Stojmenovic,et al.  An Efficient Implementation for the BROADCAST Instruction of BSR+ , 1999, IEEE Trans. Parallel Distributed Syst..

[5]  Ivan Stojmenovic,et al.  Multiple criteria BSR: an implementation and applications to computational geometry problems , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[6]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[7]  Danny Ziyi Chen,et al.  Efficient Geometric Algorithms on the EREW PRAM , 1995, IEEE Trans. Parallel Distributed Syst..

[8]  C. Greg Plaxton,et al.  All Nearest Smaller Values on the Hypercube , 1996, IEEE Trans. Parallel Distributed Syst..

[9]  Selim G. Akl,et al.  Broadcasting with Selective Reduction , 1989, IFIP Congress.

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