Constant time BSR solutions to parenthesis matching, tree decoding, and tree reconstruction from its traversals

Author

Stojmenovic, Ivan

Author_Institution

Dept. of Comput. Sci., Ottawa Univ., Ont., Canada

Volume

7

Issue

2

fYear

1996

fDate

2/1/1996 12:00:00 AM

Firstpage

218

Lastpage

224

Abstract

Recently Akl et al. introduced a new model of parallel computation, called BSR (broadcasting with selective reduction) and showed that it is more powerful than any CRCW PRAM and yet requires no more resources for implementation than even EREW PRAM. The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solutions to the parenthesis matching, decoding binary trees in bitstring representation, generating next tree shape in B-order, and the reconstruction of binary trees from their traversals, using the BSR model. They are the first constant time solutions to mentioned problems on any model of computation. The number of processors used is equal to the input size, for each problem. A new algorithm for sorting integers is also presented

Keywords

parallel algorithms; BSR solutions; binary trees; bitstring representation; broadcasting with selective reduction; decoding binary trees; next tree shape; parallel computation; parallel prefix; parenthesis matching; sorting; tree decoding; tree reconstruction; Binary trees; Broadcasting; Circuits; Computational modeling; Concurrent computing; Decoding; Phase change random access memory; Read-write memory; Shape; Sorting;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.485530

Filename

485530