By Topic

Time-space optimal parallel set operations

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)
Guan, X. ; Dept. of Comput. Sci., Washington State Univ., Pullman, WA, USA ; Langston, M.A.

The authors present parallel algorithms for the elementary binary set operations that, given an EREW PRAM (exclusive-read, exclusive-write parallel random-access memory) with k processors, operate on two sorted lists of total length n in O(n/k+log n) time and O(k) extra space, and are thus time-space optimal for any fixed value of kn/(log n). Moreover, the methods are completely general in that they are stable (records with identical keys retain their original relative order), they do not modify records (even temporarily) as they execute, and they require no information other than a record's key

Published in:

Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on

Date of Conference:

7-9 Mar 1990