PPT-Linked Lists: Locking, Lock-Free, and Beyond …

Author : lindy-dunigan | Published Date : 2018-03-13

Companion slides for The Art of Multiprocessor Programming by Maurice Herlihy amp Nir Shavit Art of Multiprocessor Programming 2 Last Lecture SpinLocks CS Resets

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Linked Lists: Locking, Lock-Free, and Be..." 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.

Linked Lists: Locking, Lock-Free, and Beyond …: Transcript

Companion slides for The Art of Multiprocessor Programming by Maurice Herlihy amp Nir Shavit Art of Multiprocessor Programming 2 Last Lecture SpinLocks CS Resets lock upon exit spin lock. Tel-Aviv University. Nathan Bronson Stanford University. Alex Aiken Stanford University. G. Ramalingam Microsoft Research. Mooly Sagiv Tel-Aviv University. Eran Yahav Technion. Automatic Fine-Grain Locking . 1. David . Lomet. Microsoft Research. Mohamed . Mokbel. University of Minnesota. Talk Outline. Unbundled. Transaction Services. Challenge: Key Range Locking. Using. Conventional . L. ocking. . M. anagers. class List { List() { head = new Node; head-next = head-prev = head; } // destructor virtual ~List() { Node *p = head-next; while (p != head) { Node *next = p-next; delete p; 1. Doubly. . Linked . Lists. © 2014 Goodrich, Tamassia, Goldwasser. Presentation for use with the textbook . Data Structures and Algorithms in Java, 6. th. edition. , by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser, Wiley, 2014. 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. 1. David . Lomet. Microsoft Research. Mohamed . Mokbel. University of Minnesota. Talk Outline. Unbundled. Transaction Services. Challenge: Key Range Locking. Using. Conventional . L. ocking. . M. anagers. 1. Singly Linked Lists. Presentation for use with the textbook . Data Structures and Algorithms in Java, 6. th. edition. , by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser, Wiley, . 2014. Singly Linked Lists. Concurrency Control, part 2. CS634. Class 18, Apr . 6. , 2016. Slides based on “Database Management Systems” 3. rd. . ed. , . Ramakrishnan. and . Gehrke. More Dynamic . Databases. If . the set of DB objects changes, Strict . Topics to be discussed…. Linked list. More terminology. Singly-linked lists. Doubly-linked lists. DLLs compared to SLLs. Circular Lists. Linked list. a. b. c. d. Each node contains a . value. and a . A Comparison of Locking vs. Transactional Memory. Written by: . Paul E. . McKenney. Jonathan . Walpole. Maged. M. . Michael. Josh . Triplett. Presented by: Jacob Lear. (Some slides borrowed from Dr. Walpole’s lectures). 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. Michael D. Ernst, Alberto Lovato, . Damiano. . Macedonio. , Fausto . Spoto. , Javier . Thaine. University of Washington, USA. Università. di Verona, Italy. Julia . Srl. , Italy. ICSE 2016. Concurrency: essential but error-prone. Michael D. Ernst, Alberto Lovato, . Damiano. . Macedonio. , Fausto . Spoto. , Javier . Thaine. University of Washington, USA. Università. di Verona, Italy. Julia . Srl. , Italy. ICSE 2016. Concurrency: essential but error-prone. 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.
"Linked Lists: Locking, Lock-Free, and Beyond …"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.