PPT-Deterministic and Efficient Hash Table Lookup Using Discrim

Author Dagang Li Junmao Li Zheng Du Publisher GLOBECOM 2016 IEEE Presenter Yi Hao Lai Date 20160215 Department of Computer Science and Information Engineering . Chord and Dynamo. Costin Raiciu,. Advanced Topics in Distributed Systems. 18/12/2012. Motivation: file sharing. Many users want to share files online. If a file’s location is known, downloading is easy. Practically Better Than Bloom. Bin Fan . (CMU/Google). David Andersen (CMU). Michael . Kaminsky. (Intel Labs). Michael . Mitzenmacher. (Harvard). 1. What is Bloom Filter? A Compact Data Structure . Lecture 3. Sets. A . set. is simply a collection of elements. Unlike lists, elements are not ordered. Very abstract, general concept with broad usefulness:. The set of all Google search queries from the past 24 hours. . Sections 5.3, 5.4, 5.5, 5.6. 2. Designing a Hash Table. Hash function: establishing a key with an indexed location in a hash table.. E.g. . Index = hash(key) % table_size;. Resolve conflicts: . Need to handle case where multiple keys mapped to the same index.. Chris Wilcox. Michelle . Strout. James . Bieman. Colorado State University. Problem. Scientific codes often require extensive tuning to perform well on multicore . systems.. Performance optimization consumes a major share of development effort on multicore systems.. Slides courtesy of Patrick . Bosshart. , Nick McKeown, and Mihai . Budiu. Outline. Motivation for programmable switches. Early attempts at programmability. Programmability without losing performance: The Reconfigurable Match-Action Table model. Chris . Wilcox, Michelle Mills . Strout. , James M. . Bieman. Computer Science Department. Colorado State University. Source Control Analysis and Manipulation (SCAM). Riva del Garda, Italy – September 23, 2012. Bosshart. , Nick McKeown, and Mihai . Budiu. Outline. Motivation for programmable switches. Early attempts at programmability. Programmability without losing performance: The Reconfigurable Match-Action Table model. and Biff Codes. Michael Mitzenmacher. Beginning. Survey some of the history of peeling arguments.. A Matching Peeling Argument. Take a random graph with . n. vertices and . m. edges.. Form a matching greedily as follows: . We have:. Discussed techniques for hashing. Discussed mapping down to a given range . 0, ..., . M. – 1. Now we must deal with collisions. Numerous techniques exist. Containers in general. Specifically linked lists. . Outline. Discuss what a hash method does. translates a string key into an integer . Discuss a few strategies for implementing a hash table. linear probing. quadratic probing. separate chaining hashing. n. . . [from the . techspeak. ] (var. ‘hash clash’) . When used of people, signifies a confusion in associative memory or imagination, especially a persistent one.” . . -. The Hacker's Dictionary . COS . 518. : . Advanced Computer Systems. Lecture . 15. Daniel Suo. [Credit: . All slides copied wholesale from Kyle Jamieson and . Mike Freedman.. Selected . content adapted from B. Karp, R. Morris]. COS 418: . Distributed Systems. Lecture 7. Kyle Jamieson. [Credit: Selected content adapted from B. Karp, R. Morris]. Peer-to-Peer Systems. Napster, Gnutella, BitTorrent, challenges. Distributed Hash Tables.