Distributed Computing

We present the CBTree, a new counting-based self-adjusting binary search tree that, like splay trees, moves more frequently accessed nodes closer to the root. After m operations on n items, c of which access some item v, an operation on v traverses a path of length O(log m c ) while performing few if any rotations. In contrast to the traditional self-adjusting splay tree in which each accessed item is moved to the root through a sequence of tree rotations, the CBTree performs rotations infrequently (an amortized subconstant o(1) per operation ifm n), mostly at the bottom of the tree. As a result, the CBTree scales with the amount of concurrency. We adapt the CBTree to a multicore setting and show experimentally that it improves performance compared to existing concurrent search trees on non-uniform access sequences derived from real workloads.

[1]  Nancy A. Lynch,et al.  Distributed computation in dynamic networks , 2010, STOC '10.

[2]  Yoram Moses,et al.  Coordinated consensus in dynamic networks , 2011, PODC '11.

[3]  Shmuel Zaks,et al.  Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony , 2010, DISC.

[4]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[5]  Majid Khabbazian,et al.  The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology , 2012, ArXiv.

[6]  Andrea E. F. Clementi,et al.  Flooding time in edge-Markovian dynamic graphs , 2008, PODC '08.

[7]  Michel Raynal,et al.  Synchronous Set Agreement: a Concise Guided Tour (with open problems) , 2006 .

[8]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2005, J. Comb. Theory, Ser. B.

[9]  David R. Karger,et al.  Faster information dissemination in dynamic networks via network coding , 2011, PODC '11.

[10]  Andrea E. F. Clementi,et al.  Information Spreading in Stationary Markovian Evolving Graphs , 2011 .

[11]  Luca Trevisan,et al.  Information spreading in dynamic graphs , 2011, PODC '12.

[12]  Nancy A. Lynch,et al.  Structuring unreliable radio networks , 2011, PODC '11.

[13]  Andrea E. F. Clementi,et al.  Broadcasting in dynamic radio networks , 2009, J. Comput. Syst. Sci..

[14]  Chen Avin,et al.  How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) , 2008, ICALP.

[15]  Christoph Lenzen,et al.  Optimal gradient clock synchronization in dynamic networks , 2010, PODC.

[16]  Jennifer L. Welch,et al.  Neighbor discovery in mobile ad hoc networks using an abstract MAC layer , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Michel Raynal,et al.  The universe of symmetry breaking tasks , 2011, PODC '11.

[18]  Fabian Kuhn,et al.  Dynamic networks: models and algorithms , 2011, SIGA.

[19]  Rajmohan Rajaraman,et al.  Information Spreading in Dynamic Networks , 2011, ArXiv.

[20]  Nancy A. Lynch,et al.  Broadcasting in unreliable radio networks , 2010, PODC.

[21]  Nancy A. Lynch,et al.  Brief announcement: hardness of broadcasting in wireless networks with unreliable communication , 2009, PODC '09.

[22]  Nancy A. Lynch,et al.  MAC design for analog network coding , 2011, FOMC '11.

[23]  Pierre Fraigniaud,et al.  Parsimonious flooding in dynamic graphs , 2009, PODC '09.

[24]  Muriel Médard,et al.  One packet suffices - Highly efficient packetized Network Coding With finite memory , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[25]  Bernhard Haeupler,et al.  Analyzing Network Coding (Gossip) Made Easy , 2010, J. ACM.

[26]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[27]  Calvin C. Newport,et al.  Aggregation in dynamic networks , 2012, PODC '12.