Multi-version memory: software cache management for concurrent B-trees

Authors:
Weihl; Wang
Affiliations:
Lab. for Comput. Sci., MIT, Cambridge, MA, USA;Lab. for Comput. Sci., MIT, Cambridge, MA, USA
Venue:
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Year:
1990

Citing 0
Cited 2

Distributing a search tree among a growing number of processors

SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Deleting keys of B-trees in parallel

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors describe a new concurrent B-tree algorithm. The algorithm is designed to work well in large-scale parallel or distributed systems in which the number of processors sharing the tree is large or the communication delay between processors (or between processors and the global memory for a shared-memory system) is large relative to the speed of local computation. The basis of the algorithm is an abstraction that is similar to coherent shared memory, but provides a weaker semantics; this abstraction is called multiversion memory. Multi-version memory uses caches but weakens the semantics of ordinary shared memory by allowing process reading data to be given an old version of the data. This semantics is adequate for the non-leaf nodes in the B-tree algorithms presented.