TY - GEN
T1 - STOPLESS
T2 - ISMM'07: 2007 International Symposium on Memory Management
AU - Pizlo, Filip
AU - Frampton, Daniel
AU - Petrank, Erez
AU - Steensgaard, Bjarne
PY - 2007
Y1 - 2007
N2 - We present STOPLESS: a concurrent real-time garbage collector suitable for modern multiprocessors running parallel multithreaded applications. Creating a garbage-collected environment that supports real-time on modern platforms is notoriously hard, especially if real-time implies lock-freedom. Known real-time collectors either restrict the real-time guarantees to uniprocessors only, rely on special hardware, or just give up supporting atomic operations (which are crucial for lock-free software). STOPLESS is the first collector that provides real-time responsiveness while preserving lock-freedom, supporting atomic operations, controlling fragmentation by compaction, and supporting modern parallel platforms. STOPLESS is adequate for modern languages such as C# or Java. It was implemented on top of the Bartok compiler and runtime for C# and measurements demonstrate high responsiveness (a factor of a 100 better than previously published systems), virtually no pause times, good mutator utilization, and acceptable overheads.
AB - We present STOPLESS: a concurrent real-time garbage collector suitable for modern multiprocessors running parallel multithreaded applications. Creating a garbage-collected environment that supports real-time on modern platforms is notoriously hard, especially if real-time implies lock-freedom. Known real-time collectors either restrict the real-time guarantees to uniprocessors only, rely on special hardware, or just give up supporting atomic operations (which are crucial for lock-free software). STOPLESS is the first collector that provides real-time responsiveness while preserving lock-freedom, supporting atomic operations, controlling fragmentation by compaction, and supporting modern parallel platforms. STOPLESS is adequate for modern languages such as C# or Java. It was implemented on top of the Bartok compiler and runtime for C# and measurements demonstrate high responsiveness (a factor of a 100 better than previously published systems), virtually no pause times, good mutator utilization, and acceptable overheads.
KW - Concurrency
KW - Garbage collection
KW - Lock-free
KW - Real-time
UR - http://www.scopus.com/inward/record.url?scp=42149094360&partnerID=8YFLogxK
U2 - 10.1145/1296907.1296927
DO - 10.1145/1296907.1296927
M3 - Conference contribution
SN - 9781595938930
T3 - International Symposium on Memory Management, ISMM
SP - 159
EP - 172
BT - ISMM'07
Y2 - 21 October 2007 through 22 October 2007
ER -