A Reactive Approach to Comprehensive Global Garbage Detection
, by Louboutin, Sylvain R. Y.- ISBN: 9781581120448 | 1581120443
- Cover: Paperback
- Copyright: 2/1/1999
Introduction | p. 1 |
Object-Oriented Distributed Operating Systems | p. 1 |
Distributed Operating Systems | p. 1 |
Object Orientation | p. 2 |
The Need for Automatic Recycling of Storage Resources | p. 2 |
Supporting Distribution | p. 3 |
Supporting Transparent Persistence | p. 3 |
Escaping the Legacy of Centralised Garbage Collection | p. 4 |
Trade Offs | p. 4 |
Taxonomy | p. 4 |
Garbage Collection Versus Garbage Detection | p. 5 |
Stumbling Blocks of Proactive Global Garbage Detection | p. 6 |
Detecting Live Objects | p. 6 |
Scalability | p. 7 |
Robustness | p. 7 |
Reactive Global Garbage Detection | p. 8 |
Non-Comprehensive Approaches | p. 8 |
Heuristics | p. 9 |
An Intrinsically Comprehensive Reactive Approach | p. 9 |
Contribution and Outline of this Thesis | p. 11 |
Summary | p. 13 |
Background | p. 14 |
Centralised Garbage Collection | p. 15 |
Cells, Pointers, Roots, and Garbage | p. 15 |
Reference Counting | p. 16 |
Graph Tracing | p. 17 |
Garbage Collection and Global Garbage Detection | p. 19 |
Reactive versus Proactive Garbage Detection | p. 19 |
Decentralised Object Oriented Systems | p. 20 |
Application Support Protocols | p. 21 |
Support for Distributed and Persistent Programming | p. 21 |
Objects, References, and Sites | p. 22 |
Reference Swizzling and Object Faulting | p. 23 |
Transparent Persistence | p. 29 |
Global Garbage Detection | p. 32 |
Partitioned Address Spaces and Root Sets | p. 32 |
Log Keeping | p. 34 |
The Global Root Graph | p. 35 |
Summary | p. 36 |
Related Work | p. 37 |
Taxonomy | p. 37 |
Proactive versus Reactive Global Garbage Detection | p. 38 |
Roadmap to the Remainder of this Chapter | p. 39 |
Proactive Algorithms | p. 41 |
"In Situ" Graph Colouring | p. 41 |
Global Root Graph Reconstruction | p. 49 |
Discussion | p. 55 |
Reactive Algorithms | p. 56 |
Weighted Reference Counting | p. 57 |
Indirect Reference Counting | p. 59 |
Reference Listing | p. 60 |
Time Stamp Packet Distribution | p. 64 |
Discussion | p. 65 |
Heuristics and Hybrids | p. 66 |
Heuristic Object Grouping | p. 66 |
Hybrids | p. 67 |
Summary | p. 68 |
Characterisation of Garbage | p. 69 |
Distributed Computations | p. 70 |
Events, Direct Dependencies, and Computation Graphs | p. 70 |
Space Time Diagrams | p. 71 |
Causality and Concurrency | p. 72 |
Consistent Cuts | p. 73 |
Causal History | p. 74 |
Vector Clocks | p. 75 |
Computing Vector-Clocks | p. 76 |
Global Mutator Model | p. 80 |
Conventional Mutator Models | p. 80 |
Log Keeping Events | p. 81 |
Edge Creation and Edge Destruction Events | p. 81 |
Example | p. 82 |
Path Histories of Log-Keeping Events | p. 83 |
Path History and Causal History | p. 88 |
Characterisation of Garbage | p. 90 |
Existence of a Path | p. 91 |
Absence of a Path and Primal Root | p. 92 |
Computing the Path History of a Log Keeping Event | p. 93 |
Summary | p. 94 |
A Path Listing Algorithm | p. 95 |
Log-Keeping Strategies | p. 96 |
Notations and Conventions | p. 96 |
Eager Log-Keeping | p. 97 |
Lazy Log-Keeping | p. 100 |
Example | p. 106 |
Discussion | p. 109 |
Global Garbage Detection | p. 109 |
Ideal Situation | p. 110 |
Computing Dependency Vectors | p. 111 |
Local Garbage Collection | p. 118 |
Example | p. 119 |
Discussion | p. 119 |
Summary | p. 121 |
Lazy Log-Keeping on Amadeus | p. 122 |
Amadeus | p. 122 |
Object Clustering | p. 123 |
Object Faulting and Reference Swizzling | p. 125 |
Log-Keeping | p. 126 |
Notation | p. 126 |
Clusters as Log-Keeping Unit | p. 127 |
Lazy Log-Keeping | p. 129 |
Partial Back Pointer Path | p. 129 |
Growth of a Tree of Partial Back Pointer Paths | p. 130 |
Inaccuracies in the Logs | p. 136 |
Pruning the Partial Back Pointer Path Trees | p. 136 |
Local Garbage Collection | p. 137 |
Objects, Proxies, and Log Entries | p. 138 |
Edge-Destruction Control Messages | p. 138 |
Summary | p. 139 |
Conclusions | p. 141 |
Summary of Contributions | p. 141 |
A New Taxonomy of Existing Global Garbage Detection Algorithms | p. 142 |
Key Idea | p. 142 |
A New Global Mutator Model | p. 143 |
Log-Keeping | p. 143 |
A Path Listing Algorithm | p. 144 |
Evaluation | p. 144 |
Scalability | p. 145 |
Robustness | p. 148 |
Future Work | p. 150 |
Harvesting Empirical Data | p. 150 |
Defining New Benchmarking Methodology | p. 151 |
Assessing and Addressing The Limitations Of The Algorithm | p. 151 |
Exploring New Domains of Application | p. 152 |
Summary of the Thesis | p. 153 |
Bibliography | p. 154 |
Table of Contents provided by Syndetics. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.