PPT-Reclaiming Memory for Lock-free Data Structures

Author : bethany | Published Date : 2023-10-28

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

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Reclaiming Memory for Lock-free Data Str..." 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.

Reclaiming Memory for Lock-free Data Structures: Transcript

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. 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. Maurice . Herlihy. Computer Science . Dept. Brown University. 2. Not important:. The details.. Important. Irrevocable change. 3. How to think about Synchronization. Poor synchronization . ruins everything. . Locking & Synchronization. [chapter #4]. By Dan . Tsafrir, 2013-04-03. Fine-grained synchronization. When critical section is very short. Agenda: mutex locks. Locks. Why do we need them?. How do we implement them? (In xv6 in particular). How Hardware Transactional Memory can Improve . Legacy Data Structures. Maurice Herlihy and Eli Wald. Brown University. Transactional Memory. 2. Concurrent Data Structure = State Machine. 3. atomic. step. Maged. M. Michael. The Problem. Lock-free algorithms assume that threads can operate on any object at any time. Freeing memory could break this assumption. How can we free memory of deleted nodes in a safe and lock-free manner?. . Sagi Katorza. Tel Aviv University. 09/12/2014. 1. Outline. Hardware infrastructure . Hardware . primitives. Mutual exclusion. Work . sharing and termination . detection. Concurrent data structures. Fall 07/08 – Lecture Notes # 5b. Outline. Dynamic Memory Allocation. malloc. ( ), free( ) . and . calloc. ( ) . functions. Dynamically Allocated Arrays. DYNAMIC MEMORY . ALLOCATION. DYNAMIC . MEMORY . 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. 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,. 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. 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. Lecture 21. April . 11. th. , . 2012. Distributed Shared Memory (. con’t. ). Synchronization. Prof John D. Kubiatowicz. http://www.cs.berkeley.edu/~kubitron/cs252. Recall: Sequential Consistency of Directory Protocols.

Download Document

Here is the link to download the presentation.
"Reclaiming Memory for Lock-free Data Structures"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.