DOCSLIB.ORG

How Caching Affects Hashing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
How Caching Affects Hashing How Caching Affects Hashing∗ Gregory L. Heileman [email protected] Department of Electrical and Computer Engineering University of New Mexico, Albuquerque, NM Wenbin Luo [email protected] Engineering Department St. Mary’s University, San Antonio, TX Abstract Thus, for general-purpose use, a practitioner is well-advised A number of recent papers have considered the influence of to choose double hashing over linear probing. Explanations modern computer memory hierarchies on the performance are provided as to why these results differ from those previ- of hashing algorithms [1, 2, 3]. Motivation for these papers ously reported. is drawn from recent technology trends that have produced an ever-widening gap between the speed of CPUs and the 1 Introduction. latency of dynamic random access memories. The result is In the analysis of data structures and algorithms, an an emerging computing folklore which contends that inferior abstract view is generally taken of computer memory, hash functions, in terms of the number of collisions they pro- treating it as a linear array with uniform access times. duce, may in fact lead to superior performance because these Given this assumption, one can easily judge two com- collisions mainly occur in cache rather than main memory. peting algorithms for solving a particular problem—the This line of reasoning is the antithesis of that used to jus- superior algorithm is the one that executes fewer in- tify most of the improvements that have been proposed for structions. In real computer architectures, however, the open address hashing over the past forty years. Such im- assumption that every memory access has the same cost provements have generally sought to minimize collisions by is not valid. We will consider the general situation of a spreading data elements more randomly through the hash memory hierarchy that consists of cache memory, main table. Indeed the name “hashing itself is meant to con- memory, and secondary storage that is utilized as vir- vey this notion [12]. However, the very act of spreading tual memory. As one moves further from the CPU in the data elements throughout the table negatively impacts this hierarchy, the memory devices become slower as their degree of spatial locality in computer memory, thereby their capacity become larger. Currently, the typical sit- increasing the likelihood of cache misses during long probe uation involves cache memory that is roughly 100 times sequences. In this paper we study the performance trade- faster than main memory, and main memory that is offs that exist when implementing open address hash func- roughly 10,000 times faster than secondary storage [10]. tions on contemporary computers. Experimental analyses In our model of the memory hierarchy, we will treat are reported that make use of a variety of different hash cache memory as a unified whole, making no distinc- functions, ranging from linear probing to highly “chaotic tion between L1 and L2 cache. forms of double hashing, using data sets that are justified It is well known that the manner in which memory through information-theoretic analyses. Our results, con- devices are utilized during the execution of a program trary to those in a number of recently published papers, show can dramatically impact the performance of the pro- that the savings gained by reducing collisions (and therefore gram. That is, it is not just the raw quantity of memory probe sequence lengths) usually compensate for any increase accesses that determines the running time of an algo- in cache misses. That is, linear probing is usually no better rithm, but the nature of these memory accesses is also than, and in some cases performs far worse than double hash important. Indeed, it is possible for an algorithm with functions that spread data more randomly through the table. a lower instruction count that does not effectively use cache memory to actually run slower than an algorithm ∗We wish to thank to Bernard Moret for suggesting this topic with a higher instruction count that does make efficient to us. use of cache. A number of recent papers have considered and double hashing on modern architectures. This is this issue [1, 2, 13, 14], and the topic of “cache-aware” followed in Section 5 by a description of a set of exper- programming is gaining in prominence [4, 6, 15]. iments that used these synthetic data sets to measure In this paper we conduct analyses of open address the actual performance of the aforementioned hashing hashing algorithms, taking into account the memory ac- algorithms. Three important performance factors con- cess patterns that result from implementing these algo- sidered are the number of probes (and therefore memory rithms on modern computing architectures. We begin in accesses) required during the search process, the num- Section 2 with a description of open address hashing in ber of cache misses generated by the particular probe general, and then we present three specific open address sequence, and the load factor of the hash table. In ad- hashing algorithms, including linear probing, linear dou- dition, we also consider how the size of the hash table, ble hashing, and exponential double hashing. We dis- and the size of the data elements stored in the hash ta- cuss the memory access patterns that each of these algo- ble affect performance. In general, hash functions that rithms should produce when implemented, with particu- produce highly random probe sequences lead to shorter lar considerations given to interactions with cache mem- searches, as measured by the number of memory ac- ory. These access patterns have a high degree of spatial cesses, but are also more likely to produce cache misses locality in the case of linear probing, and a much lower while processing these memory access requests. Our ex- degree of spatial locality in the case of double hashing. periments were aimed at quantifying the net affects of Indeed, the exponential double hashing algorithm that these competing phenomena, along with the impact of we describe creates memory access patterns very simi- the other performance factors we have just mentioned, lar to those of uniform hashing, which tends to produce on the overall performance of open address hashing algo- the optimal situation in terms of memory accesses, but rithms. The results, presented in Section 5, show that it is also the worst case in terms of spatial locality. is difficult to find cases, either real or contrived, whereby In Section 3 previous research results dealing with linear probing outperforms double hashing. However, it open addressing hashing are presented. First we de- is easy to find situations where linear probing performs scribe theoretical results that show double hashing far worse than double hashing, particularly when real- closely approximates uniform hashing, under the as- istic data distributions are considered. sumption that data elements are uniformly distributed. It was subsequently shown experimentally that the per- 2 Open Address Hashing. formance of linear double hashing diverges significantly We assume hashing with open addressing used to resolve from that of uniform hashing when skewed data dis- collisions. The data elements stored in the hash table tributions are used, and that in the case of exponen- are assumed to be from the dynamic dictionary D. Each tial double hashing this divergence is not as severe [20]. data element x D has a key value kx, taken from the Thus, exponential double hashing is the best choice if universe U of possible∈ key values, that is used to identify the goal is to minimize the raw number of memory ac- the data element. The dynamic dictionary operations cesses. These results, however, do not consider how of interest include: cache memory may impact performance. Thus in Sec- tion 3 we also review a number of recent experimental Find (k, D). Returns the element x D such that • ∈ results that have been used to make the case that, due to kx = k, if such an element exists. modern computer architectures, linear probing is gen- Insert(x, D). Adds element x to D using kx. • erally a better choice than double hashing. We provide Delete(k, D). Removes the element x D that • ∈ detailed analyses of these studies, pointing out the flaws satisfies kx = k, if such an element exists. that lead to this erroneous conclusion. When implementing these operations using a hash table It is important to note that dynamic dictionary data with m slots, a table index is computed from the key sets are often too small to be directly used to test cache value using a ordinary hash function, h, that performs effects. For example, the number of unique words in the mapping h : U ZZ , where ZZ denotes the set the largest data set available in the DIMACS Dictionary m m 0, 1, . , m 1 . → Tests challenge, joyce.dat, will fit in the cache memory { Hashing− with} open addressing uses the mapping H : of most modern computers. Thus, in Section 4 we de- U ZZ ZZ , where ZZ= 0, 1, 2,... , and produces the scribe an information-theoretic technique that allows us × → m { } probe sequence < H(0, k),H(1, k),H(2, k), . > [18]. to create large synthetic data sets that are based on real For a hash table containing m slots, there can be at data sets such as joyce.dat. These data sets are there- most m unique elements in a probe sequence. A full fore realistic, yet large enough to create the cache effects length probe sequence visits all m hash table locations necessary to study the performance of linear probing using only m probes. One of the key factors affecting the length of a probe sequence needed to implement any of A second approach involves using a more compli- the dynamic dictionary operations is the load factor, cated ordinary hash function h( ) so that the initial α, of the hash table, which is defined as the ratio of probe into the hash table is more· random.
Load more

Recommended publications
  • Linear Probing with Constant Independence
    Linear Probing with Constant Independence Anna Pagh∗ Rasmus Pagh∗ Milan Ruˇzic´ ∗ ABSTRACT 1. INTRODUCTION Hashing with linear probing dates back to the 1950s, and Hashing with linear probing is perhaps the simplest algo- is among the most studied algorithms. In recent years it rithm for storing and accessing a set of keys that obtains has become one of the most important hash table organiza- nontrivial performance. Given a hash function h, a key x is tions since it uses the cache of modern computers very well. inserted in an array by searching for the first vacant array Unfortunately, previous analyses rely either on complicated position in the sequence h(x), h(x) + 1, h(x) + 2,... (Here, and space consuming hash functions, or on the unrealistic addition is modulo r, the size of the array.) Retrieval of a assumption of free access to a truly random hash function. key proceeds similarly, until either the key is found, or a Already Carter and Wegman, in their seminal paper on uni- vacant position is encountered, in which case the key is not versal hashing, raised the question of extending their anal- present in the data structure. Deletions can be performed ysis to linear probing. However, we show in this paper that by moving elements back in the probe sequence in a greedy linear probing using a pairwise independent family may have fashion (ensuring that no key x is moved beyond h(x)), until expected logarithmic cost per operation. On the positive a vacant array position is encountered. side, we show that 5-wise independence is enough to ensure Linear probing dates back to 1954, but was first analyzed constant expected time per operation.
    [Show full text]
  • CSC 344 – Algorithms and Complexity Why Search?
    CSC 344 – Algorithms and Complexity Lecture #5 – Searching Why Search? • Everyday life -We are always looking for something – in the yellow pages, universities, hairdressers • Computers can search for us • World wide web provides different searching mechanisms such as yahoo.com, bing.com, google.com • Spreadsheet – list of names – searching mechanism to find a name • Databases – use to search for a record • Searching thousands of records takes time the large number of comparisons slows the system Sequential Search • Best case? • Worst case? • Average case? Sequential Search int linearsearch(int x[], int n, int key) { int i; for (i = 0; i < n; i++) if (x[i] == key) return(i); return(-1); } Improved Sequential Search int linearsearch(int x[], int n, int key) { int i; //This assumes an ordered array for (i = 0; i < n && x[i] <= key; i++) if (x[i] == key) return(i); return(-1); } Binary Search (A Decrease and Conquer Algorithm) • Very efficient algorithm for searching in sorted array: – K vs A[0] . A[m] . A[n-1] • If K = A[m], stop (successful search); otherwise, continue searching by the same method in: – A[0..m-1] if K < A[m] – A[m+1..n-1] if K > A[m] Binary Search (A Decrease and Conquer Algorithm) l ← 0; r ← n-1 while l ≤ r do m ← (l+r)/2 if K = A[m] return m else if K < A[m] r ← m-1 else l ← m+1 return -1 Analysis of Binary Search • Time efficiency • Worst-case recurrence: – Cw (n) = 1 + Cw( n/2 ), Cw (1) = 1 solution: Cw(n) = log 2(n+1) 6 – This is VERY fast: e.g., Cw(10 ) = 20 • Optimal for searching a sorted array • Limitations: must be a sorted array (not linked list) binarySearch int binarySearch(int x[], int n, int key) { int low, high, mid; low = 0; high = n -1; while (low <= high) { mid = (low + high) / 2; if (x[mid] == key) return(mid); if (x[mid] > key) high = mid - 1; else low = mid + 1; } return(-1); } Searching Problem Problem: Given a (multi)set S of keys and a search key K, find an occurrence of K in S, if any.
    [Show full text]
  • Implementing the Map ADT Outline
    Implementing the Map ADT Outline ´ The Map ADT ´ Implementation with Java Generics ´ A Hash Function ´ translation of a string key into an integer ´ Consider a few strategies for implementing a hash table ´ linear probing ´ quadratic probing ´ separate chaining hashing ´ OrderedMap using a binary search tree The Map ADT ´A Map models a searchable collection of key-value mappings ´A key is said to be “mapped” to a value ´Also known as: dictionary, associative array ´Main operations: insert, find, and delete Applications ´ Store large collections with fast operations ´ For a long time, Java only had Vector (think ArrayList), Stack, and Hashmap (now there are about 67) ´ Support certain algorithms ´ for example, probabilistic text generation in 127B ´ Store certain associations in meaningful ways ´ For example, to store connected rooms in Hunt the Wumpus in 335 The Map ADT ´A value is "mapped" to a unique key ´Need a key and a value to insert new mappings ´Only need the key to find mappings ´Only need the key to remove mappings 5 Key and Value ´With Java generics, you need to specify ´ the type of key ´ the type of value ´Here the key type is String and the value type is BankAccount Map<String, BankAccount> accounts = new HashMap<String, BankAccount>(); 6 put(key, value) get(key) ´Add new mappings (a key mapped to a value): Map<String, BankAccount> accounts = new TreeMap<String, BankAccount>(); accounts.put("M",); accounts.put("G", new BankAcnew BankAccount("Michel", 111.11)count("Georgie", 222.22)); accounts.put("R", new BankAccount("Daniel",
    [Show full text]
  • Hash Tables & Searching Algorithms
    Search Algorithms and Tables Chapter 11 Tables • A table, or dictionary, is an abstract data type whose data items are stored and retrieved according to a key value. • The items are called records. • Each record can have a number of data fields. • The data is ordered based on one of the fields, named the key field. • The record we are searching for has a key value that is called the target. • The table may be implemented using a variety of data structures: array, tree, heap, etc. Sequential Search public static int search(int[] a, int target) { int i = 0; boolean found = false; while ((i < a.length) && ! found) { if (a[i] == target) found = true; else i++; } if (found) return i; else return –1; } Sequential Search on Tables public static int search(someClass[] a, int target) { int i = 0; boolean found = false; while ((i < a.length) && !found){ if (a[i].getKey() == target) found = true; else i++; } if (found) return i; else return –1; } Sequential Search on N elements • Best Case Number of comparisons: 1 = O(1) • Average Case Number of comparisons: (1 + 2 + ... + N)/N = (N+1)/2 = O(N) • Worst Case Number of comparisons: N = O(N) Binary Search • Can be applied to any random-access data structure where the data elements are sorted. • Additional parameters: first – index of the first element to examine size – number of elements to search starting from the first element above Binary Search • Precondition: If size > 0, then the data structure must have size elements starting with the element denoted as the first element. In addition, these elements are sorted.
    [Show full text]
  • Pseudorandom Data and Universal Hashing∗
    CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing∗ Tim Roughgardeny April 14, 2014 1 Motivation: Linear Probing and Universal Hashing This lecture discusses a very neat paper of Mitzenmacher and Vadhan [8], which proposes a robust measure of “sufficiently random data" and notes interesting consequences for hashing and some related applications. We consider hash functions from N = f0; 1gn to M = f0; 1gm. Canonically, m is much smaller than n. We abuse notation and use N; M to denote both the sets and the cardinalities of the sets. Since a hash function h : N ! M is effectively compressing a larger set into a smaller one, collisions (distinct elements x; y 2 N with h(x) = h(y)) are inevitable. There are many way of resolving collisions. One that is common in practice is linear probing, where given a data element x, one starts at the slot h(x), and then proceeds to h(x) + 1, h(x) + 2, etc. until a suitable slot is found. (Either an empty slot if the goal is to insert x; or a slot that contains x if the goal is to search for x.) The linear search wraps around the table (from slot M − 1 back to 0), if needed. Linear probing interacts well with caches and prefetching, which can be a big win in some application. Recall that every fixed hash function performs badly on some data set, since by the Pigeonhole Principle there is a large data set of elements with equal hash values. Thus the analysis of hashing always involves some kind of randomization, either in the input or in the hash function.
    [Show full text]
  • Collisions There Is Still a Problem with Our Current Hash Table
    18.1 Hashing 1061 Since our mapping from element value to preferred index now has a bit of com- plexity to it, we might turn it into a method that accepts the element value as a parameter and returns the right index for that value. Such a method is referred to as a hash function , and an array that uses such a function to govern insertion and deletion of its elements is called a hash table . The individual indexes in the hash table are also sometimes informally called buckets . Our hash function so far is the following: private int hashFunction(int value) { return Math.abs(value) % elementData.length; } Hash Function A method for rapidly mapping between element values and preferred array indexes at which to store those values. Hash Table An array that stores its elements in indexes produced by a hash function. Collisions There is still a problem with our current hash table. Because our hash function wraps values to fit in the array bounds, it is now possible that two values could have the same preferred index. For example, if we try to insert 45 into the hash table, it maps to index 5, conflicting with the existing value 5. This is called a collision . Our imple- mentation is incomplete until we have a way of dealing with collisions. If the client tells the set to insert 45 , the value 45 must be added to the set somewhere; it’s up to us to decide where to put it. Collision When two or more element values in a hash table produce the same result from its hash function, indicating that they both prefer to be stored in the same index of the table.
    [Show full text]
  • Cuckoo Hashing
    Cuckoo Hashing Outline for Today ● Towards Perfect Hashing ● Reducing worst-case bounds ● Cuckoo Hashing ● Hashing with worst-case O(1) lookups. ● The Cuckoo Graph ● A framework for analyzing cuckoo hashing. ● Analysis of Cuckoo Hashing ● Just how fast is cuckoo hashing? Perfect Hashing Collision Resolution ● Last time, we mentioned three general strategies for resolving hash collisions: ● Closed addressing: Store all colliding elements in an auxiliary data structure like a linked list or BST. ● Open addressing: Allow elements to overflow out of their target bucket and into other spaces. ● Perfect hashing: Choose a hash function with no collisions. ● We have not spoken on this last topic yet. Why Perfect Hashing is Hard ● The expected cost of a lookup in a chained hash table is O(1 + α) for any load factor α. ● For any fixed load factor α, the expected cost of a lookup in linear probing is O(1), where the constant depends on α. ● However, the expected cost of a lookup in these tables is not the same as the expected worst-case cost of a lookup in these tables. Expected Worst-Case Bounds ● Theorem: Assuming truly random hash functions, the expected worst-case cost of a lookup in a linear probing hash table is Ω(log n). ● Theorem: Assuming truly random hash functions, the expected worst-case cost of a lookup in a chained hash table is Θ(log n / log log n). ● Proofs: Exercise 11-1 and 11-2 from CLRS. ☺ Perfect Hashing ● A perfect hash table is one where lookups take worst-case time O(1). ● There's a pretty sizable gap between the expected worst-case bounds from chaining and linear probing – and that's on expected worst-case, not worst-case.
    [Show full text]
  • Linear Probing with 5-Independent Hashing
    Lecture Notes on Linear Probing with 5-Independent Hashing Mikkel Thorup May 12, 2017 Abstract These lecture notes show that linear probing takes expected constant time if the hash function is 5-independent. This result was first proved by Pagh et al. [STOC’07,SICOMP’09]. The simple proof here is essentially taken from [Pˇatra¸scu and Thorup ICALP’10]. We will also consider a smaller space version of linear probing that may have false positives like Bloom filters. These lecture notes illustrate the use of higher moments in data structures, and could be used in a course on randomized algorithms. 1 k-independence The concept of k-independence was introduced by Wegman and Carter [21] in FOCS’79 and has been the cornerstone of our understanding of hash functions ever since. A hash function is a random function h : [u] [t] mapping keys to hash values. Here [s]= 0,...,s 1 . We can also → { − } think of a h as a random variable distributed over [t][u]. We say that h is k-independent if for any distinct keys x ,...,x [u] and (possibly non-distinct) hash values y ,...,y [t], we have 0 k−1 ∈ 0 k−1 ∈ Pr[h(x )= y h(x )= y ] = 1/tk. Equivalently, we can define k-independence via two 0 0 ∧···∧ k−1 k−1 separate conditions; namely, (a) for any distinct keys x ,...,x [u], the hash values h(x ),...,h(x ) are independent 0 k−1 ∈ 0 k−1 random variables, that is, for any (possibly non-distinct) hash values y ,...,y [t] and 0 k−1 ∈ i [k], Pr[h(x )= y ]=Pr h(x )= y h(x )= y , and ∈ i i i i | j∈[k]\{i} j j arXiv:1509.04549v3 [cs.DS] 11 May 2017 h i (b) for any x [u], h(x) is uniformly distributedV in [t].
    [Show full text]
  • Cuckoo Hashing
    Cuckoo Hashing Rasmus Pagh* BRICSy, Department of Computer Science, Aarhus University Ny Munkegade Bldg. 540, DK{8000 A˚rhus C, Denmark. E-mail: [email protected] and Flemming Friche Rodlerz ON-AIR A/S, Digtervejen 9, 9200 Aalborg SV, Denmark. E-mail: ff[email protected] We present a simple dictionary with worst case constant lookup time, equal- ing the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738{761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. Besides being conceptually much simpler than previous dynamic dictionaries with worst case constant lookup time, our data structure is interesting in that it does not use perfect hashing, but rather a variant of open addressing where keys can be moved back in their probe sequences. An implementation inspired by our algorithm, but using weaker hash func- tions, is found to be quite practical. It is competitive with the best known dictionaries having an average case (but no nontrivial worst case) guarantee. Key Words: data structures, dictionaries, information retrieval, searching, hash- ing, experiments * Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT). This work was initiated while visiting Stanford University. y Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation. z This work was done while at Aarhus University. 1 2 PAGH AND RODLER 1. INTRODUCTION The dictionary data structure is ubiquitous in computer science.
    [Show full text]
  • The Power of Simple Tabulation Hashing
    The Power of Simple Tabulation Hashing Mihai Pˇatra¸scu Mikkel Thorup AT&T Labs AT&T Labs May 10, 2011 Abstract Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here we show that the simplest possible tabulation hashing provides unexpectedly strong guarantees. The scheme itself dates back to Carter and Wegman (STOC'77). Keys are viewed as consist- ing of c characters. We initialize c tables T1;:::;Tc mapping characters to random hash codes. A key x = (x1; : : : ; xc) is hashed to T1[x1] ⊕ · · · ⊕ Tc[xc], where ⊕ denotes xor. While this scheme is not even 4-independent, we show that it provides many of the guarantees that are normally obtained via higher independence, e.g., Chernoff-type concentration, min-wise hashing for estimating set intersection, and cuckoo hashing. Contents 1 Introduction 2 2 Concentration Bounds 7 3 Linear Probing and the Concentration in Arbitrary Intervals 13 4 Cuckoo Hashing 19 5 Minwise Independence 27 6 Fourth Moment Bounds 32 arXiv:1011.5200v2 [cs.DS] 7 May 2011 A Experimental Evaluation 39 B Chernoff Bounds with Fixed Means 46 1 1 Introduction An important target of the analysis of algorithms is to determine whether there exist practical schemes, which enjoy mathematical guarantees on performance. Hashing and hash tables are one of the most common inner loops in real-world computation, and are even built-in \unit cost" operations in high level programming languages that offer associative arrays. Often, these inner loops dominate the overall computation time.
    [Show full text]
  • Fundamental Data Structures Contents
    Fundamental Data Structures Contents 1 Introduction 1 1.1 Abstract data type ........................................... 1 1.1.1 Examples ........................................... 1 1.1.2 Introduction .......................................... 2 1.1.3 Defining an abstract data type ................................. 2 1.1.4 Advantages of abstract data typing .............................. 4 1.1.5 Typical operations ...................................... 4 1.1.6 Examples ........................................... 5 1.1.7 Implementation ........................................ 5 1.1.8 See also ............................................ 6 1.1.9 Notes ............................................. 6 1.1.10 References .......................................... 6 1.1.11 Further ............................................ 7 1.1.12 External links ......................................... 7 1.2 Data structure ............................................. 7 1.2.1 Overview ........................................... 7 1.2.2 Examples ........................................... 7 1.2.3 Language support ....................................... 8 1.2.4 See also ............................................ 8 1.2.5 References .......................................... 8 1.2.6 Further reading ........................................ 8 1.2.7 External links ......................................... 9 1.3 Analysis of algorithms ......................................... 9 1.3.1 Cost models ......................................... 9 1.3.2 Run-time analysis
    [Show full text]
  • Efficient Usage of One-Sided RDMA for Linear Probing
    Efficient Usage of One•Sided RDMA for Linear Probing Tinggang Wang*1 Shuo Yang*1 Hideaki Kimura2 Garret Swart2 Spyros Blanas1 1 The Ohio State University 2 Oracle Corp. {wang.5264, yang.5229, blanas.2}@osu.edu {hideaki.kimura, garret.swart}@oracle.com ABSTRACT Cuckoo hashing has been widely adopted by RDMA-aware RDMA has been an important building block for many high- key-value stores [3, 8, 20] due to the predictable and small performance distributed key-value stores in recent prior work. number of RDMA operations to access a remote hash table. To sustain millions of operations per second per node, many Prior work also proposed using one-sided RDMA verbs to of these works use hashing schemes, such as cuckoo hash- implement linear probing by doing fixed-size lookups [20], ing, that guarantee that an existing key can be found in a where the client fetches a fixed number of hash slots per small, constant number of RDMA operations. In this pa- RDMA READ request and repeats the procedure until find- per, we explore whether linear probing is a compelling de- ing the key or the first empty slot. However, fetching a fixed sign alternative to cuckoo-based hashing schemes. Instead number of slots per RDMA READ request may read too lit- of reading a fixed number of bytes per RDMA request, this tle or too much: in a lightly-loaded hash table, one should paper introduces a mathematical model that picks the opti- read very few slots to conserve network bandwidth; with mal read size by balancing the cost of performing an RDMA high load factors, the average length of the probe sequence operation with the probability of encountering a probe se- increases dramatically, hence one needs to read many more quence of a certain length.
    [Show full text]