会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Reducing the overhead involved in executing native code in a virtual machine through binary reoptimization
    • 通过二进制重新优化减少在虚拟机中执行本地代码所涉及的开销
    • US07840951B1
    • 2010-11-23
    • US10646309
    • 2003-08-22
    • Gregory M. WrightMario I. WolczkoMatthew L. Seidl
    • Gregory M. WrightMario I. WolczkoMatthew L. Seidl
    • G06F9/45
    • G06F8/53G06F9/45516G06F9/45533
    • One embodiment of the present invention provides a system that reduces the overhead involved in executing a native code method in an application running on a virtual machine. During operation, the system selects a call to a native code method to be optimized within the virtual machine, decompiles at least part of the native code method into an intermediate representation, and obtains an intermediate representation associated with the application. Next, the system combines the intermediate representation for the native code method with the intermediate representation associated with the application running on the virtual machine to form a combined intermediate representation, and generates native code from the combined intermediate representation, wherein the native code generation process optimizes interactions between the application running on the virtual machine and the native code method. A variation on this embodiment involves optimizing callbacks by the native code method into the virtual machine.
    • 本发明的一个实施例提供一种减少在虚拟机上运行的应用中执行本地代码方法所涉及的开销的系统。 在操作期间,系统选择对本机代码方法的调用以在虚拟机内进行优化,将至少部分本地代码方法反编译成中间表示,并获得与应用相关联的中间表示。 接下来,系统将本地代码方法的中间表示与在虚拟机上运行的应用程序相关联的中间表示形成组合的中间表示,并从组合的中间表示生成本地代码,其中本地代码生成过程优化 在虚拟机上运行的应用程序与本地代码方法之间的交互。 该实施例的变体涉及将本地代码方法的回调优化到虚拟机中。
    • 2. 发明授权
    • Method and apparatus for facilitating in-cache reference counting
    • 用于促进缓存中引用计数的方法和装置
    • US07774546B1
    • 2010-08-10
    • US11155276
    • 2005-06-17
    • Gregory M. WrightMatthew L. SeidlMario I. Wolczko
    • Gregory M. WrightMatthew L. SeidlMario I. Wolczko
    • G06F12/00G06F13/00G06F13/28
    • G06F12/0802G06F12/0253
    • One embodiment of the present invention provides a system that facilitates in-cache reference counting in a cache memory. During operation, the system receives a command to update an old cache line with a new cache line. The system then determines if the new cache line is different than the old cache line. If so, the system determines if the old cache line contains any in-cache references. If so, for each such in-cache reference, the system decrements a reference counter in a cache line containing an object which is referenced by the in-cache reference. The system also determines if the new cache line contains any in-cache references. If so, for each such in-cache reference, the system increments a reference counter in a cache line containing an object which is referenced by the in-cache reference. Note that the reference counter in a cache line indicates a count of references in the cache that refer to an object contained in the cache line.
    • 本发明的一个实施例提供了一种有助于高速缓存存储器中的高速缓存引用计数的系统。 在操作期间,系统接收到使用新的高速缓存行更新旧缓存行的命令。 然后,系统确定新的高速缓存行是否与旧的高速缓存行不同。 如果是这样,系统确定旧的高速缓存行是否包含任何缓存中的引用。 如果是这样,对于每个这样的高速缓存引用,系统递减包含由缓存内引用引用的对象的高速缓存行中的引用计数器。 该系统还确定新的高速缓存行是否包含任何缓存中的引用。 如果是这样,对于每个这样的缓存引用,系统会增加包含由缓存内引用引用的对象的高速缓存行中的引用计数器。 请注意,缓存行中的引用计数器指示缓存中引用包含在高速缓存行中的对象的引用计数。
    • 5. 发明授权
    • Method and apparatus for skewing a bi-directional object layout to improve cache performance
    • 用于偏斜双向对象布局以提高高速缓存性能的方法和装置
    • US07246141B2
    • 2007-07-17
    • US10335621
    • 2003-01-02
    • Mario I. WolczkoMatthew L. SeidlGregory M. Wright
    • Mario I. WolczkoMatthew L. SeidlGregory M. Wright
    • G06F12/00G06F12/02
    • G06F12/0886Y10S707/99953Y10S707/99956
    • One embodiment of the present invention facilitates skewing a bi-directional object layout to provide good cache behavior. During operation, the system receives a request to access an object. This request includes an object identifier and an object offset that specifies the offset of a target field within the object, wherein the object has a bi-directional layout that locates scalar fields at positive offsets and reference fields at negative offsets, so that a reference field can be immediately identified from its object offset. Next, the system determines a skew value for a cache line containing the object, wherein data within the cache line is shifted based upon the skew value, so that reference fields with small negative offsets are likely to be located in the same cache line as scalar fields with small positive offsets. Next, the system uses the skew value in accessing the object.
    • 本发明的一个实施例有助于扭曲双向对象布局以提供良好的缓存行为。 在操作期间,系统接收访问对象的请求。 该请求包括对象标识符和对象偏移量,该对象标识符和对象偏移量指定对象内的目标字段的偏移量,其中对象具有双向布局,其在负偏移处以正偏移量和参考字段定位标量字段,使得参考字段 可以从其对象偏移中立即识别。 接下来,系统确定包含对象的高速缓存行的偏斜值,其中高速缓存行内的数据基于偏差值移位,使得具有小的负偏移的参考字段可能位于与标量相同的高速缓存行中 具有小正偏移的场。 接下来,系统在访问对象时使用偏斜值。
    • 6. 发明授权
    • Object-addressed memory hierarchy that facilitates accessing objects stored outside of main memory
    • 对象寻址的存储器层次结构,便于访问存储在主存储器外部的对象
    • US07171540B1
    • 2007-01-30
    • US10698728
    • 2003-10-31
    • Matthew L. SeidlGregory M. WrightMario I. Wolczko
    • Matthew L. SeidlGregory M. WrightMario I. Wolczko
    • G03F12/10
    • G06F12/0897G06F12/1045Y10S707/99933
    • One embodiment of the present invention provides an object-addressed memory hierarchy that is able to access objects stored outside of main memory. During operation, the system receives a request to access an object, wherein the request includes an object identifier for the object that is used to reference the object within the object-addressed memory hierarchy. Next, the system uses the object identifier to retrieve an object table entry associated with the object. The system then examines a valid bit within the object table entry. If the valid bit indicates the object is located in main memory, the system uses a physical address in the object table entry to access the object in main memory. On the other hand, if the valid bit indicates that the object is not located in main memory, the system relocates the object into memory from a location outside of memory, and then accesses the object in main memory.
    • 本发明的一个实施例提供了一种能够访问存储在主存储器外部的对象的物体寻址存储器层级。 在操作期间,系统接收访问对象的请求,其中请求包括用于引用对象寻址的存储器层次结构内的对象的对象的对象标识符。 接下来,系统使用对象标识符来检索与对象相关联的对象表条目。 然后系统检查对象表条目中的有效位。 如果有效位表示对象位于主存储器中,则系统使用对象表条目中的物理地址访问主内存中的对象。 另一方面,如果有效位指示对象不位于主存储器中,则系统从存储器外部的位置将对象重新定位到存储器中,然后访问主存储器中的对象。
    • 8. 发明授权
    • Method and apparatus for facilitating mark-sweep garbage collection with reference counting
    • 引用计数方法和装置,方便标记扫描垃圾收集
    • US07631024B2
    • 2009-12-08
    • US11325381
    • 2006-01-03
    • Gregory M. WrightMario I. WolczkoMatthew L. Seidl
    • Gregory M. WrightMario I. WolczkoMatthew L. Seidl
    • G06F12/00G06F17/30G06F15/16
    • G06F12/0261G06F12/0269Y10S707/99953Y10S707/99957
    • A method and a system for facilitating garbage collection (GC) operations in a memory-management system that supports both mark-sweep (MS) objects and reference-counted (RC) objects, wherein objects which are frequently modified are classified as MS objects, and objects which are infrequently modified are classified as RC objects. During a marking phase of a GC operation, the system identifies a set of root objects and then marks referents of the root objects. The system then recursively traverses referents of the root objects which are MS objects and while doing so, marks referents of the traversed MS objects. However, if an RC object is encountered during the traversal of an MS object, the system marks the RC object but does not recursively traverse the RC object. In doing so, the system avoids traversing a large number of RC objects which are infrequently modified.
    • 一种用于在支持标记扫描(MS)对象和参考计数(RC)对象的存储器管理系统中促进垃圾回收(GC)操作的方法和系统,其中频繁修改的对象被分类为MS对象, 并且不经常修改的对象被分类为RC对象。 在GC操作的标记阶段,系统识别一组根对象,然后标记根对象的对象。 然后,系统递归地遍历作为MS对象的根对象的对象,并且在这样做时,标记所遍历的MS对象的对象。 然而,如果在遍历MS对象期间遇到RC对象,则系统标记RC对象,但不递归地遍历RC对象。 在这样做时,系统避免遍历不经常修改的大量RC对象。
    • 10. 发明授权
    • Memory space management for object-based memory system
    • 基于对象的内存系统的内存空间管理
    • US07269705B1
    • 2007-09-11
    • US10831415
    • 2004-04-23
    • Matthew L. SeidlGregory M. WrightMario I. Wolczko
    • Matthew L. SeidlGregory M. WrightMario I. Wolczko
    • G06F12/00
    • G06F12/023G06F9/5016G06F12/0875Y10S707/99953Y10S707/99956
    • A method for pre-allocating memory for object-based cache data is provided in which request for an object having an associated property parameter that defines the memory requirements for the object. In response, a table of allocation buckets is searched for a bucket having the associated property parameter that can at least meet the memory requirements for the requested object. If an object identifier (OID), having a previously allocated physical address in main memory, is identified in the table of allocation buckets then the identified OID is assigned to the object. The object is stored in the object cache with the assigned OID, and the OID is removed from the bucket. Also included is a table of allocation buckets in a computer system in which each of a plurality of buckets is capable of holding object identifiers (OIDs). Each object identifier (OID) has a pre-allocated physical memory, with buckets of the table of allocation buckets being replenished by recycling a previously used OID when the object associated with the OID is reclaimed.
    • 提供了一种用于为基于对象的高速缓存数据预分配存储器的方法,其中对具有定义对象的存储器需求的关联属性参数的对象的请求。 作为响应,搜索分配桶的表以具有可以至少满足所请求对象的存储器要求的关联属性参数的桶。 如果在主存储器中具有先前分配的物理地址的对象标识符(OID)在分配桶的表中被识别,则将所识别的OID分配给该对象。 对象使用分配的OID存储在对象缓存中,OID从存储桶中删除。 还包括计算机系统中的分配桶的表,其中多个桶中的每一个能够保存对象标识符(OID)。 每个对象标识符(OID)具有预分配的物理内存,当与OID相关联的对象被回收时,通过循环先前使用的OID来补充分配桶的表中的桶。