Dissertation > Excellent graduate degree dissertation topics show
For multi- processor parallel garbage collection mechanism
Author: HeMingZheng
Tutor: JiZhenZhou
School: Harbin Institute of Technology
Course: Computer Science and Technology
Keywords: Multiprocessor Garbage Collection Heap to grow Space-time compensation Parallel
CLC: TP311.10
Type: Master's thesis
Year: 2011
Downloads: 43
Quote: 0
Read: Download Dissertation
Abstract
|
Today, advances in hardware technology can already provide applications with several G bytes of heap space and universal multi-core parallel execution environment. Wide range of modern servers running multi -threaded applications often have several G bytes of heap space, which the JVM and CLR virtual execution environments such as garbage collection technology presents new challenges. These service-oriented application requirements with minimal cost to get the throughput quantity G byte heap garbage collection on a short pause. This paper introduces the Java garbage collector basic research , analyzes the impact of garbage collection efficiency of the main factors , summarized comparison of the current multi-processor environment garbage collection scheduling program, given a modern multi-threaded applications on a server garbage collection goals, including time convergence , the convergence space , scalability and load balancing properties. In this paper, conjecture and experiments confirmed that a combination of methods , gives the application heap space and the relationship between the amount of garbage collection operations . Other factors equal conditions, the application heap space greater need for garbage collection work the lower left to the application processor executes the more time . This article is for multi- processor environment is multi-threaded applications , drawing bandwidth reservation scheduling algorithm designed living within our means scheduling model and its consumption and supplementary rules . Multiprocessor oriented computing , according to different application requirements , can be time -critical , it can be stored in the key . Garbage collection efficiency , in essence, is the storage space and garbage collection time, a temporal relationship . Based on the above understanding , we propose a heap-based compensation increased temporal scheduling , considering the practical application of the system workload , storage resources and scheduling algorithm the relationship between the three elements . Finally , this paper presents a parallel garbage collection time complexity of the amount of work the upper bound . Benchmark data show that the actual assembly , the schedule effective use of multi-processor parallel processing capabilities and idle processing time greatly shortens the time jitter of the application . In addition, the scheduling scheme also has good scalability.
|
Related Dissertations
- Research on Parallel Frequent Graph Pattern Mining,TP311.13
- Task Partition of Network Simulation under Large-Scale Computing,TP393.01
- Analysis and Control of 6-DOF Electrical Driven Parallel Manipulator,TP242.2
- Designs and Applications of Fuzzy Synthetic Evaluation Models Based on Parallel Algorithms,TP18
- Study on Small Bank-based Constructed Wetland for Remediation of Polluted Water in City Stream,X703
- Research on the Online Parallel Connection Examination and Approbation System,D630
- Visual Feedback and Memory Behavior Based GPU Parallel Ant Colony Algorithm,TP301.6
- The Airborne LiDAR and LiDAR Points-cloud’s Quick Processing Method,TN959.73
- Research on Noise Tolerance of Morphological Associative Memory Networks,TN911.4
- Research on Algorithm of Parallel Copying Garbage Collection Based on Lisp 2 for Multicore System,TP332
- Research on Image Digital Watermarking Technology Based on CUDA,TP309.7
- The Designing of HD Vehicle Detection System Based on Fpga,TP391.41
- The Kinematics and Dynamics on the Cross-rod Parallel Machine Tools,TH113
- A Corpus-Based Study on English Personal Pronouns in Political Speeches and Statements,H314
- The Research on Feature Selection for Data Stream,TP311.13
- Study on the Performance of Mixing in the Jep Loop Reactor,TQ052
- A Thesis on Rights Restriction of Trademark,D923.43
- Research of the Important Technology of Flash File System Based on Large Capacity NAND Flash Memory,TP333
- Parasitic Motion Analysis and Architecture Design of (PP)S Parallel Mechanisms,TP242
- Optimization of Wireless Sensor Networks Base on Genetic Algorithms,TN929.5
- Spatio-Temporal Data Prefetching,TP333
CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer software > Program design,software engineering > Programming
© 2012 www.DissertationTopic.Net Mobile
|