Structure of Heap

首先这有一个说的挺清晰的帖子：

http://stackoverflow.com/questions/2129044/java-heap-terminology-young-old-and-permanent-generations

For the HotSpot Java VM, the memory pools for serial garbage collection are the following.

Eden Space (heap): The pool from which memory is initially allocated for most objects.

Survivor Space (heap): The pool containing objects that have survived the garbage collection of the Eden space.

Tenured Generation (heap): The pool containing objects that have existed for some time in the survivor space.

Permanent Generation (non-heap): The pool containing all the reflective data of the virtual machine itself, such as class and method objects. With Java VMs that use class data sharing, this generation is divided into read-only and read-write areas.

Code Cache (non-heap): The HotSpot Java VM also includes a code cache, containing memory that is used for compilation and storage of native code.

说明：

native code指在虚拟机中保存的一部分最常被执行的机器码，这样当同样的字节码被调用时，就直接使用缓存的机器码，从而省去了将字节码翻译成本地机器码的过程，提高了效率。

在上文中提到的generation，其实是和java中的garbage collection紧密相关的。逻辑上generation分别为：

young generation, old generation(or tenured generation) and permanent generation.

Structure of Heap相关推荐

DS实验题融合软泥怪-2 Heap实现
题目和STL实现:DS实验题融合软泥怪-1 用堆实现优先队列引言和堆的介绍摘自:Priority Queue(Heaps)--优先队列(堆) 引言: 优先队列是一个至少能够提供插入(Insert) ...
Linux cgroup机制分析之cpuset subsystem
------------------------------------------ 本文系本站原创,欢迎转载! 转载请注明出处:http://ericxiao.cublog.cn/ -------- ...
Native Application 开发详解
文章目录: 1. 引子: 2. Native Application Demo 展示: 3. Native Application 简介: 4. Native Application 有何妙用: 5. ...
java堆数据结构堆_快速堆数据结构
java堆数据结构堆 In this tutorial, we'll be discussing and implementing Heap data structures in Swift. 在 ...
Flow Free solver[连线游戏求解器]
Fast automated solver for Flow Free puzzles written in C. 用C语言编写的连线游戏的快速自动求解器. GIF of the final pro ...
C（C++）后端基础五万字浅析指针
系列文章目录目录 part 1 基础部分一.内存结构与指针 1.指针,指针变量,自由存储空间 2. *的位置与两个作用二.指针变量的类型与解读方式 1.定义,声明 2.指针的声明 ...
[data structure] heap 堆
定义: 1 (二叉) 堆是一颗完全二叉树. 2 任何一个节点都小于它的后裔节点.(最小堆),相应的,最大堆中的任何一个节点大于它的后裔节点. 由于二叉堆是一个完全二叉树,因此对于二叉堆中的任何一 ...
数据结构之堆Heap
1. 概述堆(也叫优先队列),是一棵完全二叉树,它的特点是父节点的值大于(小于)两个子节点的值(分别称为大顶堆和小顶堆).它常用于管理算法执行过程中的信息,应用场景包括堆排序,优先队列等. 2. 堆 ...
PTA 09-排序3 Insertion or Heap Sort (25分)
题目地址 https://pta.patest.cn/pta/test/16/exam/4/question/676 5-14 Insertion or Heap Sort (25分) Accor ...

Structure of Heap

Structure of Heap相关推荐

最新文章

热门文章