Algorithms
for Dynamic Memory Management (236780)
(Winter 2012-2013)
Instructor: Erez Petrank, erez
cs.technion.ac.il
Office: Taub 528, tel. 4942.
Teaching Assistant: Shahar Timnat, Taub 414, tel. 4614.
Announcements:
¥
There will be no class on Sunday 16/12.
¥
Class is moving! We will meet in Taub
4 next time. See you there!
Home
Exercises (in Hebrew):
¥
Exercise
1.
¥
Exercise
2.
¥
Exercise
3.
Lectures:
¥
Lecture
1: Intro + mark-sweep.
¥
Lecture
2: Compaction.
¥
Lecture
3: Copying.
¥
Lecture
4: Generations & Train.
¥
Lecture
5: Dijkstra & DLG.
¥
Lecture
6: DLG & Mostly concurrent.
¥
Lecture
7: Mostly concurrent (IBM) & Parallel GC.
¥
Lecture
8: Snapshot & sliding-views mark-sweep.
¥
Lecture
9: Reference counting.
¥
Lecture
10: Cycle Collection & The Compressor.
¥
Lecture
11: Compressor and Cache Consciousness.
¥
Lecture
12: Cache Consciousness and Allocation Techniques.
¥
Lecture
13: Real Time GC.
Previous
Tests (in Hebrew):
¥
MOED A, Winter 2008-09.
¥
MOED B, Winter 2008-09.
¥
MOED A, Winter 2009-10.
¥
MOED B, Winter 2009-10.
¥
MOED A, Winter 2010-11.
¥
MOED B, Winter 2010-11.
¥
MOED A, Winter 2011-12.
¥
MOED B, Winter 2011-12.
Administrative:
¥
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:
A new book
"The Garbage Collection Handbook: The Art of Automatic Memory
Management" just came out (see this link),
and is available in the library.
An older
book: Garbage Collection: algorithms for automatic dynamic
memory management by Jones and Lins is
also relevant.
A link to
this book in the Technion libraries can be found here.
Check also Richard Jones's Garbage Collection Page.