某干嵌入式Java虚拟机的垃圾回收算法

阐述了一种适用于嵌入式Java虚拟机的垃圾回收算法。该算法对分代回收算法中代的划分方式，引用跟踪等方面进行改进，以降低对运行时间和内存空间的需求，从而使其适用于资源有限的嵌入式环境。试验结果表明，该算法有效提高了垃圾回收效率。     

基于嵌入式Java虚拟机的垃圾回收算法

阐述了一种适用于嵌入式Java虚拟机的垃圾回收算法。该算法对分代回收算法中代的划分方式,引用跟踪等方面进行改进,以降低对运行时间和内存空间的需求,从而使其适用于资源有限的嵌入式环境。试验结果表明,该算法有效提高了垃圾回收效率。     

JVM垃圾回收机制

Java语言的垃圾自动回收机制为广大开发人员带来了便利,那么了解JVM的垃圾回收机制也是必不可少的,只有这样,才能更好地提升自己,在遇到问题时更高效的解决问题.本文介绍了主要的垃圾回收算法以及常用的垃圾收集器.     

分代算法在KVM中的实现

在嵌入式系统中,需要分析什么样的垃圾回收机制能够适应嵌入式系统的特点,满足系统对于稳定性和性能的要求,分析了嵌入式Java虚拟机KVM垃圾回收机制的特点,所采用的垃圾收集算法,以及垃圾收集器在KVM中是如何工作的,找出存在的缺陷和不足,并在mark-sweep-compact算法的基础上实现了分代算法。     

Java垃圾回收机制研究

Java垃圾回收机制是Java最重要的几个功能之一,这个机制可以确保Java能有效、安全的对内存进行管理,同时也降低了编程难度,提高了编程效率。     

Java垃圾回收新算法刍探

由Java语言与C/C++对象在内存管理方式的不同,引出了Java语言的优势技术--垃圾处理技术.通过对GC工作原理的阐述及对一些传统的垃圾收集器的分析,提出了一种新的垃圾处理算法,一定程度上改善和提高了Java垃圾处理的性能.     

Linux平台上的WAS垃圾回收策略分析

IBM Websphere Application Server V6．1的Java虚拟机在Linux平台上使用Optthruput、Optavgpause、Gencon、Subpool四种GC策略来管理内存。它们采用不同的算法,适用于不同的应用程序,错误地选择GC策略将导致性能瓶颈。文针对四种策略的特点展开讨论,并结合JVM堆参数调优实验,探讨了默认策略下的性能优化方法,实践证明这种方法对于提高应用服务器性能是行之有效的。     

Linux平台上的WAS垃圾回收策略分析

IBM Websphere Application Server V6.1的Java虚拟机在Linux平台上使用Optthruput、Optavgpause、Gencon、Subpool四种GC策略来管理内存。它们采用不同的算法,适用于不同的应用程序,错误地选择GC策略将导致性能瓶颈。文针对四种策略的特点展开讨论,并结合JVM堆参数调优实验,探讨了默认策略下的性能优化方法,实践证明这种方法对于提高应用服务器性能是行之有效的。     

电子垃圾回收期待产业化

场景一:日本田中贵金属工业的厂房内,整齐地摆放着一排排铁桶和回收袋,里面装满了回收的电子元件。这就是田中贵金属工业最大的秘密——它的原料仓库里找不到一块矿石,这些回收的电子元件就是全部的原料。穿着制服的工人们在一条条流水线上忙碌,谁也不说话,整洁的车间里既安静、又紧张。     

基于嵌入式Java虚拟机的垃圾收集优化算法

对分代垃圾收集算法进行分析和改进,提出一种适用于嵌入式Java虚拟机的垃圾收集优化算法。采取动态的分代方式,将旧生代的回收工作细分,从而充分利用堆空间,缩短分代回收中全收集导致的停顿时间。实验结果表明,该算法能保持较高的垃圾收集效率,系统平均停顿时间较少。     

Nonintrusive Cloning Garbage Collection with Stock Operating System Support

It is well accepted that automatic garbage collection simplifies programming, promotes modularity, and reduces development effort. However it is commonly believed that these advantages do not counteract the perceived price: excessive overheads, possible long pause times while garbage collections occur, and the need to modify existing code. Even though there are publically available garbage collector implementations that can be used in existing programs, they do not guarantee short pauses, and some modification of the application using them is still required. In this paper we describe a snapshot-at-beginning concurrent garbage collector algorithm and its implementation. This algorithm guarantees short pauses, and can be easily implemented on stock UNIX-like operating systems. Our results show that our collector performs comparable to other garbage collection implementations on uniprocessor machines and outperforms similar collectors on multiprocessor machines. We also show our collector to be competitive in performance with explicit deallocation. Our collector has the added advantage of being non-intrusive. Using a dynamic linking technique and effective root set inferencing, we have been able to successfully run our collector even in commercial programs where only the binary executable and no source code is available. In this paper we describe our algorithm, its implementation, and provide both an algorithmic and a performance comparison between our collector and other similar garbage collectors. ©1997 by John Wiley & Sons, Ltd.     

Research Demonstration of a Hardware Reference-Counting Heap

A hardware self-managing heap memory (RCM) for languages like Lisp, Smalltalk, and Java has been designed, built, tested and benchmarked. On every pointer write from the processor, reference-counting transactions are performed in real time within this memory, and garbage cells are reused without processor cycles. A processor allocates new nodes simply by reading from a distinguished location in its address space. The memory hardware also incorporates support for off-line, multiprocessing, mark-sweep garbage collection.Performance statistics are presented from a partial implementation of Scheme over five different memory models and two garbage collection strategies, from main memory (no access to RCM) to a fully operational RCM installed on an external bus. The performance of the RCM memory is more than competitive with main memory.     

基于实时性的Java虚拟机垃圾收集算法*

提出了一种适用于实时性环境的Java虚拟机垃圾收集算法。该算法对增量式收集器中堆空间的划分方式、引用跟踪等方面进行了改进,以减少垃圾收集带来的不确定性暂停,并可以使用户指定一个时间段内垃圾收集导致应用程序暂停的最长时间,从而使其适用于实时性环境。实验结果表明,该算法有效减少了暂停的频率和时长。     

A performance perspective on the Active Memory System

One major problem of using Java in real-time and embedded devices is the non-deterministic turnaround time of dynamic memory management systems (memory allocation and garbage collection). For the allocation, the non-determinism is often contributed by the time to perform searching, splitting, and coalescing. For the garbage collection, the turnaround time is usually determined by the size of the heap, the number of live objects, the number of object collected, and the amount of garbage collected. Even with the current state-of-the-art garbage collectors (generational and incremental schemes), they may or may not guarantee the worst-case latency. Moreover, such schemes often prolong overall garbage collection time.

In this paper, the performance analysis of the proposed Active Memory Module (AMM) for embedded systems is presented. Unlike the software counterparts, the AMM can perform a memory allocation in a predictable and bounded fashion (14 cycles). Moreover, it can also yield a bounded sweeping time regardless of the number of live objects or heap size. By utilizing the proposed system, the overall speedup can be as high as 23% compared to the garbage collection system of the JDK 1.2.2 running in classic mode.     

清剿Java程序中的内存泄漏

Java语言的一个显著特点是它通过虚拟机和垃圾回收机制管理着大部分的内存事务,但是在Java程序中还是可能存在内存泄漏问题。文中首先对Java内存泄漏做一个简要的定义,接着围绕一个实例详细地介绍如何用工具检测Java内存泄漏,最后列举了一些典型的泄漏,以便读者在Java程序开发中尽量避免类似的内存泄漏。     

基于关键引用验证的分布式实时垃圾搜集器*

提出了一种新的分布式垃圾搜集器（GC）机制,即基于关键引用验证的分布式GC。性能分析说明,与以往的分布式GC相比,该算法能以最短的时间延迟回收循环垃圾。尽管该算法为保留引用列表和验证过程需要额外的一些存储空间,但具有一定的实时性和较好的容错性,综合性能较好,适用于大规模分布式系统。     

C#程序设计中的内存管理

C#是一种新的面向对象的程序设计语言,进一步研究C#程序设计的内存分配,就必须涉及．NET Framwork的概念,因为C#是专门为．NET Framework而设计的程序设计语言。本文主要叙述了C#和．NET程序设计中内存管理的特点和对程序设计性能的影响,并且就C#和传统的程序设计语言作了比较。