Algorithms for Search Trees on Message-passing Architectures

Colbrook, Adrian; Brewer, Eric A.; Dellarocas, Chrysanthos N.; Weihl, William E.

Algorithms for Search Trees on Message-passing Architectures

Download

Name

MIT-LCS-TR-517.pdf

Size

1.09 MB

Format

Adobe PDF

Checksum (MD5)

563f1eb40dfb8bb2457e603b664c56f9

Author(s)

Colbrook, Adrian

•

Brewer, Eric A.

•

Dellarocas, Chrysanthos N.

•

Weihl, William E.

Date Issued

September 1991

Series/Report no.

MIT-LCS-TR-517

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.

Persistent DSpace Link

https://hdl.handle.net/1721.1/149713