subject:(compile time garbage collection)

University of Melbourne

1. GIUCA, MATTHEW. Mars: an imperative/declarative higher-order programming language with automatic destructive update.

Degree: 2014, University of Melbourne

► For years, we have enjoyed the robustness of programming without side-effects in languages such as Haskell and Mercury. Yet in order to use languages with… (more)

Subjects/Keywords: programming languages; imperative programming; declarative programming; destructive update; compile-time garbage collection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

GIUCA, M. (2014). Mars: an imperative/declarative higher-order programming language with automatic destructive update. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/43263

Chicago Manual of Style (16^th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Doctoral Dissertation, University of Melbourne. Accessed January 20, 2021. http://hdl.handle.net/11343/43263.

MLA Handbook (7^th Edition):

GIUCA, MATTHEW. “Mars: an imperative/declarative higher-order programming language with automatic destructive update.” 2014. Web. 20 Jan 2021.

Vancouver:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Internet] [Doctoral dissertation]. University of Melbourne; 2014. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/11343/43263.

Council of Science Editors:

GIUCA M. Mars: an imperative/declarative higher-order programming language with automatic destructive update. [Doctoral Dissertation]. University of Melbourne; 2014. Available from: http://hdl.handle.net/11343/43263

Missouri University of Science and Technology

2. Nerella, Venkata Krishna Suhas. Exploring run-time reduction in programming codes via query optimization and caching.

Degree: PhD, Computer Science, Missouri University of Science and Technology

URL: https://scholarsmine.mst.edu/doctoral_dissertations/2062

► "Object oriented programming languages raised the level of abstraction by supporting the explicit first class query constructs in the programming codes. These query constructs allow… (more)

Subjects/Keywords: Collection queries; Run time; Compile time; Histograms; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nerella, V. K. S. (n.d.). Exploring run-time reduction in programming codes via query optimization and caching. (Doctoral Dissertation). Missouri University of Science and Technology. Retrieved from https://scholarsmine.mst.edu/doctoral_dissertations/2062

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16^th Edition):

Nerella, Venkata Krishna Suhas. “Exploring run-time reduction in programming codes via query optimization and caching.” Doctoral Dissertation, Missouri University of Science and Technology. Accessed January 20, 2021. https://scholarsmine.mst.edu/doctoral_dissertations/2062.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7^th Edition):

Nerella, Venkata Krishna Suhas. “Exploring run-time reduction in programming codes via query optimization and caching.” Web. 20 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Nerella VKS. Exploring run-time reduction in programming codes via query optimization and caching. [Internet] [Doctoral dissertation]. Missouri University of Science and Technology; [cited 2021 Jan 20]. Available from: https://scholarsmine.mst.edu/doctoral_dissertations/2062.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Nerella VKS. Exploring run-time reduction in programming codes via query optimization and caching. [Doctoral Dissertation]. Missouri University of Science and Technology; Available from: https://scholarsmine.mst.edu/doctoral_dissertations/2062

Note: this citation may be lacking information needed for this citation format:
No year of publication.

NSYSU

3. Huang, Chih-Hung. Detecting Java Memory Leak by Time Series Analysis.

Degree: Master, Information Management, 2007, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723107-154522

► A memory leak is a common software vulnerability that will lead to performance degradation of the software or crash or both. A Memory leak is… (more)

Subjects/Keywords: Resource Testing; Memory Leak; Time Series Analysis; Garbage Collection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huang, C. (2007). Detecting Java Memory Leak by Time Series Analysis. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723107-154522

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Huang, Chih-Hung. “Detecting Java Memory Leak by Time Series Analysis.” 2007. Thesis, NSYSU. Accessed January 20, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723107-154522.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Huang, Chih-Hung. “Detecting Java Memory Leak by Time Series Analysis.” 2007. Web. 20 Jan 2021.

Vancouver:

Huang C. Detecting Java Memory Leak by Time Series Analysis. [Internet] [Thesis]. NSYSU; 2007. [cited 2021 Jan 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723107-154522.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang C. Detecting Java Memory Leak by Time Series Analysis. [Thesis]. NSYSU; 2007. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0723107-154522

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

4. Lai, Chien-An. Flash Memory Garbage Collection in Hard Real-Time Systems.

Degree: MS, Computer Science, 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195

► Due to advances in capacity, speed, and economics, NAND-based flash memory technology is increasingly integrated into all types of computing systems, ranging from enterprise servers… (more)

Subjects/Keywords: real-time systems; flash memory; garbage collection

…between time and freed memory capacity during garbage collection… …unpredictable points in time for unpredictable lengths of time due to garbage collection. From a… …blocking time caused by a single 3 garbage collection round must be represented and bounded… …research about garbage collection in real-time system. In Chapter III we will describe a… …we describe the problem of scheduling real-time tasks with flash memory garbage collection…

9 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lai, C. (2012). Flash Memory Garbage Collection in Hard Real-Time Systems. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195

Chicago Manual of Style (16^th Edition):

Lai, Chien-An. “Flash Memory Garbage Collection in Hard Real-Time Systems.” 2012. Masters Thesis, Texas A&M University. Accessed January 20, 2021. http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195.

MLA Handbook (7^th Edition):

Lai, Chien-An. “Flash Memory Garbage Collection in Hard Real-Time Systems.” 2012. Web. 20 Jan 2021.

Vancouver:

Lai C. Flash Memory Garbage Collection in Hard Real-Time Systems. [Internet] [Masters thesis]. Texas A&M University; 2012. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195.

Council of Science Editors:

Lai C. Flash Memory Garbage Collection in Hard Real-Time Systems. [Masters Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-08-10195

Australian National University

5. Wang, Kunshan. Micro Virtual Machines: A Solid Foundation for Managed Language Implementation .

Degree: 2017, Australian National University

URL: http://hdl.handle.net/1885/147871

► Today new programming languages proliferate, but many of them suffer from poor performance and inscrutable semantics. We assert that the root of many of the… (more)

▼ Today new programming languages proliferate, but many of them suffer from poor performance and inscrutable semantics. We assert that the root of many of the performance and semantic problems of today's languages is that language implementation is extremely difficult. This thesis addresses the fundamental challenges of efficiently developing high-level managed languages. Modern high-level languages provide abstractions over execution, memory management and concurrency. It requires enormous intellectual capability and engineering effort to properly manage these concerns. Lacking such resources, developers usually choose naive implementation approaches in the early stages of language design, a strategy which too often has long-term consequences, hindering the future development of the language. Existing language development platforms have failed to provide the right level of abstraction, and forced implementers to reinvent low-level mechanisms in order to obtain performance. My thesis is that the introduction of micro virtual machines will allow the development of higher-quality, high-performance managed languages. The first contribution of this thesis is the design of Mu, with the specification of Mu as the main outcome. Mu is the first micro virtual machine, a robust, performant, and light-weight abstraction over just three concerns: execution, concurrency and garbage collection. Such a foundation attacks three of the most fundamental and challenging issues that face existing language designs and implementations, leaving the language implementers free to focus on the higher levels of their language design. The second contribution is an in-depth analysis of on-stack replacement and its efficient implementation. This low-level mechanism underpins run-time feedback-directed optimisation, which is key to the efficient implementation of dynamic languages. The third contribution is demonstrating the viability of Mu through RPython, a real-world non-trivial language implementation. We also did some preliminary research of GHC as a Mu client. We have created the Mu specification and its reference implementation, both of which are open-source. We show that that Mu's on-stack replacement API can gracefully support dynamic languages such as JavaScript, and it is implementable on concrete hardware. Our RPython client has been able to translate and execute non-trivial RPython programs, and can run the RPySOM interpreter and the core of the PyPy interpreter. With micro virtual machines providing a low-level substrate, language developers now have the option to build their next language on a micro virtual machine. We believe that…

Subjects/Keywords: micro virtual machines; virtual machines; programming language implementation; concurrency; just-in-time compiling; garbage collection; on-stack replacement; PyPy; RPython

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wang, K. (2017). Micro Virtual Machines: A Solid Foundation for Managed Language Implementation . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/147871

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wang, Kunshan. “Micro Virtual Machines: A Solid Foundation for Managed Language Implementation .” 2017. Thesis, Australian National University. Accessed January 20, 2021. http://hdl.handle.net/1885/147871.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wang, Kunshan. “Micro Virtual Machines: A Solid Foundation for Managed Language Implementation .” 2017. Web. 20 Jan 2021.

Vancouver:

Wang K. Micro Virtual Machines: A Solid Foundation for Managed Language Implementation . [Internet] [Thesis]. Australian National University; 2017. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1885/147871.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang K. Micro Virtual Machines: A Solid Foundation for Managed Language Implementation . [Thesis]. Australian National University; 2017. Available from: http://hdl.handle.net/1885/147871

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

6. Feizabadi, Shahrooz Shojania. Garbage Collection Scheduling for Utility Accrual Real-Time Systems.

Degree: PhD, Computer Science, 2006, Virginia Tech

URL: http://hdl.handle.net/10919/30233

► Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that… (more)

▼ Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU overload, this dissertation explores memory overload conditions during which the aggregate memory demand exceeds a system's available memory bandwidth. Real-time systems are typically implemented in C or other languages that use explicit dynamic memory management. Taking advantage of modern type-safe languages, such as Java, necessitates the use of garbage collection (GC). The timeliness requirements of real-time systems, however, impose specific demands on the garbage collector. Garbage collection introduces a significant source of unpredictability in the execution timeline of a task because it unexpectedly interjects pauses of arbitrary length, at arbitrary points in time, with an arbitrary frequency. To construct a feasible schedule, a real-time scheduler must have the ability to predict the collector's activities and plan for them accordingly. We have devised CADUS (Collector-Aware Dynamic Utility Scheduler), a utility accrual algorithm that tightly links CPU scheduling with the memory requirements -and the corresponding garbage collection activities - of real-time tasks. By constructing and storing memory time allocation profiles, we address the problem of GC activation strategy. We estimate GC latency by using a real-time collector and modeling its behavior. We project GC frequency by planning, at schedule construction time, the memory bandwidth available to the collector. CADUS can point the collector's activities to any specific task in the system. The runtime system provides this ability by maintaining separate logical heaps for all tasks. We demonstrate the viability of CADUS through extensive simulation studies. We evaluated the behavior of CADUS under a wide range of CPU and memory load conditions and utility distributions. We compared its performance against an existing GC-unaware UA scheduler and found that CADUS consistently outperformed its GC-unaware counterpart. We investigated and identified the reasons for the superior performance of CADUS and quantified our results. Most significantly, we found that in an overloaded dynamic soft real-time system, a scheduler's preemption decisions have a highly significant impact on GC latency. A dynamic real-time scheduler therefore must predict the impact of its preemption decisions on GC latency in order to construct time-feasible schedules. Advisors/Committee Members: Back, Godmar Volker (committeechair), Nance, Richard E. (committee member), Jensen, E. Douglas (committee member), Arthur, James D. (committee member), Cline, Benjamin E. (committee member), Fox, Edward A. (committeecochair).

Subjects/Keywords: Garbage Collection; Utility Accrual Scheduling; Real-Time Systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Feizabadi, S. S. (2006). Garbage Collection Scheduling for Utility Accrual Real-Time Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/30233

Chicago Manual of Style (16^th Edition):

Feizabadi, Shahrooz Shojania. “Garbage Collection Scheduling for Utility Accrual Real-Time Systems.” 2006. Doctoral Dissertation, Virginia Tech. Accessed January 20, 2021. http://hdl.handle.net/10919/30233.

MLA Handbook (7^th Edition):

Feizabadi, Shahrooz Shojania. “Garbage Collection Scheduling for Utility Accrual Real-Time Systems.” 2006. Web. 20 Jan 2021.

Vancouver:

Feizabadi SS. Garbage Collection Scheduling for Utility Accrual Real-Time Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2006. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10919/30233.

Council of Science Editors:

Feizabadi SS. Garbage Collection Scheduling for Utility Accrual Real-Time Systems. [Doctoral Dissertation]. Virginia Tech; 2006. Available from: http://hdl.handle.net/10919/30233

7. Bhandari, Kumud. General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory.

Degree: PhD, Engineering, 2018, Rice University

URL: http://hdl.handle.net/1911/105656

► Emerging byte-addressable non-volatile random access memory (NVRAM) technologies allow persistent data to be accessed and manipulated using CPU load and store instructions. The persistent data… (more)

Subjects/Keywords: NVRAM; persistence; programming; memory allocation; garbage collection

14 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bhandari, K. (2018). General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory. (Doctoral Dissertation). Rice University. Retrieved from http://hdl.handle.net/1911/105656

Chicago Manual of Style (16^th Edition):

Bhandari, Kumud. “General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory.” 2018. Doctoral Dissertation, Rice University. Accessed January 20, 2021. http://hdl.handle.net/1911/105656.

MLA Handbook (7^th Edition):

Bhandari, Kumud. “General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory.” 2018. Web. 20 Jan 2021.

Vancouver:

Bhandari K. General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory. [Internet] [Doctoral dissertation]. Rice University; 2018. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1911/105656.

Council of Science Editors:

Bhandari K. General-purpose Programming Techniques for Emerging Systems with Non-volatile Byte-addressable Random Access Memory. [Doctoral Dissertation]. Rice University; 2018. Available from: http://hdl.handle.net/1911/105656

University of Pennsylvania

8. Karel, Benjamin. Subheap-Augmented Garbage Collection.

Degree: 2019, University of Pennsylvania

URL: https://repository.upenn.edu/edissertations/3670

► Automated memory management avoids the tedium and danger of manual techniques. However, as no programmer input is required, no widely available interface exists to permit… (more)

Subjects/Keywords: Garbage Collection; Memory Management; Subheaps; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Karel, B. (2019). Subheap-Augmented Garbage Collection. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3670

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Karel, Benjamin. “Subheap-Augmented Garbage Collection.” 2019. Thesis, University of Pennsylvania. Accessed January 20, 2021. https://repository.upenn.edu/edissertations/3670.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Karel, Benjamin. “Subheap-Augmented Garbage Collection.” 2019. Web. 20 Jan 2021.

Vancouver:

Karel B. Subheap-Augmented Garbage Collection. [Internet] [Thesis]. University of Pennsylvania; 2019. [cited 2021 Jan 20]. Available from: https://repository.upenn.edu/edissertations/3670.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Karel B. Subheap-Augmented Garbage Collection. [Thesis]. University of Pennsylvania; 2019. Available from: https://repository.upenn.edu/edissertations/3670

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of New Mexico

9. Ericksen, John. Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android.

Degree: Department of Computer Science, 2016, University of New Mexico

URL: http://hdl.handle.net/1928/32945

► Modern Java application development makes use of metaprogramming to offset and reduce application boilerplate. Unfortunately, metaprogramming techniques typically require a relatively high run-time cost, particularly… (more)

Subjects/Keywords: Dependency Injection; Android; Compile time; Annotation Processing; Metaprogramming; Boilerplate

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ericksen, J. (2016). Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/32945

Chicago Manual of Style (16^th Edition):

Ericksen, John. “Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android.” 2016. Masters Thesis, University of New Mexico. Accessed January 20, 2021. http://hdl.handle.net/1928/32945.

MLA Handbook (7^th Edition):

Ericksen, John. “Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android.” 2016. Web. 20 Jan 2021.

Vancouver:

Ericksen J. Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android. [Internet] [Masters thesis]. University of New Mexico; 2016. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1928/32945.

Council of Science Editors:

Ericksen J. Transfuse: A Compile-Time Metaprogramming Solution for Reducing Boilerplate on Google's Android. [Masters Thesis]. University of New Mexico; 2016. Available from: http://hdl.handle.net/1928/32945

Australian National University

10. Shahriyar, Rifat. High Performance Reference Counting and Conservative Garbage Collection .

Degree: 2015, Australian National University

URL: http://hdl.handle.net/1885/99879

► Garbage collection is an integral part of modern programming languages. It automatically reclaims memory occupied by objects that are no longer in use. Garbage collection… (more)

Subjects/Keywords: Garbe Collection; Reference Counting; Conservative Garbage Collection; RC Immix

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shahriyar, R. (2015). High Performance Reference Counting and Conservative Garbage Collection . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/99879

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shahriyar, Rifat. “High Performance Reference Counting and Conservative Garbage Collection .” 2015. Thesis, Australian National University. Accessed January 20, 2021. http://hdl.handle.net/1885/99879.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shahriyar, Rifat. “High Performance Reference Counting and Conservative Garbage Collection .” 2015. Web. 20 Jan 2021.

Vancouver:

Shahriyar R. High Performance Reference Counting and Conservative Garbage Collection . [Internet] [Thesis]. Australian National University; 2015. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1885/99879.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shahriyar R. High Performance Reference Counting and Conservative Garbage Collection . [Thesis]. Australian National University; 2015. Available from: http://hdl.handle.net/1885/99879

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Luleå University of Technology

11. Mattsson, Johan. Garbage collection with hard real-time requirements.

Degree: 2004, Luleå University of Technology

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-48881

►

Automated memory management techniques, or garbage collection, reduces the complexity and problems of manual memory management. When used properly, it will lower development costs… (more)

Subjects/Keywords: Technology; garbage collection; memory management; hard real-time; timber; reference counting; Teknik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mattsson, J. (2004). Garbage collection with hard real-time requirements. (Thesis). Luleå University of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-48881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mattsson, Johan. “Garbage collection with hard real-time requirements.” 2004. Thesis, Luleå University of Technology. Accessed January 20, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-48881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mattsson, Johan. “Garbage collection with hard real-time requirements.” 2004. Web. 20 Jan 2021.

Vancouver:

Mattsson J. Garbage collection with hard real-time requirements. [Internet] [Thesis]. Luleå University of Technology; 2004. [cited 2021 Jan 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-48881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mattsson J. Garbage collection with hard real-time requirements. [Thesis]. Luleå University of Technology; 2004. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-48881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

12. Mišák, Ján. Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/61939

► This thesis deals with the designing of a garbage collector for the PNtalk virtual machine. It describes and rates the approaches and algorithms for an… (more)

Subjects/Keywords: PNtalk; garbage collector; zpráva paměti; mark-sweep; mark-compact; kopírovací garbage collector; počítání referencí; generační garbage collector; Petriho síť; PNtalk; garbage collector; memory management; mark-sweep; mark-compact; copying garbage collection; reference counting; generational garbage collection; Petri net

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mišák, J. (2019). Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/61939

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Mišák, Ján. “Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects.” 2019. Thesis, Brno University of Technology. Accessed January 20, 2021. http://hdl.handle.net/11012/61939.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Mišák, Ján. “Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects.” 2019. Web. 20 Jan 2021.

Vancouver:

Mišák J. Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/11012/61939.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mišák J. Garbage collector objektů jazyka PNtalk: Garbage Collector for PNtalk Objects. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/61939

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Marlene Fernandes. COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR.

Degree: 2007, Universidade do Vale do Itajaí

URL: http://www6.univali.br/tede/tde_busca/arquivo.php?codArquivo=371

►

Dado o crescimento das cidades, a quantidade de resíduos sólidos produzida toma proporções alarmantes, o que exige das municipalidades soluções urgentes. A administração adequada dos… (more)

▼

Dado o crescimento das cidades, a quantidade de resíduos sólidos produzida toma proporções alarmantes, o que exige das municipalidades soluções urgentes. A administração adequada dos resíduos sólidos recicláveis faz parte da solução dos problemas relacionados com a coleta e disposição final dos resíduos sólidos. Esta envolve diversos agentes, destacando-se os catadores, os quais coletam esse material reciclável no meio urbano. Inúmeras prefeituras adotam modelos de coleta seletiva que têm a participação de associações e cooperativas de catadores. O presente trabalho teve como objetivo geral analisar e comparar os programas de coleta seletiva de resíduos sólidos adotados por Florianópolis, Belo Horizonte e Londrina, por apresentarem programas bem desenvolvidos nessa área. Especificamente, objetivou: a) definir categorias de análise comparativa entre os programas estudados; b) comparar os programas em estudo com base nas categorias analíticas; e c) investigar as diferenças e semelhanças na gestão dos programas em estudo. A metodologia da pesquisa é classificada como qualitativa e descritiva, utilizando com estratégia o estudo de casos múltiplos. Com relação ao reconhecimento do trabalho desenvolvido pelos catadores, verificou-se, mediante os três programas analisados, que o catador vem conquistando seu reconhecimento por parte da população e do Poder Público local, bem como sua inclusão social pela municipalidade. Quanto à forma de organização de trabalho em Florianópolis e Belo Horizonte, os catadores estão organizados em associações, enquanto em Londrina trabalham de forma cooperativa. Uma semelhança desses programas é que são apoiados pelo Poder Público. Constatou-se ainda que os catadores, de modo geral, possuem baixa renda e pouca capacitação para o trabalho desenvolvido.

Due the growth of the cities, the amount of solid waste produced is assuming alarming proportions, requiring urgent solutions on the part of municipal districts. The appropriate management of the recyclable solid waste is part of the solution for the problems related the collection and final disposal of solid waste This involves various agents, such as waste collectors, who collect this recyclable material in the urban environment. Countless local councils are adopting models of selective collection, with the participation of garbage collectors` associations and cooperatives. The general objective of the present work was to analyze and compare the selective solid waste collection programs adopted by the cities of Florianópolis, Belo Horizonte and Londrina, which all have very advanced programs in this area. The specific objectives were: a) to define categories for comparative analysis among the programs studied; b) to compare the programs studied, based in the analytical categories; c) to investigate the differences and similarities in the management of the programs studied. The research methodology is classified as qualitative and descriptive, using the strategy of multiple case study. In relation to the recognition of the work carried out by…

Advisors/Committee Members: Elaine Ferreira, Sérgio Luís Boeira, Maria Chalfin Coutinho.

Subjects/Keywords: coleta seletiva; Coleta de lixo - Administração; ADMINISTRACAO; garbage collectors; solid waste; collection garbage programs; selective garbage collection; catadores; resíduos sólidos; programas de coleta

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Fernandes, M. (2007). COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR. (Thesis). Universidade do Vale do Itajaí. Retrieved from http://www6.univali.br/tede/tde_busca/arquivo.php?codArquivo=371

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Fernandes, Marlene. “COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR.” 2007. Thesis, Universidade do Vale do Itajaí. Accessed January 20, 2021. http://www6.univali.br/tede/tde_busca/arquivo.php?codArquivo=371.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Fernandes, Marlene. “COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR.” 2007. Web. 20 Jan 2021.

Vancouver:

Fernandes M. COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR. [Internet] [Thesis]. Universidade do Vale do Itajaí; 2007. [cited 2021 Jan 20]. Available from: http://www6.univali.br/tede/tde_busca/arquivo.php?codArquivo=371.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fernandes M. COLETA SELETIVA DE RESÍDUOS SÓLIDOS URBANOS: um estudo da gestão dos programas de Florianópolis/SC, Belo Horizonte/MG e Londrina/PR. [Thesis]. Universidade do Vale do Itajaí; 2007. Available from: http://www6.univali.br/tede/tde_busca/arquivo.php?codArquivo=371

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Hong Kong

14. 童亮亮. Balancing space and time for moving garbage collectors.

Degree: 2011, University of Hong Kong

URL: http://hdl.handle.net/10722/133269

Subjects/Keywords: Garbage collection (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

童亮亮.. (2011). Balancing space and time for moving garbage collectors. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/133269

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

童亮亮.. “Balancing space and time for moving garbage collectors.” 2011. Thesis, University of Hong Kong. Accessed January 20, 2021. http://hdl.handle.net/10722/133269.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

童亮亮.. “Balancing space and time for moving garbage collectors.” 2011. Web. 20 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

童亮亮.. Balancing space and time for moving garbage collectors. [Internet] [Thesis]. University of Hong Kong; 2011. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10722/133269.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

童亮亮.. Balancing space and time for moving garbage collectors. [Thesis]. University of Hong Kong; 2011. Available from: http://hdl.handle.net/10722/133269

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

15. Jackson, Patrick. Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services.

Degree: Information Assurance: M.S., Information Assurance and Information Systems, 2018, St. Cloud State University

URL: https://repository.stcloudstate.edu/msia_etds/57

► Garbage collection is proving to be an important feature that supports high-performance web services, especially those running data-intensive applications. Due to the use of… (more)

▼ Garbage collection is proving to be an important feature that supports high-performance web services, especially those running data-intensive applications. Due to the use of the object-oriented paradigm, many applications have increasingly opted for the dynamic memory allocation method of assigning their objects in computer memory. During program execution, the application allocates its objects to a memory space called a heap and constantly references these objects within that memory space. With the passage of time, if the objects are not referenced, they become weak/dead to the extent that they can no longer be referenced by an application which allocated them. In such a scenario, the application is required to allocate new objects to a heap in order to continue performing its functions. And, there must be a garbage collection mechanism to remove the dead/weak (unreferenced) objects from the memory heap so that the memory space can be reclaimed and dynamically allocated to other application objects. Java as a Virtual machine, performs memory allocation and reclamation by itself thereby allowing the programmer to concentrate only on the functionality of the application. In other words, the developer is not concerned about how the memory will be managed during the program execution because that will be the duty of the Java language executing on Java Virtual machine. Therefore, for Java to effectively manage the computer memory, it uses five garbage collection mechanisms which will be explained in detail in the introduction section. Most of the garbage collections are triggered based on the objects’ lifetime predictions set by the developer of the garbage collection algorithms. None or very few consider the strength of the objects that are no longer referenced in the heap. For example, some objects may still be strong enough that they can be referenced by the application but they are collected anyway because they have reached their predicted age threshold. Garbage collection mechanisms also vary when used in a different framework other than the traditional (standalone) one. For example, garbage collection in distributed systems becomes more complicated as compared to the traditional garbage collection performed in standalone systems. Similarly, garbage collection in a web-service framework has slight differences as compared to the local/standalone systems due to the inclusion of web service technology elements. In this paper, the goal is to strive to determine the strength of objects that are no longer referenced by an application in a web service as managed by Java-based services; in relation to the performance of a web application. Advisors/Committee Members: Dennis Guster, Erich Rice, Balasubramanian Kasi.

Subjects/Keywords: Garbage collection; Apache Tomcat; object strength; web service; YourKit Java Profiler

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Jackson, P. (2018). Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services. (Masters Thesis). St. Cloud State University. Retrieved from https://repository.stcloudstate.edu/msia_etds/57

Chicago Manual of Style (16^th Edition):

Jackson, Patrick. “Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services.” 2018. Masters Thesis, St. Cloud State University. Accessed January 20, 2021. https://repository.stcloudstate.edu/msia_etds/57.

MLA Handbook (7^th Edition):

Jackson, Patrick. “Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services.” 2018. Web. 20 Jan 2021.

Vancouver:

Jackson P. Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services. [Internet] [Masters thesis]. St. Cloud State University; 2018. [cited 2021 Jan 20]. Available from: https://repository.stcloudstate.edu/msia_etds/57.

Council of Science Editors:

Jackson P. Long Term Assessment of Object Strength in a Web Service as Managed by the Garbage Collection in Java Based Services. [Masters Thesis]. St. Cloud State University; 2018. Available from: https://repository.stcloudstate.edu/msia_etds/57

North Carolina State University

16. Wagle, Prasad Ajit. Cache Line Boundary Allocation for Garbage Collected Systems.

Degree: MS, Computer Engineering, 2007, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/1597

Subjects/Keywords: cache line; allocation; garbage collection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wagle, P. A. (2007). Cache Line Boundary Allocation for Garbage Collected Systems. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/1597

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wagle, Prasad Ajit. “Cache Line Boundary Allocation for Garbage Collected Systems.” 2007. Thesis, North Carolina State University. Accessed January 20, 2021. http://www.lib.ncsu.edu/resolver/1840.16/1597.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wagle, Prasad Ajit. “Cache Line Boundary Allocation for Garbage Collected Systems.” 2007. Web. 20 Jan 2021.

Vancouver:

Wagle PA. Cache Line Boundary Allocation for Garbage Collected Systems. [Internet] [Thesis]. North Carolina State University; 2007. [cited 2021 Jan 20]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1597.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wagle PA. Cache Line Boundary Allocation for Garbage Collected Systems. [Thesis]. North Carolina State University; 2007. Available from: http://www.lib.ncsu.edu/resolver/1840.16/1597

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Australian National University

17. Lin, Yi. An efficient implementation of a micro virtual machine .

Degree: 2018, Australian National University

URL: http://hdl.handle.net/1885/158122

► Implementing a managed language efficiently is hard, and it is becoming more difficult as the complexity of both language-level design and machines is increasing. To… (more)

▼ Implementing a managed language efficiently is hard, and it is becoming more difficult as the complexity of both language-level design and machines is increasing. To make things worse, current approaches to language implementations make them prone to inefficiency as well. A high-quality monolithic language implementation demands extensive expertise and resources, but most language implementers do not have those available so their implementations suffer from poor performance. Alternatively, implementers may build on existing frameworks. However, the back-end frameworks often offer abstractions that are mismatched to the language, which either bounces back the complexity to the implementers or results in inefficiency. Want et al. proposed micro virtual machines as a solution to address this issue. Micro VMs are explicitly minimal and efficient. Micro VMs support high-performance implementation of managed languages by providing key abstractions, i.e. code execution, garbage collection, and concurrency. The abstractions are neutral across client languages, and general and flexible to different implementation strategies. These constraints impose interesting challenges on a micro VM implementation. Prior to this work, no attempt had been made to efficiently implement a micro VM. My thesis is that key abstractions provided by a micro virtual machine can be implemented efficiently to support client languages. By exploring the efficient implementation of micro virtual machines, we present a concrete implementation, Zebu VM, which implements the Mu micro VM specification. The thesis addresses three critical designs in Zebu, each mapping to a key abstraction that micro virtual machines provide, and establishes their efficiency: 1) demonstrating the benefits of utilizing a modern language that focuses on safety to implement a high performance garbage collector, 2) analysing the design space of yieldpoint mechanism for thread synchronization, and 3) building a micro compiler under the specific constraints imposed by micro virtual machines, i.e. minimalism, efficiency and flexibility. This thesis is a proof of concept and an initial proof of performance to establish micro virtual machines as an efficient substrate for managed language implementation. It encourages the approach of building language implementations with micro virtual machines, and reinforces the hope that Mu will be a suitable back-end target. The thesis discusses the efficient implementation for micro virtual machines, but illustrates broader topics useful in general virtual machine design and construction.

Subjects/Keywords: programming language; virtual machine; runtime; compiler; micro vm; garbage collection; yieldpoint

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lin, Y. (2018). An efficient implementation of a micro virtual machine . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/158122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lin, Yi. “An efficient implementation of a micro virtual machine .” 2018. Thesis, Australian National University. Accessed January 20, 2021. http://hdl.handle.net/1885/158122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lin, Yi. “An efficient implementation of a micro virtual machine .” 2018. Web. 20 Jan 2021.

Vancouver:

Lin Y. An efficient implementation of a micro virtual machine . [Internet] [Thesis]. Australian National University; 2018. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1885/158122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lin Y. An efficient implementation of a micro virtual machine . [Thesis]. Australian National University; 2018. Available from: http://hdl.handle.net/1885/158122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Newcastle upon Tyne

18. Wiseman, Simon Robert. Garbage collection in distributed systems.

Degree: PhD, 1988, University of Newcastle upon Tyne

URL: http://theses.ncl.ac.uk/jspui/handle/10443/1980 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233325

► The provision of system-wide heap storage has a number of advantages. However, when the technique is applied to distributed systems automatically recovering inaccessible variables becomes… (more)

Subjects/Keywords: 005; Computer garbage collection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wiseman, S. R. (1988). Garbage collection in distributed systems. (Doctoral Dissertation). University of Newcastle upon Tyne. Retrieved from http://theses.ncl.ac.uk/jspui/handle/10443/1980 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233325

Chicago Manual of Style (16^th Edition):

Wiseman, Simon Robert. “Garbage collection in distributed systems.” 1988. Doctoral Dissertation, University of Newcastle upon Tyne. Accessed January 20, 2021. http://theses.ncl.ac.uk/jspui/handle/10443/1980 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233325.

MLA Handbook (7^th Edition):

Wiseman, Simon Robert. “Garbage collection in distributed systems.” 1988. Web. 20 Jan 2021.

Vancouver:

Wiseman SR. Garbage collection in distributed systems. [Internet] [Doctoral dissertation]. University of Newcastle upon Tyne; 1988. [cited 2021 Jan 20]. Available from: http://theses.ncl.ac.uk/jspui/handle/10443/1980 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233325.

Council of Science Editors:

Wiseman SR. Garbage collection in distributed systems. [Doctoral Dissertation]. University of Newcastle upon Tyne; 1988. Available from: http://theses.ncl.ac.uk/jspui/handle/10443/1980 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233325

George Mason University

19. Hoskins, Stephen. A Compiler-Based Approach to Implementing Smart Pointers .

Degree: 2007, George Mason University

URL: http://hdl.handle.net/1920/2925

► Because of the growing popularity of programming languages with garbage collectors, such as C# and Java, there is a clearly a desire for languages that… (more)

Subjects/Keywords: compilers; garbage; collection; reference; counting

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hoskins, S. (2007). A Compiler-Based Approach to Implementing Smart Pointers . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/2925

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Hoskins, Stephen. “A Compiler-Based Approach to Implementing Smart Pointers .” 2007. Thesis, George Mason University. Accessed January 20, 2021. http://hdl.handle.net/1920/2925.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Hoskins, Stephen. “A Compiler-Based Approach to Implementing Smart Pointers .” 2007. Web. 20 Jan 2021.

Vancouver:

Hoskins S. A Compiler-Based Approach to Implementing Smart Pointers . [Internet] [Thesis]. George Mason University; 2007. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1920/2925.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hoskins S. A Compiler-Based Approach to Implementing Smart Pointers . [Thesis]. George Mason University; 2007. Available from: http://hdl.handle.net/1920/2925

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Toronto

20. Yang, Yue. Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives.

Degree: PhD, 2017, University of Toronto

URL: http://hdl.handle.net/1807/80930

► Recent breakthroughs in NAND flash technology have made solid state drive (SSD) a viable storage device for data centers. While offering remarkable enhancement on density,… (more)

▼ Recent breakthroughs in NAND flash technology have made solid state drive (SSD) a viable storage device for data centers. While offering remarkable enhancement on density, reliability, speed against hard disk drives, every SSD can only sustain a limited number of writes, or its write budget. To prolong SSD lifespan, minimizing write amplification factor, a metric for the garbage collection (GC) algorithm overhead that unproductively consumes the write budget, becomes a central problem in the flash management software stack known as the flash translation layer (FTL). Unfortunately, prior works on the analytical modeling of write amplification tend to fall short of the promises of offering more design insights than simulations, either due to their complexity, or over-simplification of user write traffic. Towards the goal of finding more realistic models, this thesis discovers that practically enterprise workloads are not only skewed, but also following the Zipfâ s law. Leveraging this, we present, by rigorous probabilistic analysis, the first, highly accurate algebraic and closed-form solutions for predicting the write amplification factor for the greedy selection algorithm, known to approximate real world algorithms well, under skewed write traffic. The prediction errors against simulations are shown to be within 4%. Furthermore, we demonstrate, as a surprising corollary, that the write amplification under Zipfian write is analytically bounded. In parallel, we use the mean field analysis method and show that even under a multi-tier workload model, where uniform write is assumed within a tier, the system dynamics can be captured by a system of ordinary differential equations (ODEs), and hence the write amplification for the d-Choice scheme can be predicted, within 4% errors against simulation. We further propose a simpler system of algebraic equations for predicting steady-state write amplification under uniform traffic. We show that such a model retains predictive precision, while offering an average of 35% analysis running time reduction from ODE models. Advisors/Committee Members: Zhu, Jianwen, Electrical and Computer Engineering.

Subjects/Keywords: Analytical model; Garbage collection; Solid State Drive; Write amplification; 0464

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yang, Y. (2017). Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/80930

Chicago Manual of Style (16^th Edition):

Yang, Yue. “Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives.” 2017. Doctoral Dissertation, University of Toronto. Accessed January 20, 2021. http://hdl.handle.net/1807/80930.

MLA Handbook (7^th Edition):

Yang, Yue. “Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives.” 2017. Web. 20 Jan 2021.

Vancouver:

Yang Y. Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1807/80930.

Council of Science Editors:

Yang Y. Analytical Modeling of Write Amplification for Garbage Collection in Solid-State Drives. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/80930

21. Huang, Shuheng. Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry.

Degree: MS, Computer Science, 2015, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/88111

► Automatic garbage collection is an essential feature so that programs can reclaim resources without the need for manual input. This feature is present in many… (more)

Subjects/Keywords: garbage collection; actors

…of the global state at the time of garbage collection. This is necessary so that messages… …thesis. 2.2 Garbage Collection 2.2.1 Passive Object Garbage Collection Functional languages… …such as Lisp and Scheme have had automatic garbage collection for decades. Erlang is a… …object oriented languages also support garbage collection. Java, an object-oriented language… …explanation of garbage collection schemes in various languages are covered in the following chapter…

5 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Huang, S. (2015). Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Huang, Shuheng. “Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed January 20, 2021. http://hdl.handle.net/2142/88111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Huang, Shuheng. “Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry.” 2015. Web. 20 Jan 2021.

Vancouver:

Huang S. Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/2142/88111.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Huang S. Performance of a hierarchical distributed garbage collection algorithm in ActorFoundry. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88111

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Melbourne

22. Davis, Matthew. Automatic memory management techniques for the go programming language.

Degree: 2015, University of Melbourne

URL: http://hdl.handle.net/11343/58707

► Memory management is a complicated task. Many programming languages expose such complexities directly to the programmer. For instance, languages such as C or C++ require… (more)

Subjects/Keywords: region-based memory manegement; garbage collection; compilation; go

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Davis, M. (2015). Automatic memory management techniques for the go programming language. (Doctoral Dissertation). University of Melbourne. Retrieved from http://hdl.handle.net/11343/58707

Chicago Manual of Style (16^th Edition):

Davis, Matthew. “Automatic memory management techniques for the go programming language.” 2015. Doctoral Dissertation, University of Melbourne. Accessed January 20, 2021. http://hdl.handle.net/11343/58707.

MLA Handbook (7^th Edition):

Davis, Matthew. “Automatic memory management techniques for the go programming language.” 2015. Web. 20 Jan 2021.

Vancouver:

Davis M. Automatic memory management techniques for the go programming language. [Internet] [Doctoral dissertation]. University of Melbourne; 2015. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/11343/58707.

Council of Science Editors:

Davis M. Automatic memory management techniques for the go programming language. [Doctoral Dissertation]. University of Melbourne; 2015. Available from: http://hdl.handle.net/11343/58707

Louisiana State University

23. Krishnan, Hari. Garbage Collection for General Graphs.

Degree: PhD, Computer Sciences, 2016, Louisiana State University

URL: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

► Garbage collection is moving from being a utility to a requirement of every modern programming language. With multi-core and distributed systems, most programs written recently… (more)

Subjects/Keywords: reachability; graph; distributed algorithm; garbage collection; shared memory; concurrency

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Krishnan, H. (2016). Garbage Collection for General Graphs. (Doctoral Dissertation). Louisiana State University. Retrieved from etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

Chicago Manual of Style (16^th Edition):

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Doctoral Dissertation, Louisiana State University. Accessed January 20, 2021. etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

MLA Handbook (7^th Edition):

Krishnan, Hari. “Garbage Collection for General Graphs.” 2016. Web. 20 Jan 2021.

Vancouver:

Krishnan H. Garbage Collection for General Graphs. [Internet] [Doctoral dissertation]. Louisiana State University; 2016. [cited 2021 Jan 20]. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573.

Council of Science Editors:

Krishnan H. Garbage Collection for General Graphs. [Doctoral Dissertation]. Louisiana State University; 2016. Available from: etd-06232016-154210 ; https://digitalcommons.lsu.edu/gradschool_dissertations/573

Purdue University

24. Hussein, Ahmed Mohamed Abd-elhaffiez. Effective memory management for mobile environments.

Degree: PhD, Computer Science, 2016, Purdue University

URL: https://docs.lib.purdue.edu/open_access_dissertations/941

► Smartphones, tablets, and other mobile devices exhibit vastly different constraints compared to regular or classic computing environments like desktops, laptops, or servers. Mobile devices… (more)

▼ Smartphones, tablets, and other mobile devices exhibit vastly different constraints compared to regular or classic computing environments like desktops, laptops, or servers. Mobile devices run dozens of so-called “apps” hosted by independent virtual machines (VM). All these VMs run concurrently and each VM deploys purely local heuristics to organize resources like memory, performance, and power. Such a design causes conflicts across all layers of the software stack, calling for the evaluation of VMs and the optimization techniques specific for mobile frameworks. In this dissertation, we study the design of managed runtime systems for mobile platforms. More specifically, we deepen the understanding of interactions between garbage collection (GC) and system layers. We develop tools to monitor the memory behavior of Android-based apps and to characterize GC performance, leading to the development of new techniques for memory management that address energy constraints, time performance, and responsiveness. We implement a GC-aware frequency scaling governor for Android devices. We also explore the tradeoffs of power and performance in vivo for a range of realistic GC variants, with established benchmarks and real applications running on Android virtual machines. We control for variation due to dynamic voltage and frequency scaling (DVFS), Just-in-time (JIT) compilation, and across established dimensions of heap memory size and concurrency. Finally, we provision GC as a global service that collects statistics from all running VMs and then makes an informed decision that optimizes across all them (and not just locally), and across all layers of the stack. Our evaluation illustrates the power of such a central coordination service and garbage collection mechanism in improving memory utilization, throughput, and adaptability to user activities. In fact, our techniques aim at a sweet spot, where total on-chip energy is reduced (20–30%) with minimal impact on throughput and responsiveness (5–10%). The simplicity and efficacy of our approach reaches well beyond the usual optimization techniques. Advisors/Committee Members: Antony L. Hosking, Mathias Payer, Antony L. Hosking, Suresh Jagannathan, Xiangyu Zhang.

Subjects/Keywords: Applied sciences; Android; Garbage collection; Mobile; Power; Virtual machine; Computer Sciences

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hussein, A. M. A. (2016). Effective memory management for mobile environments. (Doctoral Dissertation). Purdue University. Retrieved from https://docs.lib.purdue.edu/open_access_dissertations/941

Chicago Manual of Style (16^th Edition):

Hussein, Ahmed Mohamed Abd-elhaffiez. “Effective memory management for mobile environments.” 2016. Doctoral Dissertation, Purdue University. Accessed January 20, 2021. https://docs.lib.purdue.edu/open_access_dissertations/941.

MLA Handbook (7^th Edition):

Hussein, Ahmed Mohamed Abd-elhaffiez. “Effective memory management for mobile environments.” 2016. Web. 20 Jan 2021.

Vancouver:

Hussein AMA. Effective memory management for mobile environments. [Internet] [Doctoral dissertation]. Purdue University; 2016. [cited 2021 Jan 20]. Available from: https://docs.lib.purdue.edu/open_access_dissertations/941.

Council of Science Editors:

Hussein AMA. Effective memory management for mobile environments. [Doctoral Dissertation]. Purdue University; 2016. Available from: https://docs.lib.purdue.edu/open_access_dissertations/941

Universidade Estadual de Campinas

25. Buda, José Francisco, 1959-. Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo.

Degree: 2014, Universidade Estadual de Campinas

URL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/258390

► Abstract: The National Waste Policy (PNRS), established by Law No. 12305 of August 2, 2010 and regulated by Decree No. 7,404 of December 23, 2010,… (more)

▼ Abstract: The National Waste Policy (PNRS), established by Law No. 12305 of August 2, 2010 and regulated by Decree No. 7,404 of December 23, 2010, shows the importance of the tripod between Government, the Companies and Society in waste management solid, encouraging the participation of waste pickers cooperatives in the receiving process / collection, sorting, baling and marketing of materials, but also can highlight the importance they play in the social inclusion and income generation. This research aimed to evaluate effects caused by PNRS under the conditions and in the work environment of cooperatives, changes in relationships with business and society about the size and quality of the waste received, and municipal agencies. The cooperatives were surveyed with the city of São Paulo City Hall, where they answered a form that lifted the variables: environmental, sanitary, economic, institutional, infrastructure, health and safety at work. We interviewed the presidents of cooperatives, as these are the oldest cooperative and some even participate in drafting the law. It was this possible to portray the conditions of cooperatives and concluded as soon as the PNRS is configured as shaping of new social paradigms, among which stand out the principle of shared social responsibility, required behavioral changes by the legal document should not be obtained quickly, but gradually in successive advances. The acceleration of this process will only be given to increasing the supervision and government support to the issue of recycling, which will ensure the effectiveness of the law Advisors/Committee Members: UNIVERSIDADE ESTADUAL DE CAMPINAS (CRUESP), Coraucci Filho, Bruno, 1948- (advisor), Filho, Bruno Coraucci (advisor), Universidade Estadual de Campinas. Faculdade de Engenharia Civil, Arquitetura e Urbanismo (institution), Programa de Pós-Graduação em Engenharia Civil (nameofprogram), Tonetti, Adriano Luiz (committee member), Isaac, Ricardo de Lima (committee member), Licco, Eduardo Antonio (committee member), Ingunza, Maria Del Pilar Durante (committee member).

Subjects/Keywords: Catadores de lixo - Aspectos sociais; Coleta seletiva de lixo; Cooperativas; Políticas públicas; Garbage collectors - Social aspects; Garbage collection; Cooperatives; Public policies

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Buda, José Francisco, 1. (2014). Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/258390

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Buda, José Francisco, 1959-. “Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo.” 2014. Thesis, Universidade Estadual de Campinas. Accessed January 20, 2021. http://repositorio.unicamp.br/jspui/handle/REPOSIP/258390.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Buda, José Francisco, 1959-. “Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo.” 2014. Web. 20 Jan 2021.

Vancouver:

Buda, José Francisco 1. Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo. [Internet] [Thesis]. Universidade Estadual de Campinas; 2014. [cited 2021 Jan 20]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/258390.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Buda, José Francisco 1. Poíitica nacional de resíduos sólidos : efeito nas condições e ambiente de trabalho das cooperativas de catadores conveniadas com a Prefeitura do Município de São Paulo: Poíitica national solid waste : effect on working conditions and environment of the accredited recycling cooperatives with the Municipal Government of São Paulo. [Thesis]. Universidade Estadual de Campinas; 2014. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/258390

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. 八十島, 利典. リアルタイム環境に適したGarbage Collection APIの研究.

Degree: Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学

URL: http://hdl.handle.net/10119/1361

Supervisor:権藤克彦

情報科学研究科

修士

Subjects/Keywords: ガベージコレクション,リアルタイム,java,API,Kaffe OpenVM; garbage collection,real time,java,API,Kaffe OpenVM

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

八十島, �. (n.d.). リアルタイム環境に適したGarbage Collection APIの研究. (Thesis). Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10119/1361

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

八十島, 利典. “リアルタイム環境に適したGarbage Collection APIの研究.” Thesis, Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学. Accessed January 20, 2021. http://hdl.handle.net/10119/1361.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

八十島, 利典. “リアルタイム環境に適したGarbage Collection APIの研究.” Web. 20 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

八十島 �. リアルタイム環境に適したGarbage Collection APIの研究. [Internet] [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10119/1361.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

八十島 �. リアルタイム環境に適したGarbage Collection APIの研究. [Thesis]. Japan Advanced Institute of Science and Technology / 北陸先端科学技術大学院大学; Available from: http://hdl.handle.net/10119/1361

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Luleå University of Technology

27. Kero, Martin. Garbage collection in the reactive deadline-driven environment of Timber.

Degree: 2005, Luleå University of Technology

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-55345

►

Software development for small, real-time and resource constrained, embedded systems is becoming increasingly complex. Multi-threading and object- orientation are examples of complicating factors. Even… (more)

Subjects/Keywords: Technology; Memory Management; Garbage Collection; Reactive Systems; Real-Time; Embedded Systems; Programming; Timber; Teknik

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kero, M. (2005). Garbage collection in the reactive deadline-driven environment of Timber. (Thesis). Luleå University of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-55345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kero, Martin. “Garbage collection in the reactive deadline-driven environment of Timber.” 2005. Thesis, Luleå University of Technology. Accessed January 20, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-55345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kero, Martin. “Garbage collection in the reactive deadline-driven environment of Timber.” 2005. Web. 20 Jan 2021.

Vancouver:

Kero M. Garbage collection in the reactive deadline-driven environment of Timber. [Internet] [Thesis]. Luleå University of Technology; 2005. [cited 2021 Jan 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-55345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kero M. Garbage collection in the reactive deadline-driven environment of Timber. [Thesis]. Luleå University of Technology; 2005. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-55345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

North Carolina State University

28. Reddy, Vimal Kodandarama. Caching Strategies to Improve Generational Garbage Collection in Smalltalk.

Degree: MS, Computer Engineering, 2003, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/940

► Cache performance of programs is becoming increasingly important as processor speeds grow faster relative to main memory. Cache misses have become a major consideration for… (more)

▼ Cache performance of programs is becoming increasingly important as processor speeds grow faster relative to main memory. Cache misses have become a major consideration for performance of garbage collected systems. This thesis explores a caching strategy for generational garbage collectors, the most prevalent form in use, which takes advantage of large caches available to modern-day processors. A portion of the cache is chosen to reserve the youngest generation and the page-fault manager is provided certain mapping rules that remove all conflicts to the youngest generation. The strategy can be completely realized in software which makes it an attractive solution to increase garbage collection performance. This "biased" cache mapping is shown to reduce cache misses and increase overall performance in the IBM VisualAge Smalltalk system, a high quality Smalltalk implementation that employs a generational copying garbage collector. Favoring youngest generation in the mapping strategy is advantageous for the following reasons: 1. Languages like Smalltalk, where "everything" is an object, tend to allocate furiously. This is because they encourage a programming style where objects are created, used and shortly thereafter destroyed. This large number of allocations translate to initialization write misses if the allocated region is not cached. In generational heaps, all memory is allocated in the region containing youngest-generation objects. 2. A generational garbage collector focuses collection on the youngest generation, scavenging it to reclaim most garbage. It relies on empirical knowledge that most young objects die soon. This means the scavenger runs many times during a program lifetime, scanning the youngest generation for garbage. This process can lead to a large number of read and write cache misses if the youngest generation is not in cache. 3. Youngest generation objects form a major part of a program's working set. Making them available in the cache would also improve the mutator (i.e, user program) performance, making it immune to interference from the garbage collector. 4. Given that most young objects become garbage quickly, when a garbaged object is evicted from a writeback cache, an unneccessary writeback results. Caching the youngest generation would reduce traffic to memory. We do a simulation-based study of our mapping strategies on IBM VisualAge Smalltalk, a generational copying garbage collected system. Our results show a 45% average drop in cache miss rates at the L2 level for direct-mapped caches and 15% average drop for 2-way set-associative caches. Advisors/Committee Members: Gregory T. Byrd, Committee Member (advisor), Edward F. Gehringer, Committee Chair (advisor), Warren J. Jasper, Committee Member (advisor), Eric Rotenberg, Committee Member (advisor).

Subjects/Keywords: Automatic memory management; Garbage collection; cache performance; generational garbage collection; memory profiler; Smalltalk

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Reddy, V. K. (2003). Caching Strategies to Improve Generational Garbage Collection in Smalltalk. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/940

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Reddy, Vimal Kodandarama. “Caching Strategies to Improve Generational Garbage Collection in Smalltalk.” 2003. Thesis, North Carolina State University. Accessed January 20, 2021. http://www.lib.ncsu.edu/resolver/1840.16/940.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Reddy, Vimal Kodandarama. “Caching Strategies to Improve Generational Garbage Collection in Smalltalk.” 2003. Web. 20 Jan 2021.

Vancouver:

Reddy VK. Caching Strategies to Improve Generational Garbage Collection in Smalltalk. [Internet] [Thesis]. North Carolina State University; 2003. [cited 2021 Jan 20]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/940.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Reddy VK. Caching Strategies to Improve Generational Garbage Collection in Smalltalk. [Thesis]. North Carolina State University; 2003. Available from: http://www.lib.ncsu.edu/resolver/1840.16/940

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade do Rio Grande do Sul

29. Souza, Rosangela Silva de. Saneamento básico no Estado de Roraima : situação atual e perspectivas.

Degree: 2009, Universidade do Rio Grande do Sul

URL: http://hdl.handle.net/10183/18880

►

O objetivo desta dissertação foi mostrar o cenário atual e as perspectivas para o setor de saneamento básico do Estado de Roraima. Destacou-se o perfil… (more)

▼

O objetivo desta dissertação foi mostrar o cenário atual e as perspectivas para o setor de saneamento básico do Estado de Roraima. Destacou-se o perfil dos serviços de abastecimento de água, coleta de esgotos e coleta de lixo. Foram utilizadas diversas publicações, especialmente as do Instituto Brasileiro de Geografia e Estatística/IBGE, com destaque para a Pesquisa Nacional por Amostra de Domicílios/PNAD e o Censo Demográfico 2000, que forneceram dados da população urbana do Estado atendida e não atendida pelos serviços de saneamento básico. Dessa forma, foi realizada a comparação dos resultados obtidos para o Estado com algumas cidades brasileiras, regiões do país, além de outros países. Sob esse aspecto, os resultados apurados apontaram que 96,9% dos domicílios urbanos do Estado, são atendidos pelos serviços de abastecimento de água, superando a realidade nacional. Quanto à coleta de esgotos, os resultados são preocupantes, uma vez que apenas 17,3% dos domicílios urbanos do Estado são atendidos por este serviço. Já a coleta de lixo 97,1% dos domicílios urbanos do Estado possui acesso a esse serviço. Constatou-se, ainda, que a maior parte do lixo coletado no Estado de Roraima é depositada a céu aberto, sem nenhum tratamento quanto às questões ambientais. Concluiu-se que a população urbana do Estado de Roraima apresenta ótimos resultados quanto ao acesso aos serviços de abastecimento de água e coleta de lixo. Contudo, a mesma situação não é observada quanto ao acesso aos serviços de coleta de esgotos, onde uma pequena parcela da população urbana é atendida. Nesse sentido, já existem recursos disponíveis para a universalização dos serviços de abastecimento de água e ampliação do sistema de esgoto sanitário. Entretanto, os recursos destinados a ampliação do sistema de esgotos ainda não é suficiente para atender a toda a população.

The objective of this thesis was to show the current scenario and prospects for the basic sanitation sector in the State of Roraima, showing the profile of the following services: water supply, waste sewage disposal and garbage collection. To obtain the data, various publications were used , especially the Brazilian Institute of Geography and Statistics (IBGE), highlighting the National Survey of Home Sampling (PNAD) and the year 2000 Census which provided data on the urban population of the state with and without sanitation services. Thus, the results for the state were compared with other Brazilian cities, regions of the country and other countries. The findings indicate that 96.9% of urban households in the state are served by the water supply, surpassing the national reality, while the sewage disposal results are worrisome as only 17.3% of urban households in the state are served. As for garbage collection, 97.1% of urban households of the state have access to this service. It was further observed that most of the garbage collected in the state of Roraima is deposited in the open, without any form of treatment for environmental concerns. It was concluded that the urban population of…

Advisors/Committee Members: Souza, Nali de Jesus de.

Subjects/Keywords: Saneamento básico; Drainage; Abastecimento de água; Water supply; Roraima; Waste sewage; Garbage collection

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Souza, R. S. d. (2009). Saneamento básico no Estado de Roraima : situação atual e perspectivas. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/18880

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Souza, Rosangela Silva de. “Saneamento básico no Estado de Roraima : situação atual e perspectivas.” 2009. Thesis, Universidade do Rio Grande do Sul. Accessed January 20, 2021. http://hdl.handle.net/10183/18880.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Souza, Rosangela Silva de. “Saneamento básico no Estado de Roraima : situação atual e perspectivas.” 2009. Web. 20 Jan 2021.

Vancouver:

Souza RSd. Saneamento básico no Estado de Roraima : situação atual e perspectivas. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2009. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10183/18880.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Souza RSd. Saneamento básico no Estado de Roraima : situação atual e perspectivas. [Thesis]. Universidade do Rio Grande do Sul; 2009. Available from: http://hdl.handle.net/10183/18880

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

30. Zakowski, Yannick. Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent.

Degree: Docteur es, Informatique, 2017, Rennes, École normale supérieure

URL: http://www.theses.fr/2017ENSR0010

►

Les compilateurs modernes constituent des programmes complexes, réalisant de nombreuses optimisations afin d'améliorer la performance du code généré. Du fait de cette complexité, des bugs… (more)

▼

Les compilateurs modernes constituent des programmes complexes, réalisant de nombreuses optimisations afin d'améliorer la performance du code généré. Du fait de cette complexité, des bugs y sont régulièrement détecté, conduisant à l'introduction de nouveau comportement dans le programme compilé. En réaction, il est aujourd'hui possible de prouver correct, dans des assistants de preuve tels que Coq, des compilateurs optimisants pour des langages tels que le C ou ML. Transporter un tel résultat pour des langages haut-niveau tels que Java est néanmoins encore hors de portée de l'état de l'art. Ceux-ci possèdent en effet deux caractéristiques essentielles: la concurrence et un environnement d'exécution particulièrement complexe.Nous proposons dans cette thèse de réduire la distance vers la conception d'un tel compilateur vérifié en nous concentrant plus spécifiquement sur la preuve de correction d'un glaneur de cellules concurrent performant. Ce composant de l'environnement d'exécution prend soin de collecter de manière automatique la mémoire, en lieu et place du programmeur. Afin de ne pas générer un ralentissement trop élevé à l'exécution, le glaneur de cellules doit être extrêmement performant. Plus spécifiquement, l'algorithme considéré est dit «au vol»: grâce à l'usage de concurrence très fine, il ne cause jamais d'attente active au sein d'un fil utilisateur. La preuve de correction établit par conséquent que malgré l'intrication complexe des fils utilisateurs et du collecteur, ce dernier ne collecte jamais une cellule encore accessible par les premiers. Nous présentons dans un premier temps l'algorithme considéré et sa formalisation en Coq dans une représentation intermédiaire conçue pour l'occasion. Nous introduisons le système de preuve que nous avons employé, une variante issue de la logique «Rely-Guarantee», et prouvons l'algorithme correct. Raisonner simultanément sur l'algorithme de collection et sur l'implantation des structures de données concurrentes manipulées générerait une complexité additionnelle indésirable. Nous considérons donc durant la preuve des opérations abstraites: elles ont lieu instantanément. Pour légitimer cette simplification, nous introduisons une méthode inspirée par les travaux de Vafeiadis et permettant la preuve de raffinement de structures de données concurrentes dites «linéarisables». Nous formalisons l'approche en Coq et la dotons de solides fondations sémantiques. Cette méthode est finalement instanciée sur la principale structure de données utilisée par le glaneur de cellules.

Modern compilers are complex programs, performing several heuristic-based optimisations. As such, and despite extensive testing, they may contain bugs leading to the introduction of new behaviours in the compiled program.To address this issue, we are nowadays able to prove correct, in proof assistants such as Coq, optimising compilers for languages such as C or ML. To date, a similar result for high-level languages such as Java nonetheless remain out of reach. Such languages indeed possess two essential…

Advisors/Committee Members: Cachera, David (thesis director), Pichardie, David (thesis director).

Subjects/Keywords: Concurrence; Coq; Glaneur de cellule; Rely-Guarantee; Concurrency; Coq; Garbage collection; Rely-Guarantee

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zakowski, Y. (2017). Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent. (Doctoral Dissertation). Rennes, École normale supérieure. Retrieved from http://www.theses.fr/2017ENSR0010

Chicago Manual of Style (16^th Edition):

Zakowski, Yannick. “Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent.” 2017. Doctoral Dissertation, Rennes, École normale supérieure. Accessed January 20, 2021. http://www.theses.fr/2017ENSR0010.

MLA Handbook (7^th Edition):

Zakowski, Yannick. “Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent.” 2017. Web. 20 Jan 2021.

Vancouver:

Zakowski Y. Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent. [Internet] [Doctoral dissertation]. Rennes, École normale supérieure; 2017. [cited 2021 Jan 20]. Available from: http://www.theses.fr/2017ENSR0010.

Council of Science Editors:

Zakowski Y. Verification of a Concurrent Garbage Collector : Vérification d'un glaneur de cellules concurrent. [Doctoral Dissertation]. Rennes, École normale supérieure; 2017. Available from: http://www.theses.fr/2017ENSR0010

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations