Data splitting for recursive data structures
US9110684B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 10, 2007 |
| Grant date | Aug 18, 2015 |
| Priority date | — |
| Expiry date | Oct 5, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/285
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Embodiments of the present invention provide a method, system and computer program product for the data splitting of recursive data structures. In one embodiment of the invention, a method for data splitting recursive data structures can be provided. The method can include identifying data objects of a recursive data structure type, such as a linked list, within source code, the recursive data structure type defining multiple different data fields. The method further can include grouping the data objects into some memory pool units, each of which can contain the same number of data objects. Each memory pool unit can be seen as an array of data objects. The method can include data splitting, which could be maximal array splitting in each different memory pool unit. Finally, the method can include three different approaches, including field padding, field padding and field splitting, to handle irregular field sizes in the data structure.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.