Method and system for storing sparse data in memory and accessing stored sparse data

• US 20040024729A1
• Filed: 07/30/2002
• Published: 02/05/2004
• Est. Priority Date: 07/30/2002
• Status: Abandoned Application

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Inventors: Worley, John S.
• Application Number:
  US10/209,374
• Publication Number:
  US 20040024729A1
• Time in Patent Office: Days
• US Class Current: 707/1
• CPC Class Codes: G06F 12/10 Address translation
• CPC Class Codes: G06F 12/1027 using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]

Abstract

One embodiment of the present invention provides a hierarchical data structure for storing sparse data that can be traversed from root node to data-level node without incurring translation-cache misses. By contrast with currently used hierarchical data structures, the family of hierarchical data structures that represent one embodiment of the present invention employs non-data-level nodes that contain virtual-memory translations rather than memory references. The family of hierarchical data structures that represent one embodiment of the present invention are traversed from root node through successive layers of non-data-level nodes to data-level nodes in a manner similar to traversal of currently used hierarchical data structures. However, in the family of hierarchical data structures that represent one embodiment of the present invention, the address of a next-lower-level node is computed from a base address of the next-lowest level, and the computed address is furnished, along with the virtual-memory translation stored in a higher-level node, in order to access the next-lower-level node.

Claims

1. A method for storing a data entity having an index in a computer within a data structure having multiple node levels, the method comprising:

providing a hierarchical data structure for indexing stored data entities, the hierarchical data structure having a root level, one or more intermediate levels, and a data level, each level containing at least one node, each node having at least one entry;

storing virtual-memory translations for an address of a lower-level node in each intermediate and root node;

traversing the levels of the hierarchical data structure, starting from a root node, accessing each lower-level node on a traversal path using a virtual-memory translation obtained from a next highest level node; and

storing the data entity in a lowest level node.

2. The method of claim 1 wherein the levels of the hierarchical data structure each correspond to a block of contiguous virtual-memory addresses and is associated with a base virtual-memory address.

3. The method of claim 2 wherein traversing the levels of the hierarchical data structure, starting from a root node, accessing each lower-level node using a virtual-memory translation obtained from a next highest level node further includes:

initializing a remaining data index to the index of the data entity;

initializing a current node index to 0;

initializing a current level to the root level;

at each level,

computing an entry index as an integer dividend of the remaining data index by a number of data values potentially referenced by the current node;

setting the remaining data index to a remainder of the integer division by which the entry index is computed;

computing a virtual-memory address of a relevant entry in a current node of the current level on the traversal path;

accessing the relevant entry to obtain a translation-cache entry;

setting the current node index to the node index of a node of a next lowest level on the traversal path; and

setting the current level to that of the next lowest level.

4. The method of claim 3 wherein computing a virtual-memory address of a relevant entry in the current node further comprises:

adding to the base virtual-memory address of the current level a size of the relevant entry multiplied by the entry index and a size of the current node multiplied by the current node index.

5. The method of claim 3 wherein accessing the relevant entry to obtain a translation-cache entry further includes, for intermediate levels, using a translation-cache entry obtained from a node on the traversal path at the next highest level and the computed virtual-memory address of the relevant entry to access the relevant entry without incurring a translation-cache miss.

6. The method of claim 3 wherein setting the current node index to the node index of a node of a next lowest level on the traversal path further comprises:

setting the current node index to the entry index added to the sum of the node index of the current node and the number of entries in the current node.

7. The method of claim 3 wherein setting the current level to that of the next lowest level further comprises decrementing the current level.

8. Computer instructions that implement the method of claim 1 stored in a computer readable format on a computer readable medium.

9. Data stored according to the method of claim 1 in electronic memory of one or more computer systems.

10. A method for transforming a hierarchical data structure that includes virtual-memory addresses in a root node and in intermediate level nodes into a computationally efficient hierarchical data structure, the method comprising:

arranging nodes of each level within contiguous blocks of virtual memory having base addresses, so that a position of a node within a level can be calculated as the base address for the level added to a node size for the level multiplied by an index for the node within the level;

replacing the virtual-memory addresses within the root node and intermediate-level nodes with translation cache entries corresponding to the virtual-memory addresses; and

when traversing the levels of the computationally efficient hierarchical data structure, starting from a root node, accessing each lower-level node on a traversal path using a virtual-memory translation obtained from a next highest level node.

11. The method of claim 10 wherein traversing the levels of the computationally efficient hierarchical data structure, starting from a root node, accessing each lower-level node using a virtual-memory translation obtained from a next highest level node further includes:

initializing a remaining data index to the index of the data entity;

initializing a current node index to 0;

initializing a current level to the root level;

at each level,

computing an entry index as an integer dividend of the remaining data index by a number of data values potentially referenced by the current node;

setting the remaining data index to a remainder of the integer division by which the entry index is computed;

computing a virtual-memory address of a relevant entry in a current node of the current level on the traversal path;

accessing the relevant entry to obtain a translation-cache entry;

setting the current node index to the node index of a node of a next lowest level on the traversal path; and

setting the current level to that of the next lowest level.

12. The method of claim 11 wherein computing a virtual-memory address of a relevant entry in the current node further comprises:

adding to the base virtual-memory address of the current level a size of the relevant entry multiplied by the entry index and a size of the current node multiplied by the current node index.

13. The method of claim 11 wherein accessing the relevant entry to obtain a translation-cache entry further includes, for intermediate levels, using a translation-cache entry obtained from a node on the traversal path at the next highest level and the computed virtual-memory address of the relevant entry to access the relevant entry without incurring a translation-cache miss.

14. The method of claim 11 wherein setting the current node index to the node index of a node of a next lowest level on the traversal path further comprises:

setting the current node index to the entry index added to the sum of the node index of the current node and the number of entries in the current node.

15. Computer instructions that implement the method of claim 10 stored in a computer readable format on a computer readable medium.

16. Data stored according to the method of claim 10 in electronic memory of one or more computer systems.

18. Computer instructions that implement the method of claim 10 stored in a computer readable format.

19. Data stored according to the method of claim 10 in electronic memory of one or more computer systems.

17. A method for storing data entities in a computer within a data structure having multiple levels of nodes, the method comprising:

allocating memory for a root node;

determining a number of levels for the data structure, including a root level, intermediate non-data-level levels, and a data level;

determining a number of entries for nodes of each level;

reserving contiguous virtual-memory blocks for intermediate levels; and

when storing a next data entity having a next data index,

setting a current node as the root node, a current level as a highest level of the data structure, and a remaining data index as the next data index,

while the current level is greater than a lowest, data level,

calculating a current entry index by an integer division of the remaining data index by a product of the number of entries for nodes of each level of the data structure below the current level,

setting the remaining data index to a remainder of the integer division,

accessing an entry in the current node indexed by the current entry index to obtain a virtual-memory translation,

when the virtual-memory translation has a distinguished value,

allocating a new node for the next lowest level from the corresponding contiguous virtual-memory block for the next lowest level, and

placing a virtual-memory translation for the new node into the entry in the current node indexed by the current entry index, and

updating the current node to the node of a next lowest level node having a node index obtained by setting the current node index to the current entry index added to the sum of the node index of the current node and the number of entries in the current node, and

setting the current level to a next lowest level of the data structure;

storing the data value in an entry in the current node indexed by the remaining data index.

20. A system for storing and retrieving data comprising:

a computer system having a virtual memory;

a number of reserved blocks of contiguous virtual memory, each reserved block corresponding to a level, including a highest, root level, one or more intermediate levels, and a lowest, data level;

a computationally efficient hierarchical data structure that includes at least one node in each reserved block corresponding to each level, each node in a level higher than the data level containing translation-cache entries corresponding to the virtual addresses of nodes in the next lowest level, and each node in the lowest level containing data; and

computer routines for traversing the computationally efficient hierarchical data structure to locate an entry in a data-level node corresponding to a data value with a specified index.

21. The system of claim 20 wherein the computer routines traverse the levels of the computationally efficient hierarchical data structure, starting from a root node, accessing each lower-level node using a virtual-memory translation obtained from a next highest level node by:

initializing a remaining data index to the index of the data entity;

initializing a current node index to 0;

initializing a current level to the root level;

at each level,

computing an entry index as an integer dividend of the remaining data index by a number of data values potentially referenced by the current node;

setting the remaining data index to a remainder of the integer division by which the entry index is computed;

computing a virtual-memory address of a relevant entry in a current node of the current level on the traversal path;

accessing the relevant entry to obtain a translation-cache entry;

setting the current node index to the node index of a node of a next lowest level on the traversal path; and

setting the current level to that of the next lowest level.

22. The system of claim 21 wherein computing a virtual-memory address of a relevant entry in the current node further comprises:

adding to the base virtual-memory address of the current level a size of the relevant entry multiplied by the entry index and a size of the current node multiplied by the current node index.

23. The method of claim 21 wherein accessing the relevant entry to obtain a translation-cache entry further includes, for intermediate levels, using a translation-cache entry obtained from a node on the traversal path at the next highest level and the computed virtual-memory address of the relevant entry to access the relevant entry without incurring a translation-cache miss.

24. The method of claim 21 wherein setting the current node index to the node index of a node of a next lowest level on the traversal path further comprises:

setting the current node index to the entry index added to the sum of the node index of the current node and the number of entries in the current node.

25. The method of claim 21 wherein setting the current level to that of the next lowest level further comprises decrementing the current level.