Thumbnail
Access Restriction
Subscribed

Author Goodrich, Michael T. ♦ Kosaraju, S. Rao
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword PRAM ♦ Cascade merging ♦ Expression evaluation ♦ Linking automaton ♦ Mergesort ♦ Parallel algorithms ♦ Pointer machine
Abstract We present optimal algorithms for sorting on parallel CREW and EREW versions of the pointer machine model. Intuitively, one can view our methods as being based on a parallel mergesort using linked lists rather than arrays (the usual parallel data structure). We also show how to exploit the “locality” of our approach to solve the set expression evaluation problem, a problem with applications to database querying and logic-programming in $\textit{O}(log$ $\textit{n})$ time using $\textit{O}(\textit{n})$ processors. Interestingly, this is an asymptotic improvement over what seems possible using previous techniques.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 2
Page Count 31
Starting Page 331
Ending Page 361


Open content in new tab

   Open content in new tab
Source: ACM Digital Library