הודעות Announcements Сообщения اعلانات

Introduction (all talks in this section are taken from the Art of Multiprocessor Programming by Herlihy & Shavit available at the library):

1. Introduction to Concurrency: hardware and software, see Appendix A and B of the book.
2. "Spin locks and contention in practice", chapter 7 in the book. 
3. "Monitors and Blocking Synchronization",  chapter 8 in the book. 
4. Properties of concurrent computation: correctness and progress, chapter 3 in the book. Assigned to Erez Petrank. Presentation

Concurrent Algorithms (several talks in this section (those referenced as "chapter n") are taken from the Art of Multiprocessor Programming by Herlihy & Shavit available at the library):

5. Linked Lists: the Role of Locking, chapter 9. Assigned to Erez Petrank. Presentation
6. Concurrent Queues and the ABA Problem, chapter 10.
7. Wait-free Queues (paper). 
8. Concurrent Stacks and Elimination, chapter 11. 
9. Concurrent hashing and natural parallelism, chapter 13.
10. Skiplists and Balanced Search, chapter 14.
11. "A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention", (paper).
12. Futures, Scheduling, and Work Distribution, chapter 16.
13. Barriers, chapter 17.
14. "Lock-Free Snapshots", (paper).
15. "Lock-Free Snapshots by multiversioning", (paper).
16. "Concurrent Size", (paper).
17. Counting, Sorting, and Distributed Coordination, chapter 12.  
18. "Flat Combining", (paper).

Memory Management for lock-free Data Structures:

20. Hazard pointers (paper). Assigned to Erez Petrank. Presentation
21. Optimistic access (paper). Assigned to Erez Petrank.
22. IBR: Interval Based Reclamation (see paper).
23. Hazard Eras - Non-Blocking Memory Reclamation (see paper).
24. NBR: neutralization based reclamation (see paper). 
25. VBR: Version Based Reclamation (see paper).

Debugging:

30. Debugging tools: Microsoft's Chess (paper).
31. IBM’s synchronization coverage for testing (see paper). 
32. A Randomized Scheduler for Bug Finding (see paper).
33. Deterministic parallelism (see paper).
34. Record-Replay parallel executions (see paper) 

Systems Scalability:

40. An Analysis of Linux Scalability to Many Cores. (see paper). 

Concurrent data structures on GPUs:

45. Performance Evaluation of Concurrent Lock-free Data Structures on GPUs. (see paper). 
46. Mega-KV: a case for GPUs to maximize the throughput of in-memory key-value stores. (see paper).

Concurrent data structures on non-volatile memory:

50. A persistent lock-free queue for non-volatile memory. (see paper).
51. Log-Free Concurrent Data Structures. (see paper).
52. Efficient Lock-Free Durable Sets. (see paper).
53. The Inherent Cost of Remembering Consistently. (see paper).
54. Mirror: making lock-free data structures persistent. (see paper).
55. Dalí: A Periodically Persistent Hash Map. (see paper).
56. A Fast, General System for Buffered Persistent Data Structures. (see paper).