Seminar on Programming Languages and Program Analysis

Automatic Memory Management

We will review sequential and parallel algorithms for classic and cutting edge automatic memory management (aka garbage collection), and discuss relative merits and weakness, focusing on the techniques that are used to prove the correctness of the algorithms.
The talks will be given based on The Garbage Collection Handbook, which is a graduate-level textbook on (surprisingly) garbage collection.

You are required to be present in every lesson, unless coordinated ahead with the lecturer.
Every student is expected to:
- Be present in every lesson, unless coordinated ahead with the lecturer.
- Give a 80 minutes talk about his or hers assigned topic.
- Answer students questions during the talk.
- Say something original (i.e., not written in the book/paper) about the topic. For example, download and execute two implementation of an algorithm and evaluate them, extend the discussion regarding one of the references in the book/paper, make an interesting connection to a topic discussed in a previous talk, say his or hers personal impressions regarding the discussed technique.
- Lead a discussion a summary discussion.
- Write a short (1 page) summary about the discussed topic, the original contribution, and the main points that came out during the discussion.
- Participate in the discussions led by other students.

Use the seminar's themes for your presentation and summary: [Presentation theme] [Summary theme].
Name your presentation and summary using the seminar's naming conventions, e.g.,
- seminar1415a-lec1-presentation.pptx
- seminar1415a-lec1-summary.docx
The talk can be given either in Hebrew or in English. The slides and the summary should be written in English.
Mathematical fonts for Powerpoint and Word can be found here.

Num.	Date	Presenter	Topic	Paper	Presentation		Summary
Num.	Date	Presenter	Topic	Paper	PPTX	PDF	DOCX	PDF
1	28-10-14	Noam Rinetzky	Overview	Chap. 1	Slides	Slides
2	04-11-14	Pavel	Mark-and-Sweep and Mark-compact GC	Chap. 2,3	Slides	Slides	Summary	Summary
3	11-11-14	Jonathan Kalechstain	Copying GC and reference counting	Chap. 4,5	Slides	Slides	Summary	Summary
4	18-11-14	Yarden Marton	Comparing GCs and allocation	Chap. 6,7	Slides	Slides	Summary	Summary
5	25-11-14	Hadar Getzel	Partitioning and generational GC	Chap. 8,9,10	Slides Video	Slides	Summary	Summary
6	02-12-14	Oleg Dobkin	Runtime interface and language specific concerns	Chap. 11,12	Slides	Slides	Summary	Summary
7	09-12-14	Sagi Katorza	Concurrency preliminaries	Chap. 13	Slides	Slides	Summary	Summary
8	16-12-14	Elinor Ainy	Parallel GC	Chap. 14	Slides	Slides	Summary	Summary
9	23-12-14	Roman Kecher	Concurrent GC	Chap. 15	Slides	Slides	Summary	Summary
10	30-12-14	Eyal Dushkin	Concurrent mark-sweep GC	Chap. 16	Slides	Slides	Summary	Summary
11	06-01-15	Hanan Rofe Haim	Concurrent copying and compaction GC	Chap. 17	Slides	Slides	Summary	Summary
12	13-01-15	Or Ostrovsky	Concurrent reference-counting	Chap. 18	Slides	Slides	Summary	Summary
13	20-01-15	Boris Dogadov	Real-time GC	Chap. 19	Slides	Slides	Summary	Summary