会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Breaking read barrier to apply optimizations
    • 打破阅读障碍以应用优化
    • US07702663B2
    • 2010-04-20
    • US10751598
    • 2004-01-05
    • David Francis BaconPerry ChengVadakkedathu Thomas Rajan
    • David Francis BaconPerry ChengVadakkedathu Thomas Rajan
    • G06F7/00
    • G06F12/0253
    • A garbage collection system that needs to meet real-time requirements utilizes a read barrier that is implemented in an optimizing compiler. The read barrier is implemented with a forwarding pointer positioned in a header of each object. The forwarding pointer points to the object unless the object has been moved. The barrier is optimized by breaking the barrier and applying barrier sinking to sink the read barrier to its point of use and by using sub-expression elimination. A null-check for the read barrier is combined with a null-check required by the real-time application. All objects are located and moved with the collector to minimize variations in mutator utilization.
    • 需要满足实时要求的垃圾收集系统使用在优化编译器中实现的读取障碍。 读取障碍通过位于每个对象的头部中的转发指针来实现。 转发指针指向对象,除非对象已被移动。 通过打破屏障并应用屏障吸收将读屏障吸收到其使用点并通过使用子表达式消除来优化屏障。 读取障碍的空值检查与实时应用程序所需的空检验相结合。 所有物体都与收集器一起定位并移动,以最大限度地减少变异器利用率的变化。
    • 9. 发明授权
    • Method and apparatus for dynamic incremental defragmentation of memory
    • 用于动态增量碎片整理存储器的方法和装置
    • US07519639B2
    • 2009-04-14
    • US10751789
    • 2004-01-05
    • David Francis BaconPerry ChengVadakkedathu Thomas Rajan
    • David Francis BaconPerry ChengVadakkedathu Thomas Rajan
    • G06F17/30G06F12/00
    • G06F12/0269Y10S707/99957
    • A garbage collection process for managing a memory includes a defragmentation cycle. The garbage collection process is interleaved with a running application on a time-based or work-based schedule. The memory is divided into pages which are further divided into blocks falling into one of a number of block size classes. Objects that were not used by applications during the last garbage collection phase are marked. Objects that were used are moved from pages containing the least live objects to pages containing the most live objects. Objects of the largest block size classes are moved first and objects of the smallest block size class are moved last. The garbage collection interval can be selected to satisfy desired CPU utilization or memory overhead requirements.
    • 用于管理存储器的垃圾收集过程包括碎片整理周期。 垃圾收集过程与基于时间或基于工作的计划的正在运行的应用程序进行交织。 存储器被划分为进一步分成多个块大小类别之一的块的页面。 在最后垃圾收集阶段,应用程序未使用的对象被标记。 使用的对象从包含最少活动对象的页面移动到包含最多活动对象的页面。 首先移动最大块大小类的对象,最后移动最小块大小类的对象。 可以选择垃圾收集间隔以满足期望的CPU利用率或内存开销要求。
    • 10. 发明申请
    • Concurrent Collection of Cyclic Garbage in Reference Counting Systems
    • 参考计数系统中循环垃圾的并发收集
    • US20120131070A1
    • 2012-05-24
    • US13363811
    • 2012-02-01
    • David Francis BaconVadakkedathu Thomas Rajan
    • David Francis BaconVadakkedathu Thomas Rajan
    • G06F17/30
    • G06F12/0261Y10S707/99938Y10S707/99957
    • The present invention provides techniques that allow concurrent collection of cyclic garbage on reference counting systems. In general, candidate objects are found that may be part of cyclic garbage. Each candidate object has a reference count. Two tests are performed to determine if concurrent operations have affected the reference counts of the candidate objects. If concurrent operations have not affected the reference counts, the candidate objects are collected as garbage. Additionally, during garbage collection, the decrements to reference counts are delayed so that increments occur before decrements and so that decrements are held a predetermined time before being applied. This prevents decrementing a reference and collecting a cycle as garbage right before a reference is added to an object in the cycle.
    • 本发明提供允许在引用计数系统上并行收集循环垃圾的技术。 一般来说,候选对象被发现可能是循环垃圾的一部分。 每个候选对象都有引用计数。 执行两个测试以确定并发操作是否影响候选对象的引用计数。 如果并发操作没有影响引用计数,则将候选对象收集为垃圾。 此外,在垃圾收集期间,延迟到引用计数的减少,使得在递减之前发生增量,并且使得递减在施加之前保持预定时间。 这样可以避免在引用被添加到循环中的对象之前减少引用并收集循环作为垃圾。