Terms ending in 2039
Every in-force patent on Graphcore Limited's record whose computed term ends in 2039, whoever holds it now. Soonest term end first, then patent number.
| Patent | Title | Holder | Status | Expires | Confidence |
|---|---|---|---|---|---|
| US 10,691,432 | Compilation Method In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 10,705,998 | Exchange of Data Between Processor Modules In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 10,705,999 | Exchange of Data Between Processor Modules In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 10,949,266 | Synchronization and Exchange of Data Between Processors In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 10,963,315 | Synchronization and Exchange of Data Between Processors In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 11,366,649 | Compilation Method In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 10,922,063 | Code Compilation for Scaling Accelerators In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 12,141,092 | Instruction Set In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 11,061,679 | Double-Load Instruction Using a Fixed Stride and a Variable Stride for Updating Addresses Between Successive Instructions In force · High confidence | Graphcore Limited | In force | High confidence | |
| US 11,176,066 | Scheduling Messages In force · High confidence | Graphcore Limited | In force | High confidence | |
| 32 more term ends in 2039 · Pro | |||||
10 of 42 patents shown. Soonest term end first, then patent number.
Pro members see all 42.
Updated Nov 15, 2026 · includes USPTO assignment & status data published Nov 15, 2026 and grant & fee data published Nov 10, 2026 (weekly) · how we know
Computed patent terms end on the dates shown. Related patents and pending applications may cover overlapping subject matter.