We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

A Distributed Data-balanced Dictionary Based on the B-link tree

Thumbnail Image
Download
Name

MIT-LCS-TR-530.pdf

Size

770.58 KB

Format

Adobe PDF

Checksum (MD5)

d870c3dbdee76c54fcfbb14f8578fec6

Author(s)
Johnson, Theodore
•
Colbrook, Adrian
Date Issued
February 1992
Series/Report no.
MIT-LCS-TR-530
Abstract
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
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.