Memory management during processing of binary decision diagrams in a computer system
US6247108A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Jun 3, 1998 |
| Grant date | Jun 12, 2001 |
| Priority date | — |
| Expiry date | Jun 3, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99933
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for improved memory management during the processing of binary decision diagrams in a computer system. Prior to creating a new node in memory, a find operation is performed to determine if that node already exists in memory. A hash key is computed for the new node and a hash table is accessed to retrieve a pointer to a linked list of nodes which are potential matches for the new node. The linked list is in increasing order of the chronological age of the nodes. The nodes are sequentially retrieved from main memory in the order of the linked list. The retrieval is terminated at the last linked node which was created subsequent to the child nodes of the new node.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.