By Topic

A cost-optimal parallel algorithm for the parentheses matching problem on an EREW PRAM

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chen, C.C.-Y. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Das, S.K.

The article presents a cost-optimal parallel algorithm for the parentheses matching problem on the EREW PRAM model. For n parentheses, the algorithm requires O(n/p+log n) time and O(n+p log p) space, employing p processors. Thus, for pn/log n, it achieves optimal speedup, requiring O(log n ) time and O(n) space. Though the time complexity of the algorithm is comparable with those of the two existing cost-optimal algorithms on the same model, the new approach is simpler and utilizes an extended prefix-sum algorithm. Furthermore, its space requirement employs only (n/log n) processors

Published in:

Parallel Processing Symposium, 1991. Proceedings., Fifth International

Date of Conference:

30 Apr-2 May 1991