Algorithms for Search Trees on Message-passing Architectures
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.
| Main Authors: | , , , |
|---|---|
| Udgivet: |
2023
|
| Online adgang: | https://hdl.handle.net/1721.1/149713 |
| Summary: | 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. |
|---|