Extendable memory work-stealing
US7363438B1 · kind B1 · utility
3Cited by
2References
19Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 5, 2004 |
| Grant date | Apr 22, 2008 |
| Priority date | — |
| Expiry date | Nov 21, 2025 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/52
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A deque of a local process in a memory work-stealing implementation may use one or more data structures to perform work. If the local process attempts to add a new value to its deque's data structure when the data structure is full (i.e., an overflow condition occurs), the contents of the data structure are copied to a larger allocated data structure (e.g., an array of greater size than an original array). The entries in the original, smaller-sized data structure are copied to exact positions in the now-active, larger-sized data structure. By this technique, the local process is thus provided with space to add the new value.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.