Time optimal n-size matching parentheses and binary tree decoding algorithms on a p-processor BSR

Limin Xiang, Kazuo Ushijima, Jianjun Zhao

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.

Original languageEnglish
Pages (from-to)365-374
Number of pages10
JournalParallel Processing Letters
Volume12
Issue number3-4
Publication statusPublished - Sep 1 2002
Externally publishedYes

Fingerprint

Binary trees
Binary Tree
Decoding
Optimal Algorithm
Efficient Algorithms
Strings

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Cite this

Time optimal n-size matching parentheses and binary tree decoding algorithms on a p-processor BSR. / Xiang, Limin; Ushijima, Kazuo; Zhao, Jianjun.

In: Parallel Processing Letters, Vol. 12, No. 3-4, 01.09.2002, p. 365-374.

Research output: Contribution to journalArticle

@article{c9dc8c8fa2db443699ab09e523aa4b35,
title = "Time optimal n-size matching parentheses and binary tree decoding algorithms on a p-processor BSR",
abstract = "Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.",
author = "Limin Xiang and Kazuo Ushijima and Jianjun Zhao",
year = "2002",
month = "9",
day = "1",
language = "English",
volume = "12",
pages = "365--374",
journal = "Parallel Processing Letters",
issn = "0129-6264",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "3-4",

}

TY - JOUR

T1 - Time optimal n-size matching parentheses and binary tree decoding algorithms on a p-processor BSR

AU - Xiang, Limin

AU - Ushijima, Kazuo

AU - Zhao, Jianjun

PY - 2002/9/1

Y1 - 2002/9/1

N2 - Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.

AB - Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 < p < n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal.

UR - http://www.scopus.com/inward/record.url?scp=0036764464&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036764464&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0036764464

VL - 12

SP - 365

EP - 374

JO - Parallel Processing Letters

JF - Parallel Processing Letters

SN - 0129-6264

IS - 3-4

ER -