סילבוס Syllabus Силабус خطة الدورة

Topics: 

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. 

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 attached below).  
8. Fast Concurrent Queues for x86 Processors (paper attached below)
9. Concurrent Stacks and Elimination, chapter 11.  
10. Concurrent hashing and natural parallelism, chapter 13. 
11. Skiplists and Balanced Search, chapter 14. 
12. "A Skiplist-Based Concurrent Priority Queue with Minimal Memory Contention", (paper). 
13. Lock-free Trees (papers)
14. Futures, Scheduling, and Work Distribution, chapter 16. 
15. Barriers, chapter 17. 
16. Lock-Free Snapshots, (paper). 
17. Lock-Free Snapshots by multiversioning, (paper). 
18. Concurrent Size, (paper). 
19. Counting, Sorting, and Distributed Coordination, chapter 12.  
20. "Flat Combining", (paper). 

Memory Management for lock-free Data Structures: 

22. Hazard pointers (paper). Assigned to Erez Petrank. Presentation
23. Optimistic access (paper). 
24. Hazard Eras - Non-Blocking Memory Reclamation (see paper). 
25. NBR: neutralization based reclamation (see paper).  
26. VBR: Version Based Reclamation (see paper). 
27. The ERA Theorem for memory management (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. 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. Efficient Lock-Free Durable Sets. (see paper). 
52. The Inherent Cost of Remembering Consistently. (see paper).
53. Mirror: making lock-free data structures persistent. (see paper).
54. Dalí: A Periodically Persistent Hash Map. (see paper).
55. A Fast, General System for Buffered Persistent Data Structures. (see paper).