Concept
Trie
Related publications (11)
A Fast, Reliable and Wide-voltage-range In-memory Computing Architecture
David Atienza Alonso, Marina Zapater Sancho, Alexandre Sébastien Julien Levisse, William Andrew Simon
In-Memory Computing (IMC) solutions, and particularly bitline computing in SRAM, appear promising as they mitigate one of the most energy consuming aspects in computation: data movement. In this work we propose a fast (2.4Ghz for bitwise operations and 2.4 ...
Association for Computing Machinery2019Accelerators for Data Processing
The explosive growth in digital data and its growing role in real-time analytics motivate the design of high-performance database management systems (DBMSs). Meanwhile, slowdown in supply voltage scaling has stymied improvements in core performance and ush ...
EPFL2015Designing ASCY-compliant Concurrent Search Data Structures
Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David, Tong Che
This report details the design of two new concurrent data structures, a hash table, called CLHT, and a binary search tree (BST), called BST-TK. Both designs are based on asynchronized concurrency (ASCY), a paradigm consisting of four complementary programm ...
2014Linearizability Is Not Always a Safety Property
Rachid Guerraoui, Eric Ruppert
We show that, in contrast to the general belief in the distributed computing community, linearizability, the celebrated consistency property, is not always a safety property. More specifically, we give an object for which it is possible to have an infinite ...
Springer International Publishing2014LAYOUT ASSESSMENT METHOD AND SYSTEM
Frank Grégoire Jean de Morsier, Virginia Estellers Casas, Nathalie Casati, Maria Gabrani
Candidate layout patterns can be assessed using a sparse pattern dictionary of known design layout patterns by determining sparse coefficients for each candidate pattern, reconstructing the respective candidate pattern, and determining reconstruction error ...
U.S. Patent and Trademark Office; U.S. DEPARTMENT OF COMMERCE2013Cache-Aware Lock-Free Concurrent Hash Tries
Martin Odersky, Aleksandar Prokopec
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each ...
2011Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp, Jörg Widmer
Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This is of particular interest when either absolute coordinates for geographic routing ...
2007Network of Shortcuts: An Adaptive Data Structure for Tree-Based Search Methods
In this work we present a novel concept of augmenting a search tree in a packet-processing system with an dditional data structure, a Network of Shortcuts, in order to adapt the search to current input traffic patterns and significantly speed-up the freque ...
2005Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees
With the appearance of Peer-to-Peer information systems the interest in scalable and decentralized data access structures is attracting increasingly interest. We propose to that end P-Grid, a scalable data access structure resulting from the distribution o ...
2002Ideal Hash Trees
Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant, indep ...
2001