Dynamic reduction of stack-overflow errors in a recursive data-serialization algorithm
US10114573B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 26, 2017 |
| Grant date | Oct 30, 2018 |
| Priority date | — |
| Expiry date | Apr 26, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F3/0659
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A data-serialization system initially uses a recursive serialization algorithm to serialize a hierarchy of nested data objects by translating those objects into a serial stream of data. The system determines that a stack-overflow error is likely to occur whenever the number of objects serialized by the system exceeds a threshold value, or whenever the stack has reached an unacceptable level of utilization. When the system determines that a stack-overflow error is likely or if the system detects that a stack-overflow error will definitely occur if another object is serialized, the system either transfers control to a nonrecursive algorithm that does not require a stack data structure or reduces stack utilization by transferring contents of the stack to a variable-size queue-like data structure.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.