Parallel dynamic programming through rank convergence
US9195436B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 21, 2014 |
| Grant date | Nov 24, 2015 |
| Priority date | — |
| Expiry date | Apr 21, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/6561
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The techniques and/or systems described herein implement parallel processing of a dynamic programming problem across stages and/or clusters by breaking dependencies between stages and/or clusters. For instance, the techniques and/or systems may identify dependencies between sub-problems of the dynamic programming problem and group the sub-problems into stages. The techniques and/or systems may also group the stages into clusters (e.g., at least two clusters to be parallel processed). Then, the techniques and/or systems generate one or more solutions to use instead of actual solutions so that the dynamic programming problem can be parallel processed across stages and/or clusters.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.