Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 15 of 15 for “"Reference counting"”.
-
High Performance Reference Counting and Conservative Garbage Collection
… 1960 with two algorithmic branches — tracing and reference counting. Tracing identifies live objects by performing a transitive closure over the object graph starting with the stacks, registers, and global variables as roots. Objects not reached by the trace are implicitly dead, so the collector …
-
Time-Predictable Dynamic Memory Management for Java Based on Reference Counting
… tasks in a separate hardware unit, the Reference Counting Unit (RCU), thereby simplifying static analysis and improving worst-case performance. This thesis presents both the concepts and specific memory models underpinning the RCU, and how they relate to Java (the programming language …
-
An experimental study of memory management in Rust programming for big data processing
… a selection of different variable types, use of Reference Counting, and multithreading with Atomic Reference Counting. In this thesis, we conducted an experimental study to assess how much these different memory management strategies differ regarding overall runtime performance. Our experiments …
-
Perceus for OCaml
… a new approach for achieving automated reference counting with impressive performance capabilities. However, a direct comparison of this algorithm to a garbage collector within the same system has not been conducted, leading to an unresolved research question about whether Perceus can …
-
Subheap-Augmented Garbage Collection
… allows the programmer to encode a form of reference counting using Hayes' notion of key objects. Preliminary experimental data suggests that our proposed mechanism can avoid high overheads suffered by tracing collectors in some scenarios, especially with tight heaps. However, for other …
-
Memory reclamation in Emerald: an object-oriented programming language
… 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 …
-
Automatic Memory Management in ORB SLAM-3
… automatic memory management strategy using the reference counting scheme. The testing and profiling on the EuRoC dataset demonstrate the viability of such a scheme with minimal execution overhead. Additionally, an alternative keyframe redundancy marking scheme is presented in this thesis with a …
-
Garbage elimination in SA-C host code
… as any SA-C array data which is unused or unreferenced in the host code program heap at any time. Garbage must not be created and it must be freed as soon as possible. In this paper it will be shown that the single-assignment properties of the language create garbage when single-assignment …
-
Exploring Intralingual Design in Operating Systems
… management bugs can be eliminated when shifting reference counting to the compiler.
-
Local-spin Abortable Mutual Exclusion
… when no processes abort. We develop a new reference counting method to bound the space used in this algorithm.
-
A Language for Embedded and Cyber-Physical Systems
… system provides a cohesive set of three distinct reference types; each with varying degrees of flexibility and runtime overhead. Additionally, the design also proposes techniques to minimize the performance impact of automatic reference counting.
-
The Concept of Ownership in Rust and Swift
… also implements ownership concept in Automatic Reference Counting ARC. Though the ownership concept is adapted in Swift, it is not a memory safe language because of possibility of strong reference cycles. In this research, a demonstration of the ownership in Rust and Swift will be discussed and …
-
Efficient and Scalable Graph Pattern Matching on Massive Graphs
… in an on-disk CSR format and adopts an atomic reference counting cache to cache frequently used vertices in its buffer pool to achieve a zero-copy cache read. A task-based scheduler is designed for bounded-memory execution. We encounter a second level of parallelism by utilising SIMD …
-
Garbage collector objektů jazyka PNtalk
Tato práce se zabývá návrhem a implementací garbage collectoru pro virtuální stroj jazyka PNtalk. Jsou v ní popsány a zhodnoceny jednotlivé přístupy a konkrétní algoritmy pro automatickou správu paměti a detailne popsáno jejich využití v praktické implementaci pro vitruálne stroje PNtalku, které …
-
Specializovaný engine pro RPG hry
Práce se zabývá návrhem a implementací herního enginu určeného pro tvorbu her typu RPG. Cílovými vlastnostmi enginu jsou flexibilita, efektivita herního vývoje a uživatelská přívětivost. Práce podrobně popisuje návrh enginu a částečně implementaci vybraných částí. Práce dále popisuje projekty …