PPT-Expander: Lock-free Cache for a Concurrent Data Structure

Author : lois-ondreau | Published Date : 2018-10-06

Pooja Aggarwal IBM Research bangalore Smruti R Sarangi IIT Delhi 1 Concurrent Object Concurrent Object Threads Each thread executes a method on the object

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Expander: Lock-free Cache for a Concurre..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Expander: Lock-free Cache for a Concurrent Data Structure: Transcript

Pooja Aggarwal IBM Research bangalore Smruti R Sarangi IIT Delhi 1 Concurrent Object Concurrent Object Threads Each thread executes a method on the object method request. Limited . Shared Memory Support. Ivan . Walulya. Yiannis . Nikolakopoulos. Marina Papatriantafilou. Philippas Tsigas. Distributed Computing and Systems. Chalmers University of Technology. Gothenburg, Sweden. On the Interplay of Hardware Transactional Memory and Lock-free Indexing. Justin . Levandoski. Microsoft Research Redmond. Ryan Stutsman. Microsoft Research Redmond. Darko. . Makreshanski. Department of Computer Science. . Sagi Katorza. Tel Aviv University. 09/12/2014. 1. Outline. Hardware infrastructure . Hardware . primitives. Mutual exclusion. Work . sharing and termination . detection. Concurrent data structures. Wilfredo. Velazquez. Outline. Basics of Concurrency. Concepts and Terminology. Advantages and Disadvantages. Amdahl’s Law. Synchronization Techniques. Concurrent Data Structures. Parallel Correctness. On the Interplay of Hardware Transactional Memory and Lock-free Indexing. Justin . Levandoski. Microsoft Research Redmond. Ryan Stutsman. Microsoft Research Redmond. Darko. . Makreshanski. Department of Computer Science. Why the Grass May Not Be Greener on the Other Side: A Comparison of Locking and Transactional Memory. Why Do Concurrent Programming?. Hardware has been forced down the path of concurrency:. can’t make cores much faster. r.a.r.e. .. Trevor Brown. Technion. slides at http://tbrown.pro. Why do we perform experiments?. To answer questions about . data structures. Is one data structure faster than another? Why?. We are asking about algorithmic differences,. r.a.r.e. .. Trevor Brown. Technion. slides at http://tbrown.pro. Why do we perform experiments?. To answer questions about . data structures. Is one data structure faster than another? Why?. We are asking about algorithmic differences,. Multi-Object Programs. What happens when we try to synchronize across multiple objects in a large program?. Each object with its own lock, condition variables. Is locking modular?. Performance. Semantics/correctness. Final exam details:. Monday 12/13, 1pm – 3pm. 80%+ on post-midterm material. A couple unseen problems, a few “short-response” questions. Questions ordered easy to difficult. 3+3 reference sheets (double sided). There has to be a Better Way. Trevor Brown. University of Toronto. Intern, Oracle Labs. Lifecycle of a record. Allocate. Free. Insert. Remove. Reuse. ???. Reclamation with and without locks. Easy with locks: a retired record can be freed if it, and all records pointing to it, are locked. Prof. . Moonzoo. Kim. CS KAIST. CS492B Analysis of Concurrent . Programs. 1. Bug Detection Techniques for Concurrent Programs. 1,000,000 LOC <. 100~1,000 LOC. Precision. rstest. . ConTest. . MetaL. Nhan Nguyen. & . Philippas. . Tsigas. ICDCS 2014. Distributed Computing and Systems. Chalmers University of Technology. Gothenburg, Sweden. Our contributions: a concurrent hash table. Nhan D. Nguyen. http://www.cse.iitk.ac.in/~mainakc/lockfree.html. Prabhakar. . Misra. and . Mainak. Chaudhuri. Indian Institute of Technology, Kanpur. Sketch. Talk in one slide. Result highlights. Related work. Lock-free data structures.

Download Document

Here is the link to download the presentation.
"Expander: Lock-free Cache for a Concurrent Data Structure"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.