Mostra el registre d'ítem simple
HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees
dc.contributor.author | Messeguer Peypoch, Xavier |
dc.contributor.author | Valles Fuente, Borja |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-03-09T12:41:21Z |
dc.date.available | 2016-03-09T12:41:21Z |
dc.date.issued | 1998-03 |
dc.identifier.citation | Messeguer, X., Valles, B. "HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees". 1998. |
dc.identifier.uri | http://hdl.handle.net/2117/84042 |
dc.description.abstract | We introduce a relaxed version of RedBlack trees. As concurrent algorithms on balanced search trees are nowadays based on local rules, we propose a set of fine-grained local rules that take more advantage of concurrency that previous approaches. Based on them we design a rebalancing concurrent algorithm and prove its correctness. Finally we sketch how to complete this algorithm to include concurrent insertions and deletions. |
dc.format.extent | 16 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-98-13-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | RedBlack trees |
dc.subject.other | Concurrent algorithms |
dc.subject.other | Concurrent rebalancing |
dc.subject.other | Safety and liveness proofs |
dc.subject.other | Local rules |
dc.title | HyperChromatic trees: a fine-grained approach to distributed algorithms on RedBlack trees |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1838251 |
dc.description.version | Postprint (published version) |
local.citation.author | Messeguer, X.; Valles, B. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]