Algorithms for Dynamic Memory Management (236780)

(Winter 2010-2011)

Instructor: Erez Petrank, erezcs.technion.ac.il 


Office: Taub 528, tel. 4942.

Teaching Assistant: Shahar Timnat, Taub 414, tel. 4614.

Announcements:

• Classes are scheduled to Thursdays 10:30-12:30 at Taub 4.

• My reception hours are set to Thursdays 14:30-15:30.  (If this is not a good time for you, contact me by email to schedule an alternative time.)

Home Exercises (in Hebrew):

• Exercise 1 is here.

• Exercise 2 is here.

• Exercise 3 is here.

Lectures:

• Lecture 1: Introduction; Mark & Sweep (slides). (Summarizing Guy Hefetz and Gal Cohen.)

• Lecture 2: Compaction (slides).  (Summarizing Ella and Oshrat.)

• Lecture 3: Copying; Baker's Algorithm (slides). (Summarizing Michael Chernikov and Vladislav.)

• Lecture 4: Bacon’s guest lecture on real time GC (lecture 1, lecture 2). (Summarizing Raziel and Nikita.)

• Lecture 5: Generations; Train Algorithm (slides). (Summarizing Hen Sender and Gal Ben Ami.)

• Lecture 6: Dijkstra-DLG (slides). (Summarizing Guy Weiner and Alex Protkov.)

• Lecture 7: Part 2 of DLG and IBM’s mostly-concurrent (slides). (Summarizing Karine Even and Muli Ben Yehuda)

• Lecture 8: Snapshot & Sliding Views (slides). (Summarizing Ronny Boimel and Gal Nahshon)

• Lecture 9: Reference Counting (slides). (Summarizing Dor Zomer and Dimitri Galmanovich)

• Lecture 10: Cycle Collection & The Compressor (slides). (Summarizing Assaf Mor and Idan Ben Dror)

• Lecture 11: The Compressor (cont’d) & Cache-consciousness (slides). (Summarizing Alaa Genayeb and Adam Ben Ayoun)

• Lecture 12: Parallel GC & Allocation techniques (slides). (Summarizing Ady Abraham and Yossi kuperman.)

• Lecture 13: Real-Time GC (slides). (Summarizing Alex Portnov and Noam Lavie)

Previous Tests (in Hebrew):

• MOED A, Winter 2006.

• MOED B, Winter 2006.

• MOED A, Winter 2009.

• MOED B, Winter 2009.

• MOED A, Winter 2010.

• MOED B, Winter 2010.

• MOED A, Winter 2010.

• MOED B, Winter 2010.

Administrative:

• Course syllabus (in Hebrew)

• Prerequisites: Algorithms 1  and Operating Systems

Assignments:

Each student will have to solve "dry" home exercises, summarize a lecture, and pass the final test.

Course Book:

We will use the book:  Garbage Collection: algorithms for automatic dynamic memory management by Jones and Lins. 

A link to this book in the Technion libraries can be found here. 


Check also Richard Jones's Garbage Collection Page.

A new book "The Garbage Collection Handbook: The Art of Automatic Memory Management" just came out (see http://gchandbook.org/), but it is not yet available in the library.