No image available
An efficient implementation of search trees on 0(log n) processors
by Michael James Carey, University of California, Berkeley. Computer Science Division, Clark D. Thompson ยท 1982
ISBN: Unavailable
Category: Unavailable
Page count: 18
A scheme for maintaining a balanced search tree on O(lgN) parallel processors is described. O(lgN) search, insert, and delete operations are allowed to run concurrently, with each operation executing in O(lgN) timesteps. The scheme is based on pipelined versions of top-down 2-3-4 tree manipulation algorithms.