公开(公告)号：US08516019B2

公开(公告)日：2013-08-20

申请号：US13251922

申请日：2011-10-03

申请人： Charlie J. Hunt ,  Antonios Printezis ,  Staffan Friberg

发明人： Charlie J. Hunt ,  Antonios Printezis ,  Staffan Friberg

IPC分类号： G06F17/30

CPC分类号： G06F12/0276

摘要： System and Methods for time-based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. A circular buffer is generated to store a plurality of starting time for a plurality of garbage collections. Generational garbage collection is performed, and the time data in conjunction with the starting times stored in the circular buffer are used to determine when objects are promoted from one generation to the next oldest generation.

摘要翻译： 提供了代代垃圾收集器的基于时间的对象老化的系统和方法。 从用户那里接收时间数据，标识对象在堆中定义的生成中应该生存的时间量。 生成循环缓冲器以存储多个垃圾收集的多个开始时间。 执行生成垃圾回收，结合存储在循环缓冲器中的开始时间的时间数据用于确定何时将对象从一代升级到下一代。

公开(公告)号：US20130086132A1

公开(公告)日：2013-04-04

申请号：US13251974

申请日：2011-10-03

申请人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

发明人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

IPC分类号： G06F17/30

CPC分类号： G06F12/0276 ,  G06F12/0253

摘要： System and Methods for time based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. Generational garbage collection is performed, and objects are promoted from one generation to the next oldest generation based on the time data received.

摘要翻译： 提供了生成垃圾收集器的基于时间的对象老化的系统和方法。 从用户那里接收时间数据，标识对象在堆中定义的生成中应该生存的时间量。 执行生成垃圾回收，根据收到的时间数据，将对象从一代晋升为下一代。

公开(公告)号：US08825721B2

公开(公告)日：2014-09-02

申请号：US13251974

申请日：2011-10-03

申请人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

发明人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

IPC分类号： G06F17/30 ,  G06F12/02

CPC分类号： G06F12/0276 ,  G06F12/0253

摘要： System and Methods for time based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. Generational garbage collection is performed, and objects are promoted from one generation to the next oldest generation based on the time data received.

摘要翻译： 提供了生成垃圾收集器的基于时间的对象老化的系统和方法。 从用户那里接收时间数据，标识对象在堆中定义的生成中应该生存的时间量。 执行生成垃圾回收，根据收到的时间数据，将对象从一代晋升为下一代。

公开(公告)号：US20130086131A1

公开(公告)日：2013-04-04

申请号：US13251922

申请日：2011-10-03

申请人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

发明人： Charlie Hunt ,  Antonios Printezis ,  Staffan Friberg

IPC分类号： G06F17/30

CPC分类号： G06F12/0276

摘要： System and Methods for time-based object aging for generational garbage collectors are provided. Time data is received from a user identifying the amount of time an object should survive in a generation defined in a heap. A circular buffer is generated to store a plurality of starting time for a plurality of garbage collections. Generational garbage collection is performed, and the time data in conjunction with the starting times stored in the circular buffer are used to determine when objects are promoted from one generation to the next oldest generation.

摘要翻译： 提供了代代垃圾收集器的基于时间的对象老化的系统和方法。 从用户那里接收时间数据，标识对象在堆中定义的生成中应该生存的时间量。 生成循环缓冲器以存储多个垃圾收集的多个开始时间。 执行生成垃圾回收，结合存储在循环缓冲器中的开始时间的时间数据用于确定何时将对象从一代升级到下一代。

公开(公告)号：US20120254267A1

公开(公告)日：2012-10-04

申请号：US13077678

申请日：2011-03-31

申请人： Antonios Printezis ,  Igor Veresov ,  Paul Henry Hohensee ,  John Coomes

发明人： Antonios Printezis ,  Igor Veresov ,  Paul Henry Hohensee ,  John Coomes

IPC分类号： G06F17/30

CPC分类号： G06F12/0269 ,  G06F12/0276 ,  G06F2212/2542

摘要： System and Methods for non-uniform memory (NUMA) garbage collection are provided. Multiple memories and processors are categorized into local groups. A heap space is divided into multiple pools and stored in each of the memories. Garbage collection threads are assigned to each of the local groups. Garbage collection is performed using the garbage collection threads for objects contained in the pools using the garbage collector threads, memory, and processor assigned to each local group, minimizing remote memory accesses.

摘要翻译： 提供了非均匀内存（NUMA）垃圾收集的系统和方法。 多个存储器和处理器分为本地组。 堆空间被分成多个池并存储在每个存储器中。 垃圾收集线程被分配给每个本地组。 使用垃圾收集器线程，内存和处理器分配给每个本地组，使用池中包含的对象的垃圾收集线程执行垃圾收集，从而最小化远程内存访问。

公开(公告)号：US20120254266A1

公开(公告)日：2012-10-04

申请号：US13077619

申请日：2011-03-31

申请人： Antonios Printezis ,  Igor Veresov ,  Paul Henry Hohensee ,  John Coomes

发明人： Antonios Printezis ,  Igor Veresov ,  Paul Henry Hohensee ,  John Coomes

IPC分类号： G06F17/30

CPC分类号： G06F12/0276 ,  G06F2212/2542

摘要： Methods and systems for garbage collection are described. In some embodiments, Garbage collector threads may maximize local accesses and minimize remote access by copying Young objects and Old objects differently. When copying a Young object, a garbage collector thread may determine the lgroup of the pool that contains the object and copy the object to a pool of the same lgroup. The garbage collector thread may spread Old objects among lgroups by copying Old objects to pools of the same lgroup as the respective garbage collector thread. Additional methods and systems are disclosed.

摘要翻译： 描述垃圾收集的方法和系统。 在一些实施例中，垃圾收集器线程可以最大化本地访问并且通过以不同方式复制Young对象和旧对象来最小化远程访问。 复制Young对象时，垃圾收集器线程可能会确定包含该对象的池的lgroup，并将该对象复制到同一个lgroup的池中。 垃圾收集器线程可能会通过将旧对象复制到与各个垃圾收集器线程相同的lgroup的池中来扩展lgroup之间的旧对象。 公开了附加的方法和系统。

公开(公告)号：US20110208792A1

公开(公告)日：2011-08-25

申请号：US12708996

申请日：2010-02-19

申请人： Antonios Printezis ,  Y. Srinivas Ramakrishna

发明人： Antonios Printezis ,  Y. Srinivas Ramakrishna

IPC分类号： G06F17/00 ,  G06F12/02 ,  G06F12/00

CPC分类号： G06F12/0276

摘要： The present disclosure describes garbage collection that provides prompt reclamation of large objects. A heap space is divided into Young regions, Old regions, and Humongous regions. A remembered set is created and maintained, during the execution of one or more programs, for each region that specifies where there are references from outside the region to inside the region. A garbage collection list is generated specifying regions to perform garbage collection on. All Young regions and at least one Humongous region are included in the garbage collection list. If it is determined to include Old regions, the Old regions are selected and included in the garbage collection list. Then, a garbage collection is performed on the regions specified in the garbage collection list. During the garbage collection, the indication for each region is utilized to determine reachable objects in the region, ensuring that reachable objects are not deallocated.

摘要翻译： 本公开描述了提供快速回收大对象的垃圾收集。 堆积空间分为青年地区，老区和Humongous地区。 在执行一个或多个程序期间，为指定从区域外部到区域内的引用的每个区域创建和维护一个记忆集。 生成垃圾收集列表指定区域进行垃圾收集。 所有年轻地区和至少一个Humongous地区都包括在垃圾收集清单中。 如果确定包含旧区域，则选择旧区域并将其包括在垃圾收集列表中。 然后，在垃圾回收列表中指定的区域执行垃圾收集。 在垃圾收集期间，利用每个区域的指示来确定该区域中的可达对象，确保可到达的对象不被释放。

公开(公告)号：US07779054B1

公开(公告)日：2010-08-17

申请号：US11239992

申请日：2005-09-30

申请人： Antonios Printezis ,  David L. Detlefs

发明人： Antonios Printezis ,  David L. Detlefs

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F12/0276

摘要： A method for heuristic-based resumption of fully-young garbage collection intervals comprises allocating memory to objects within one or more regions of a heap partitioned into a plurality of regions, and classifying each heap region as belonging to a category of a plurality of categories based at least in part on the recency of allocation of objects within the regions. The method may further comprise determining, using a garbage collection efficiency metric, whether regions belonging to a first category of the plurality of categories are to be excluded from a collection set of a particular garbage collection interval on the heap. In response to determining that the first category of regions is to be excluded, the method may comprise selecting a collection set that does not include any regions of the first category, and reclaiming memory from that collection set.

摘要翻译： 一种用于基于启发式恢复全年垃圾收集间隔的方法包括：将存储器分配给划分成多个区域的堆的一个或多个区域内的对象，并将每个堆区域分类为属于多个类别的类别 至少部分地是区域内对象的分配情况。 该方法还可以包括：使用垃圾收集效率度量来确定属于多个类别的第一类别的区域是否将从堆上的特定垃圾收集间隔的集合集中排除。 响应于确定要排除第一类别的区域，该方法可以包括选择不包括第一类别的任何区域的收集集合，以及从该集合集合回收存储器。

公开(公告)号：US07313566B1

公开(公告)日：2007-12-25

申请号：US11021260

申请日：2004-12-23

申请人： Antonios Printezis ,  Alexander T. Garthwaite

发明人： Antonios Printezis ,  Alexander T. Garthwaite

IPC分类号： G06F17/30

CPC分类号： G06F12/0269 ,  G06F12/145 ,  G06F2212/1016 ,  Y10S707/99942

摘要： All references to an object subset to which an atomic operation is to be applied are deliberately transformed so that an attempt by an application thread to dereference such a transformed reference will raise a faulting address trap. When the faulting address trap is raised, the faulting thread will enter a trap handler, which suspends the faulting thread. The atomic operation can then be applied and the faulting thread restarted.

摘要翻译： 对要应用原子操作的对象子集的所有引用都会故意转换，以便应用程序线程尝试取消引用此类转换的引用将引发故障地址陷阱。 当故障地址陷阱提升时，故障线程将进入陷阱处理程序，暂停故障线程。 然后可以应用原子操作，并重新启动故障线程。

公开(公告)号：US20070162526A1

公开(公告)日：2007-07-12

申请号：US11305957

申请日：2005-12-19

申请人： Antonios Printezis ,  David Detlefs

发明人： Antonios Printezis ,  David Detlefs

IPC分类号： G06F17/30

CPC分类号： G06F9/4843 ,  G06F9/5016 ,  G06F12/0269

摘要： The time cost of collecting a region in a Garbage-First garbage collector is adjusted to account for concurrent thread activity. The overhead of a concurrent thread is tracked by dividing elapsed time into relatively short time “windows” and monitoring the system during those windows to determine how long that thread is scheduled to run during those windows. Using measurements of this type for each concurrent thread, the percentage of each elapsed time window dedicated to each concurrent thread is determined. Finally, by summing the percentages of elapsed time dedicated to concurrent thread activity, the cost of collecting a region can be increased by adding the overhead attributable to concurrent activity.

摘要翻译： 在垃圾回收垃圾回收器中收集区域的时间成本调整为兼并线程活动。 并行线程的开销通过将经过的时间划分为相对较短的时间“windows”并在这些窗口中监视系统来跟踪，以确定在这些窗口期间该线程计划运行多长时间。 对每个并发线程使用此类型的测量，确定专用于每个并发线程的每个经过时间窗口的百分比。 最后，通过将专用于并发线程活动的经过时间的百分比相加，可以通过添加归并于并发活动的开销来增加收集区域的成本。