Title of article :
Barrier techniques for incremental tracing
Author/Authors :
Pirinen، Pekka P. نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1999
Pages :
-1
From page :
2
To page :
0
Abstract :
This paper presents a classification of barrier techniques for interleaving tracing with mutator operation during an incremental garbage collection. The two useful tricolour invariants are derived from more elementary considerations of graph traversal. Barrier techniques for maintaining these invariants are classified according to the action taken at the barrier (such as scanning an object or changing its colour), and it is shown that the algorithms described in the literature cover all the possibilities except one. Unfortunately, the new technique is impractical. Ways of combining barrier techniques are also discussed.
Keywords :
multiprocessor scalability , cache-conscious algorithms , reducing lock contention , Dynamic memory allocation , server applications , Concurrency
Journal title :
A C M Sigplan (Programming Languages) Sigplan Notices
Serial Year :
1999
Journal title :
A C M Sigplan (Programming Languages) Sigplan Notices
Record number :
17129
Link To Document :
بازگشت