Priority differentiated subtree locking

A locking arrangement for data structures is provided that prevents deadlocks, but still allows different threads to simultaneously obtain locks on different nodes of a data structure for both read and write operations. The locking system will fail a request to lock one or more resources in a data s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	RHOTEN MATTHEW PAUL, SZILAGYI ZOLTAN C, SU PHILIP TI-FEI
Format:	Patent
Sprache:	eng
Schlagworte:	CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!