IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-3352-7_7.html
   My bibliography  Save this book chapter

On optimal parallel computations for sequences of brackets

In: Sequences

Author

Listed:
  • Wojciech Rytter

    (Warsaw University, Institute of Informatics)

  • Krzysztof Diks

    (Warsaw University, Institute of Informatics)

Abstract

We present an optimal parallel algorithm (log2 n time, n/ log2 n processors) for computing the matching function for a sequence of brackets and for transforming sequences of brackets to trees on the parallel access machine without read and write conflicts (EREW PRAM). It gives also an optimal parallel transformation on EREW PRAM of texts of expressions and expression-trees. Previously an optimal parallel for this problem was known [2] on a stronger model of parallel computations (CREW PRAM), in [2] read conflicts were essential. It is not clear presently how big is the difference of the power of CREW and EREW PRAM’s. Our result implies optimal parallel algorithms on EREW PRAM for several other algorithmic problems which previously had optimal parallel algorithms only on a CREW PRAM: expression evaluation [1,3,5,7], recognition of input-driven languages [6], transforming regular expressions to finite automata [9] and parsing bracket languages [8]. The structure of our algorithm for computing the matching function is similar to that of Bar-on and Vishkin [2]. The matching function is computed in the preprocessing phase for a subset of O(n/ log2 n) brackets and later it guides the computation for all brackets. Our initial subset of brackets is a subset of that used in [2]. It is small enough to eliminate read conflicts in the preprocessing phase, however it complicates other phases.

Suggested Citation

  • Wojciech Rytter & Krzysztof Diks, 1990. "On optimal parallel computations for sequences of brackets," Springer Books, in: Renato M. Capocelli (ed.), Sequences, pages 92-102, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-3352-7_7
    DOI: 10.1007/978-1-4612-3352-7_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-3352-7_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.