Abstract
This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA |
| Editors | Anon |
| Publisher | IEEE |
| Pages | 168-173 |
| Number of pages | 6 |
| Publication status | Published - 1995 |
| Event | Proceedings of the 1995 2nd International Workshop on Real-Time Computing Systems and Applications - Tokyo, Jpn Duration: Oct 25 1995 → Oct 27 1995 |
Other
| Other | Proceedings of the 1995 2nd International Workshop on Real-Time Computing Systems and Applications |
|---|---|
| City | Tokyo, Jpn |
| Period | 10/25/95 → 10/27/95 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science(all)
Cite this
Generated order preserving real-time garbage collection. / Koide, Hiroshi.
Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA. ed. / Anon. IEEE, 1995. p. 168-173.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Generated order preserving real-time garbage collection
AU - Koide, Hiroshi
PY - 1995
Y1 - 1995
N2 - This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.
AB - This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.
UR - http://www.scopus.com/inward/record.url?scp=0029480984&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0029480984&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0029480984
SP - 168
EP - 173
BT - Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA
A2 - Anon, null
PB - IEEE
ER -