On the performance of concurrent tree algorithms

Various algorithms have been proposed to allow independent concurrent processes to access shared tree-structured objects, while guaranteeing that the object remains in a consistent state. Although algorithms can be classified as either “optimistic” or “conservative,” on the basis of their approach t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of parallel and distributed computing 1990-03, Vol.8 (3), p.253-266
Hauptverfasser:	Ford, Ray, Dipping, Michael J., Shultz, Roger, Wenhardt, Brion
Format:	Artikel
Sprache:	eng
Schlagworte:	ALGORITHMS ANALYTICAL SOLUTION Applied sciences ARRAY PROCESSORS Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE MATHEMATICAL LOGIC PARALLEL PROCESSING PROGRAMMING 990200 > Mathematics & Computers SIMULATION Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!