Patent ID: 9495218
Filing Date: 2016-11-15
CPC Classification: G06F,H04L

Claim Text:
1. A method for parallel processing a network of nodes having at least one ordering constraint and at least one conflict constraint having a coupling between a pair of nets, the method comprising: determining the at least one ordering constraint by mapping at least one input connection and at least one output connection to each node within the network of nodes, wherein the at least one ordering constraint indicates that the input to a node must be processed before the output from the node; breaking a plurality of loops caused by the at least one ordering constraint using a loop cutting algorithm; determining a node order based on the at least one ordering constraint, wherein the node order comprises determining a conflict order based on the at least one conflict constraint, wherein no new loops are created in the network, and wherein the conflict order comprises determining an estimated processing cost for an endpoint node associated with the at least one conflict constraint, and wherein the estimated processing cost comprises an apportioned processing cost of a plurality of downstream nodes that are downstream of the endpoint node; and performing parallel processing of the network of nodes based on the node order and the conflict order using multi-threaded dynamic scheduling, wherein the parallel processing includes noise analysis of an electronic network.