FIELD: computer engineering, in particular, search of critical paths and their weights in directed acyclic graph. SUBSTANCE: critical paths are searched by means of addition of non-zero weights of arcs and subsequent removal of non-extreme values, so calculations conform to conditions $$$ or $$$, where $$$ is weight of k-m arc, $$$ is minimal or maximal weight of K-th node. Unit which generates critical paths provides tree of critical paths. When net tasks are to be solved, minimal total weight of each node is treated as earliest moment of corresponding event. EFFECT: increased speed in search of critical paths and weights of critical paths in directed acyclic graph, increased functional capabilities due to possibility to search minimal and maximal paths. 8 dwg
Title | Year | Author | Number |
---|---|---|---|
GRAPH PROBLEM SOLVER | 0 |
|
SU1658171A1 |
DEVICE FOR SOLVING PROBLEMS ON GRAPHS | 0 |
|
SU1765833A1 |
GRAPH-BASED PROBLEMS SOLVER | 0 |
|
SU1683037A1 |
DEVICE FOR SOLVING PROBLEMS ON GRAPHS | 0 |
|
SU1596344A1 |
DEVICE FOR GENERATING SUB-OPTIMAL DISPOSITION AND ITS ASSESSMENT | 2001 |
|
RU2193796C2 |
APPARATUS FOR ANALYSING CHANNEL OVERLAPPING WHEN DEPLOYING PARALLEL SUBPROGRAMS IN MULTIPROCESSOR SYSTEMS | 2011 |
|
RU2460126C1 |
DEVICE FOR SOLVING PROBLEMS USING GRAPHS | 0 |
|
SU1837311A1 |
DEVICE TO SEARCH LOWER LOCATION SCORE IN MATRIX SYSTEMS DURING BIDIRECTIONAL INFORMATION TRANSFER | 2009 |
|
RU2447485C2 |
DEVICE FOR SEARCHING FOR A LOWER ESTIMATE OF PLACEMENT IN HYBRID MULTIPROCESSOR SYSTEMS WITH DIRECTIONAL INFORMATION TRANSMISSION | 2021 |
|
RU2769967C1 |
APPARATUS FOR ESTIMATING LOADING EFFICIENCY IN SYSTEMS WITH TREE-LIKE TOPOLOGY DURING DIRECTED INFORMATION TRANSMISSION | 2011 |
|
RU2451334C1 |
Authors
Dates
1997-12-27—Published
1996-09-24—Filed