Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version)


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… (More)
DOI: 10.1145/226643.226670


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics