Algorithms for Search Trees on Message-passing Architectures

Author(s)
Colbrook, Adrian; Brewer, Eric A.; Dellarocas, Chrysanthos N.; Weihl, William E.
Thumbnail
DownloadMIT-LCS-TR-517.pdf (1.089Mb)
Metadata
Show full item record
Abstract
In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing MIMD architecture; the algorithm is particularly well suited for implementation on a small number of processors.
Date issued
1991-09
URI
https://hdl.handle.net/1721.1/149713
Series/Report no.
MIT-LCS-TR-517
Collections