Abstract
The use of concurrent garbage collection for Digital Equipment Corp.'s experimental shared-memory multiprocessors, the firefly was discussed. The garbage collection is basically a graph traversal, which can be depth-first or breadth-first search. It is stated that the concurrent and generational collector design can be decomposed into two separate subproblems. The subproblems can be to design an algorithm that uses read barriers and write barriers and devising tricks for implementating the barriers.
Original language | English (US) |
---|---|
Pages (from-to) | 205-206 |
Number of pages | 2 |
Journal | SIGPLAN Notices (ACM Special Interest Group on Programming Languages) |
Volume | 39 |
Issue number | 4 |
DOIs | |
State | Published - Apr 2004 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Graphics and Computer-Aided Design