Seamless high performance interoperability between different type graphs that share a garbage collector
US10120655B2 · kind B2 · utility
1Cited by
5References
18Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 3, 2016 |
| Grant date | Nov 6, 2018 |
| Priority date | — |
| Expiry date | Jul 7, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2212/1044
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Multiple different type hierarchies can communicate in a high performance and seamless manner by sharing a GC and interface dispatch logic. A runtime environment can support multiple independent type hierarchies, each type hierarchy defined by the module which defines the root of a type graph and some other helper functionality. Code that uses the dispatch logic has to follow certain rules in order to maintain GC and type safety. Different types in disjoint type graphs can behave as if they were one type for cross type graph communication purposes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.