Worst case analysis of TreeMap data structure - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Worst case analysis of TreeMap data structure

Frédéric Fauberteau
  • Function : Author
  • PersonId : 763574
  • IdRef : 158897382
Serge Midonnet


Data structures with relaxed balance eases the update of shared resources on asynchronous parallel architectures. This improvement is obtained by a better locking scheme of the data structure. In this paper, we describe the complexity and analyze the worst case cost of access operations on such a structure. We propose a data structure with the same properties as Java TreeMap but implemented with chromatic search tree; a tree with relaxed balance. The aim of our structure is to provide a more efficient TreeMap we can use in concurrent and real-time applications.
Fichier principal
Vignette du fichier
jrwrtc2008.pdf (80.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00628464 , version 1 (19-03-2013)


  • HAL Id : hal-00628464 , version 1


Frédéric Fauberteau, Serge Midonnet. Worst case analysis of TreeMap data structure. 2nd Junior Researcher Workshop on Real-Time Computing (JRWRTC'08), Oct 2008, Rennes, France. pp.33-36. ⟨hal-00628464⟩
142 View
890 Download


Gmail Facebook Twitter LinkedIn More