Sciweavers

3 search results - page 1 / 1
» Constant-Time Root Scanning for Deterministic Garbage Collec...
Sort
View
CC
2001
Springer
121views System Software» more  CC 2001»
13 years 8 months ago
Constant-Time Root Scanning for Deterministic Garbage Collection
Root scanning is the task of identifying references to heap objects that are stored outside of the heap itself, in global and local variables and on the execution stack. Root scann...
Fridtjof Siebert
RTS
2010
127views more  RTS 2010»
12 years 11 months ago
Scheduling of hard real-time garbage collection
Automatic memory management or garbage collection greatly simplifies development of large systems. However, garbage collection is usually not used in real-time systems due to the u...
Martin Schoeberl
CC
2006
Springer
118views System Software» more  CC 2006»
13 years 8 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa