Spelling suggestions: "subject:"garbage collection (eomputer science)"" "subject:"garbage collection (aomputer science)""
1 |
Balancing space and time for moving garbage collectorsTong, Liangliang., 童亮亮. January 2011 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
|
2 |
A compiler-based approach to implementing smart pointersHoskins, Stephen. January 2007 (has links)
Thesis (M.S.)--George Mason University, 2007. / Title from PDF t.p. (viewed Jan. 18, 2008). Thesis director: Elizabeth White. Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science. Vita: p. 152. Includes bibliographical references (p. 150-151). Also available in print.
|
3 |
A systematic approach to garbage collection for real-time systemsFu, Wei, January 2007 (has links) (PDF)
Thesis (Ph. D.)--Washington State University, August 2007. / Includes bibliographical references (p. 168-179).
|
4 |
Garbage collection scheduling for Java applicationsLi, Chang. January 2001 (has links)
Thesis (M. Sc.)--York University, 2001. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 87-92). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ67749.
|
5 |
Deriving distributed garbage collectors from distributed termination algorithmsNorcross, Stuart John January 2004 (has links)
This thesis concentrates on the derivation of a modularised version of the DMOS distributed garbage collection algorithm and the implementation of this algorithm in a distributed computational environment. DMOS appears to exhibit a unique combination of attractive characteristics for a distributed garbage collector but the original algorithm is known to contain a bug and, previous to this work, lacks a satisfactory, understandable implementation. The relationship between distributed termination detection algorithms and distributed garbage collectors is central to this thesis. A modularised DMOS algorithm is developed using a previously published distributed garbage collector derivation methodology that centres on mapping centralised collection schemes to distributed termination detection algorithms. In examining the utility and suitability of the derivation methodology, a family of six distributed collectors is developed and an extension to the methodology is presented. The research work described in this thesis incorporates the definition and implementation of a distributed computational environment based on the ProcessBase language and a generic definition of a previously unimplemented distributed termination detection algorithm called Task Balancing. The role of distributed termination detection in the DMOS collection mechanisms is defined through a process of step-wise refinement. The implementation of the collector is achieved in two stages; the first stage defines the implementation of two distributed termination mappings with the Task Balancing algorithm; the second stage defines the DMOS collection mechanisms.
|
6 |
Memory management strategies to improve the space-time performance of Java programsYu, Ching-han., 余靜嫺. January 2006 (has links)
published_or_final_version / abstract / Computer Science / Doctoral / Doctor of Philosophy
|
7 |
Memory management strategies to improve the space-time performance of Java programsYu, Ching-han. January 2006 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.
|
8 |
Memory management strategies to improve the space-time performance of Java programs /Yu, Ching-han. January 2006 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2006. / Also available online.
|
9 |
A Functional Approach to Memory-Safe Operating SystemsLeslie, Rebekah 01 January 2011 (has links)
Purely functional languages--with static type systems and dynamic memory management using garbage collection--are a known tool for helping programmers to reduce the number of memory errors in programs. By using such languages, we can establish correctness properties relating to memory-safety through our choice of implementation language alone. Unfortunately, the language characteristics that make purely functional languages safe also make them more difficult to apply in a low-level domain like operating systems construction. The low-level features that support the kinds of hardware manipulations required by operating systems are not typically available in memory-safe languages with garbage collection. Those that are provided may have the ability to violate memory- and type-safety, destroying the guarantees that motivate using such languages in the first place. This work demonstrates that it is possible to bridge the gap between the requirements of operating system implementations and the features of purely functional languages without sacrificing type- and memory-safety. In particular, we show that this can be achieved by isolating the potentially unsafe memory operations required by operating systems in an abstraction layer that is well integrated with a purely functional language. The salient features of this abstraction layer are that the operations it exposes are memory-safe and yet sufficiently expressive to support the implementation of realistic operating systems. The abstraction layer enables systems programmers to perform all of the low-level tasks necessary in an OS implementation, such as manipulating an MMU and executing user-level programs, without compromising the static memory-safety guarantees of programming in a purely functional language. A specific contribution of this work is an analysis of memory-safety for the abstraction layer by formalizing a meaning for memory-safety in the presence of virtual-memory using a novel application of noninterference security policies. In addition, we evaluate the expressiveness of the abstraction layer by implementing the L4 microkernel API, which has a flexible set of virtual memory management operations.
|
10 |
Memory Management and Garbage Collection Algorithms for Java-Based PrologZhou, Qinan 08 1900 (has links)
Implementing a Prolog Runtime System in a language like Java which provides its own automatic memory management and safety features such as built--in index checking and array initialization requires a consistent approach to memory management based on a simple ultimate goal: minimizing total memory management time and extra space involved. The total memory management time for Jinni is made up of garbage collection time both for Java and Jinni itself. Extra space is usually requested at Jinni's garbage collection. This goal motivates us to find a simple and practical garbage collection algorithm and implementation for our Prolog engine. In this thesis we survey various algorithms already proposed and offer our own contribution to the study of garbage collection by improvements and optimizations for some classic algorithms. We implemented these algorithms based on the dynamic array algorithm for an all--dynamic Prolog engine (JINNI 2000). The comparisons of our implementations versus the originally proposed algorithm allow us to draw informative conclusions on their theoretical complexity model and their empirical effectiveness.
|
Page generated in 1.3248 seconds