Programming model for transparent parallelization of combinatorial optimization
US8417689B1 · kind B1 · utility
8Cited by
9References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Nov 21, 2011 |
| Grant date | Apr 9, 2013 |
| Priority date | — |
| Expiry date | Nov 21, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24542
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Each of a plurality of subtasks is configured to explore and assess alternative solutions for a combinatorial optimization problem by a reentrant finite state machine is represented. Each of a plurality of threads is configured to perform operations comprising a subtask until either completion or a blocked state is reached and, in the event a blocked state is reached, to move on to performing another subtask that is not currently in a blocked state.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.