Future scheduling by direct representation of possible dependencies
US8225326B2 · kind B2 · utility
2Cited by
12References
25Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Mar 17, 2008 |
| Grant date | Jul 17, 2012 |
| Priority date | — |
| Expiry date | Mar 25, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/524
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for evaluating objects in a data structure is provided. The method includes assigning one or more objects to one or more nodes in a data structure having at least a root node, in which the objects are assigned to the nodes in accordance with a first order to maintain pre-existing dependencies between the objects and to allow the objects to be evaluated in a serial manner to avoid deadlock when concurrently executing threads to evaluate the objects, and selecting a first object for evaluation, in response to determining that the current object is unevaluated.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.