会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and apparatus for performing generational garbage collection using barrier bits
    • 使用障碍位执行代数垃圾收集的方法和装置
    • US06510440B1
    • 2003-01-21
    • US09480189
    • 2000-01-10
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • G06F1200
    • G06F12/0276Y10S707/99957
    • A method and apparatus are disclosed for efficiently creating and maintaining a remembered set in a generational garbage collection scheme using a write buffer and a barrier bit associated with each object. A barrier bit associated with each object differentiates generations in a generational garbage collection scheme. When an object is first created, the barrier bit of the object is set to zero. The barrier bit is set when the object becomes old, for example, after surviving a first garbage collection. The barrier bit is used to determine whether to make an entry into a write buffer when a reference to another object is stored into an object. An entry is made in the write buffer only if the barrier bit of the object that is written into is set. At the end of each garbage collection, entries in the write buffer are added to the remembered set for the next garbage collection if the objects satisfy the criterion for membership, i.e., they are live and may contain pointers to objects in a younger generation. Thus, the remembered set consists of objects that were in the write buffer at the time of a garbage collection, that must be remembered for the next garbage collection. The write buffer is kept small by eliminating duplicate entries. The present invention turns off the barrier bit after the first store during each reclamation period (which causes the object to be identified in the write buffer). The barrier bit is turned on again by the garbage collector after the write buffer has been processed.
    • 公开了一种方法和装置,用于使用与每个对象相关联的写缓冲器和屏障位,在代数垃圾回收方案中有效地创建和维护记忆集。 与每个对象相关联的障碍位在代数垃圾回收方案中区分世代。 当对象首次创建时,对象的障碍位设置为零。 当对象变老时,例如,在第一个垃圾收集生存之后,屏障位被置位。 当将对另一个对象的引用存储到一个对象中时,屏障位用于确定是否进入写缓冲区。 仅当写入的对象的屏蔽位被置位时,才在写入缓冲区中进行条目。 在每个垃圾回收结束时,如果对象满足成员资格的标准,即它们是活的,并且可能包含指向年轻一代中的对象的指针,则将写缓冲区中的条目添加到下一个垃圾收集的记忆集中。 因此,记住的集合由垃圾回收时在写缓冲区中的对象组成,必须为下一个垃圾回收记住。 通过消除重复条目,写缓冲区保持较小。 本发明在每个回收周期(使得在写入缓冲器中识别对象)之后关闭第一次存储之后的屏障位。 写入缓冲区被处理完毕后,垃圾收集器再次打开屏障位。
    • 3. 发明授权
    • Location dependence for assuring the security of system-control
operations
    • 确保系统控制操作安全的位置依赖
    • US4087856A
    • 1978-05-02
    • US701058
    • 1976-06-30
    • Clement Richard Attanasio
    • Clement Richard Attanasio
    • G06F12/14G06F21/22G06F13/00
    • G06F12/1491G06F12/1441
    • A computer operating system security mechanism employing a non-penetrable hardware means for storing privileged instruction identification data for preventing direct unauthorized access to certain privileged instructions forming a part of the computer operating system; and further including memory address data boundary storage means for each said privileged instruction for preventing indirect access to such privileged instructions in memory by unauthorized branch instructions. The mechanism includes means associated with the computing system instruction register for recognizing privileged instruction and branch instructions. Storage means are included for each privileged instruction it is desired to protect for storing the address of the privileged instruction itself in memory, and both the upper and lower boundary address in memory relating to each such privileged instruction. Whenever a privileged instruction is recognized its address as specified in the running program is compared with the present security mechanism address for said privileged instruction and if there is "no match" a security violation signal and interrupt will be produced. Similarly when any branch instruction is recognized, its address is checked with all privileged instruction boundaries and if found to lie within any stored boundary a security violation and interrupt will similarly be signaled.
    • 一种使用不可穿透的硬件装置的计算机操作系统安全机制,用于存储特权指令识别数据,用于防止直接未经授权访问形成计算机操作系统的一部分的某些特许指令; 并且还包括用于每个所述特权指令的存储器地址数据边界存储装置,以防止通过未授权的分支指令间接访问存储器中的这种特权指令。 该机制包括与用于识别特许指令和分支指令的计算系统指令寄存器相关联的装置。 对于每个特权指令包含存储装置,希望保护用于将特权指令本身的地址存储在存储器中,以及与每个这样的特权指令相关的存储器中的上边界地址和下边界地址。 无论何时识别出特权指令,将与运行程序中指定的地址进行比较,就可以将该特权指令的当前安全机制地址进行比较,如果存在“不匹配”,则会产生安全违规信号和中断。 类似地,当识别到任何分支指令时,其地址将被检查具有所有特权指令边界,并且如果发现位于任何存储的边界内,则将类似地发出安全冲突和中断。
    • 4. 发明授权
    • Method and apparatus for performing generational garbage collection using middle-aged objects
    • 使用中年对象执行代数垃圾收集的方法和装置
    • US06470361B1
    • 2002-10-22
    • US09480186
    • 2000-01-10
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • G06F1200
    • G06F12/0276Y10S707/99931Y10S707/99957
    • A method and apparatus are provided for the efficient management of remembered sets in a generational garbage collection scheme. The present invention detects when an old object has a pointer to a young object, and needs to be added to the remembered set. A write buffer and a temporary buffer are used to create and maintain the remembered set. Entries in the write and temporary buffers are used as part of the root set for creating the remembered set for the next garbage collection. A barrier bit associated with each object differentiates generations in the generational garbage collection scheme and is used to determine whether to make an entry into a write buffer when a reference to another object is stored into an object. Objects that have survived one or more collections, but not the minimum number, N, of collections to be considered an old object are referred to as “middle-aged” objects. During a minor garbage collection, the write buffer is scanned. Objects identified in the write buffer are transferred to the remembered set for the next cycle if the object is (i) an old object pointing to a younger object, or (ii) a middle-aged object that is determined to be live. Middle-aged objects identified in the write buffer that are not yet known to be live are transferred to the temporary buffer. At the end of the minor collection, the temporary buffer is processed and objects that are then known to be live are transferred into the remembered set.
    • 提供了一种用于在代代垃圾回收方案中有效管理记忆集的方法和装置。 本发明检测旧对象何时具有指向年轻对象的指针,并且需要将其添加到记忆集。 写入缓冲区和临时缓冲区用于创建和维护记忆集。 写入和临时缓冲区中的条目用作创建下一个垃圾收集的记忆集的根集的一部分。 与每个对象相关联的障碍位在代数垃圾回收方案中区分世代,并且用于当对另一对象的引用存储到对象中时,确定是否进入写入缓冲区。 被认为是旧对象的集合中存在一个或多个集合但不是最小数量N的对象被称为“中年”对象。 在小垃圾收集期间,扫描写入缓冲区。 如果对象是(i)指向较年轻对象的旧对象,或(ii)被确定为实时的中年对象,则在写缓冲区中识别的对象将被传送到下一周期的记忆集。 在写入缓冲区中识别的尚未知道的实时对象被传送到临时缓冲区。 在次要收集结束时,处理临时缓冲区,然后将已知为活动的对象转移到记忆集中。
    • 8. 发明授权
    • Method and apparatus for performing generational garbage collection using remembered set counter
    • 使用记忆集计数器执行代数垃圾收集的方法和装置
    • US06226653B1
    • 2001-05-01
    • US09480190
    • 2000-01-10
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • Bowen AlpernClement Richard AttanasioStephen Edwin Smith
    • G06F1200
    • G06F12/0276Y10S707/99931Y10S707/99957
    • A method and apparatus are provided for the efficient management of remembered sets in a generational garbage collection scheme. In order to manage the remembered set, the present invention provides a first mechanism for detecting when an old object has a pointer to a young object, and needs to be added to the remembered set, and a second mechanism for detecting when an object already in the remembered set no longer contains a pointer to a young object, so that the object can be removed from the remembered set. Entries in the remembered set have an associated counter, C, identifying the garbage collection cycle during which the object was placed in the remembered set. Objects inserted into the remembered set are assumed to point to the youngest possible object. Entries automatically expire from the remembered set when the garbage collection counter reaches C+N, since the objects pointed to by the object in the remembered set must now themselves be old objects. If an old object (one that has survived at least N garbage collections) is identified during a minor garbage collection, the old object is scanned normally, and is placed into the remembered set, with a counter C identifying the garbage collection cycle during which the old object was placed in the remembered set. The counter identifies the age of the youngest possible object pointed to by this object. When the garbage collection count reaches C+N, this entry can be discarded from the remembered set, since the associated object cannot point to any objects that are not old unless another more recent entry in the remembered set or write buffer exists for that object.
    • 提供了一种用于在代代垃圾回收方案中有效管理记忆集的方法和装置。 为了管理记忆集,本发明提供了一种用于检测旧对象何时具有指向年轻对象的指针并且需要被添加到记忆集合的第一机制,以及用于检测何时已经在对象中的对象 记忆集不再包含指向年轻对象的指针,以便可以从记忆集中删除对象。 记住的集合中的条目具有关联计数器C,标识对象被放置在记忆集中的垃圾收集循环。 插入到记忆集中的对象被假定为指向最小的对象。 当垃圾收集计数器达到C + N时,条目自动从记忆集合过期,因为记忆集中的对象指向的对象现在必须是旧对象。 如果在较小的垃圾收集期间识别出一个旧对象(一个至少存储了N个垃圾收集的对象),则旧对象被正常扫描,并被放置到记忆集中,计数器C标识垃圾收集循环,在该循环期间 旧对象被放置在记忆集中。 计数器识别此对象指向的最小可能对象的年龄。 当垃圾收集计数达到C + N时,可以从记忆集中丢弃此条目,因为关联的对象不能指向任何不是老的对象,除非存在该对象的记忆集或写入缓冲区中的另一个更新的条目。