- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Memory reclamation in Emerald: an object-oriented programming...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Memory reclamation in Emerald: an object-oriented programming language Han, Xiaomei
Abstract
Storage management is an important part of a programming system. There are two basic storage management techniques: explicit storage management and automatic storage management. This thesis investigates automatic storage management, garbage collection techniques, in the object-oriented programming language Emerald. In general, garbage collection algorithms fall into four categories, namely, reference counting, markand- sweep , copying, and generational copying based algorithms. Since these garbage collection techniques have been proposed, there has been a large amount of work done. However, the work has mainly focussed on garbage collection of functional programming languages. How well will these garbage collection techniques perform in an objectoriented programming paradigm in which the behavior is rather diiferent from that of functional programming languages? This thesis mainly aims at studying the most promising garbage collection technique — the generational garbage collection algorithm, and gathering and measuring the parameters that affect the generational garbage collection. We use both simulation and measurement of an actual implementation to compare the performance of several alternating garbage collection techniques in Emerald.
Item Metadata
Title |
Memory reclamation in Emerald: an object-oriented programming language
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
1994
|
Description |
Storage management is an important part of a programming system. There are two
basic storage management techniques: explicit storage management and automatic storage
management. This thesis investigates automatic storage management, garbage collection
techniques, in the object-oriented programming language Emerald. In general,
garbage collection algorithms fall into four categories, namely, reference counting, markand-
sweep , copying, and generational copying based algorithms. Since these garbage
collection techniques have been proposed, there has been a large amount of work done.
However, the work has mainly focussed on garbage collection of functional programming
languages. How well will these garbage collection techniques perform in an objectoriented
programming paradigm in which the behavior is rather diiferent from that of
functional programming languages? This thesis mainly aims at studying the most promising
garbage collection technique — the generational garbage collection algorithm, and
gathering and measuring the parameters that affect the generational garbage collection.
We use both simulation and measurement of an actual implementation to compare the
performance of several alternating garbage collection techniques in Emerald.
|
Extent |
3223046 bytes
|
Genre | |
Type | |
File Format |
application/pdf
|
Language |
eng
|
Date Available |
2009-03-02
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
|
DOI |
10.14288/1.0051432
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
1994-11
|
Campus | |
Scholarly Level |
Graduate
|
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.