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

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 s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Parallel and Distributed Processing, 2nd IEEE Symposium On s. 650 - 655
Hlavní autori: Weihl, W.E., Wang, P.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE Comput. Soc. Press 1990
Predmet:
Algorithm design and analysis
Analytical models
Computer science
Contracts
Delay
Laboratories
Memory management
Read-write memory
Technology management
ISBN:0818620870, 9780818620874
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.< >
ISBN:0818620870
9780818620874
DOI:10.1109/SPDP.1990.143621