PPT-Performance Evaluation of Lock-free Data Structures on GPUs http://www.cse.iitk.ac.in/~mainakc/lockfree.html
Author : jax185 | Published Date : 2024-12-06
httpwwwcseiitkacinmainakclockfreehtml Prabhakar Misra and Mainak Chaudhuri Indian Institute of Technology Kanpur Sketch Talk in one slide Result highlights Related
Presentation Embed Code
Download Presentation
Download Presentation The PPT/PDF document "Performance Evaluation of Lock-free Data..." 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.
Performance Evaluation of Lock-free Data Structures on GPUs http://www.cse.iitk.ac.in/~mainakc/lockfree.html: Transcript
httpwwwcseiitkacinmainakclockfreehtml Prabhakar Misra and Mainak Chaudhuri Indian Institute of Technology Kanpur Sketch Talk in one slide Result highlights Related work Lockfree data structures. 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. http://pw0nd.com/tag/wolf/. http://. www.danekeclublambs.com/files/Parts_of_lamb.html. Ranking of Traits. Degree . of muscling. . Degree . of finish. . Balance . and style. . Carcass merit. Soundness . 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. Betkaoui, B.; Thomas, D.B.; Luk, W., "Comparing performance and energy efficiency of FPGAs and GPUs for high productivity computing," . Field-Programmable Technology (FPT), 2010 International Conference on. 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,. Eric Barela, Ph.D.. Chief Organizational Performance Officer. Partners in School Innovation. 2010 American Evaluation Association Conference, . San Antonio, TX. Presentation roadmap. Organizational context. 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. Diana Epstein, Ph.D, CNCS Office of Research and Evaluation. Adrienne DiTommaso, MPA, CNCS Office of Research and Evaluation . Learning objectives. Understand five critical activities for your first grant cycle. Laying the Groundwork Before Your First Evaluation Diana Epstein, Ph.D, CNCS Office of Research and Evaluation Adrienne DiTommaso, MPA, CNCS Office of Research and Evaluation Learning objectives Understand five critical activities for your first grant cycle panel discussions. HSF and its role in performance? . V: This is the question that we should keep in mind throughout the panel discussion . What is Computational Efficiency for you?. Holistic Performance Assessment? . 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.
Download Document
Here is the link to download the presentation.
"Performance Evaluation of Lock-free Data Structures on GPUs http://www.cse.iitk.ac.in/~mainakc/lockfree.html"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.
Related Documents