Back to results
US 2006/0136468 A1Published application
Fast tree-based generation of a dependence graph
AssigneeIntel Corporation
InventorArch Robison
Life of this patent
Estimating the term…
Abstract
A dependence graph having a linear number of edges and one or more tie vertices is generated by constructing a tree of nodes, receiving requests to create cut and/or fan vertices corresponding to each node, adjusting a frontier of nodes up or down, and creating one or more cut or fan vertices, zero or more tie vertices, and at least one predecessor edge.
Claims20
A method comprising:
- constructing a tree having a plurality of nodes;
- receiving a request to create a vertex corresponding to a node within the plurality of nodes;
- adjusting a frontier;
- and
- creating the vertex and at least one predecessor edge.
2 more elements
A method comprising:
- constructing a tree having a plurality of nodes;
- and
- scheduling instructions based on relative positions of the plurality of nodes within the tree and based on a series of requests.
A system comprising:
- a processor;
- memory coupled to the processor to store data, the data comprising instructions to be scheduled;
- and
- an instruction scheduler to schedule the instructions based on relative positions of a plurality of nodes within a hierarchical tree and based on a series of requests.
1 more element
An article of manufacture comprising a machine-accessible medium having stored thereon instructions which, when executed by a machine, cause the machine to:
- construct a tree having a plurality of nodes;
- receive a request to create a vertex corresponding to a node within the plurality of nodes;
- adjust a frontier;
- and
- create the vertex and at least one predecessor edge.
2 more elements
Dependencies are inferred from the claim text.