A Distributed Data-balanced Dictionary Based on the B-link tree
Author(s)
Johnson, Theodore; Colbrook, Adrian
DownloadMIT-LCS-TR-530.pdf (770.5Kb)
Metadata
Show full item recordAbstract
Many concurrent dictionary data structures have been proposed, but usually in the context of shared memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing paralle
Date issued
1992-02Series/Report no.
MIT-LCS-TR-530