公开(公告)号：US09535937B2

公开(公告)日：2017-01-03

申请号：US13431976

申请日：2012-03-28

申请人： Michael Stephen Fulton

发明人： Michael Stephen Fulton

IPC分类号： G06F17/30

CPC分类号： G06F17/30312

摘要： A method for implementing a geometric array in a computing environment is disclosed. In one embodiment, such a method includes providing an array of slots, where each slot is configured to store a pointer. Each pointer in the array points to a block of elements. Each pointer with the exception of the first pointer in the array points to a block of elements that is twice as large as the block of elements associated with the preceding pointer. Such a structure allows the geometric array to grow by simply adding a pointer to the array that points to a new block of elements that is twice as large as the block of elements associated with the preceding pointer in the array. A corresponding computer program product, as well as a method for accessing data in the geometric array, are also disclosed.

摘要翻译： 公开了一种在计算环境中实现几何阵列的方法。 在一个实施例中，这种方法包括提供时隙阵列，其中每个时隙被配置为存储指针。 数组中的每个指针指向一个元素块。 除了数组中的第一个指针之外的每个指针都指向与前一个指针相关联的元素块的两倍大的元素块。 这样的结构允许通过简单地向数组添加指向新数据块的元素的数组的数组的两倍，该数组的数组的大小是与数组中的前一个指针相关联的元素的两倍。 还公开了相应的计算机程序产品以及用于访问几何阵列中的数据的方法。

公开(公告)号：US20090063594A1

公开(公告)日：2009-03-05

申请号：US11846594

申请日：2007-08-29

申请人： Gary John DeVal ,  Michael Stephen Fulton ,  Curtis E. Hrischuk ,  Ryan Andrew Sciampacone

发明人： Gary John DeVal ,  Michael Stephen Fulton ,  Curtis E. Hrischuk ,  Ryan Andrew Sciampacone

IPC分类号： G06F17/30

CPC分类号： G06F12/0253

摘要： The number of CPU cycles required to reclaim object memory space in a memory management process is reduced by using a two phase approach. A data structure exists for each object that is to be loaded into object memory space. One part of the data structure is the object definition. The other part is a MM (Memory Management) immunity annotation or value that controls the frequency with which the object must actually be examined to determine if it is suitable for reclamation. On each iteration of the memory management process, the object's MM immunity value is tested to determine whether it is greater than a predetermined threshold. If greater than the threshold, the value is decremented, but the object is not actually examined for its suitability for removal. If the value equals the threshold, the object itself is examined. If it is found to be suitable, it is removed to reclaim the object memory space it previously occupied, If it is actually examined but is found not to be suitable for removal, the MM immunity value is reset to its original value or is otherwise adjusted to prevent examination of the object for a certain number of future iterations of the memory management process.

摘要翻译： 通过使用两相方法可以减少在内存管理过程中回收对象内存空间所需的CPU周期数。 对于要加载到对象内存空间的每个对象，都存在数据结构。 数据结构的一部分是对象定义。 另一部分是MM（内存管理）豁免注释或值，用于控制物体必须实际检查的频率，以确定是否适合回收。 在存储器管理过程的每次迭代中，测试对象的MM抗扰度值以确定其是否大于预定阈值。 如果大于阈值，则该值递减，但是实际上并没有检查该对象是否适用于删除。 如果该值等于阈值，则会检查对象本身。 如果发现是合适的，则将其删除以回收其以前占用的对象存储空间，如果实际检查但被发现不适合删除，则MM抗扰度值将重置为其原始值或以其他方式调整 以防止对对象进行一定数量的未来内存管理过程的迭代。

公开(公告)号：US08140597B2

公开(公告)日：2012-03-20

申请号：US11846594

申请日：2007-08-29

申请人： Gary John DeVal ,  Michael Stephen Fulton ,  Curtis E. Hrischuk ,  Ryan Andrew Sciampacone

发明人： Gary John DeVal ,  Michael Stephen Fulton ,  Curtis E. Hrischuk ,  Ryan Andrew Sciampacone

IPC分类号： G06F17/30

CPC分类号： G06F12/0253

摘要： The number of CPU cycles required to reclaim object memory space in a memory management process is reduced by using a two phase approach. A data structure exists for each object that is to be loaded into object memory space. One part of the data structure is the object definition. The other part is a MM (Memory Management) immunity annotation or value that controls the frequency with which the object must actually be examined to determine if it is suitable for reclamation. On each iteration of the memory management process, the object's MM immunity value is tested to determine whether it is greater than a predetermined threshold. If greater than the threshold, the value is decremented, but the object is not actually examined for its suitability for removal. If the value equals the threshold, the object itself is examined. If it is found to be suitable, it is removed to reclaim the object memory space it previously occupied, If it is actually examined but is found not to be suitable for removal, the MM immunity value is reset to its original value or is otherwise adjusted to prevent examination of the object for a certain number of future iterations of the memory management process.

摘要翻译： 通过使用两相方法可以减少在内存管理过程中回收对象内存空间所需的CPU周期数。 对于要加载到对象内存空间的每个对象，都存在数据结构。 数据结构的一部分是对象定义。 另一部分是MM（内存管理）豁免注释或值，用于控制物体必须实际检查的频率，以确定是否适合回收。 在存储器管理过程的每次迭代中，测试对象的MM抗扰度值以确定其是否大于预定阈值。 如果大于阈值，则该值递减，但是实际上并没有检查该对象是否适用于删除。 如果该值等于阈值，则会检查对象本身。 如果发现是合适的，则将其删除以回收其以前占用的对象存储空间，如果实际检查但被发现不适合删除，则MM抗扰度值将重置为其原始值或进行其他调整 以防止对对象进行一定数量的未来内存管理过程的迭代。

公开(公告)号：US08423594B2

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

申请号：US12874136

申请日：2010-09-01

申请人： Michael Stephen Fulton ,  Mark Graham Stoodley

发明人： Michael Stephen Fulton ,  Mark Graham Stoodley

IPC分类号： G06F17/30 ,  G06F9/26

CPC分类号： G06F17/30949

摘要： A method for implementing a hash map to improve performance consistency is disclosed herein. In one embodiment, such a method includes providing a hash map comprising a set of tables, the set of tables initially containing a first table. When the first table is full, the method augments the hash map by adding a second table to the set of tables. Similarly, when the second table is full, the method augments the hash map by adding a third table to the set of tables. A similar technique may be used to add additional tables to the hash map. When searching for a value in any of the tables in the hash map, the method uses the same hash code. A corresponding computer program product and apparatus are also disclosed herein.

摘要翻译： 本文公开了一种用于实现散列图以提高性能一致性的方法。 在一个实施例中，这种方法包括提供包括一组表的哈希映射，该表的集合最初包含第一表。 当第一个表已满时，该方法通过向表的集合添加第二个表来增加散列映射。 类似地，当第二个表已满时，该方法通过向表的集合添加第三个表来增加散列映射。 可以使用类似的技术来向哈希映射添加其他表。 当在哈希映射中的任何表中搜索值时，该方法使用相同的哈希码。 本文还公开了相应的计算机程序产品和装置。