135 results about "Topological sorting" patented technology

The invention relates to a method for converting ladder diagram language into structure text language, which comprises the following steps of: storing the ladder diagram language into a storage structure beneficial to edition and conversion, and introducing virtual nodes at intersection points between vertical lines and other ladder diagram symbols which refer to real nodes; merging the virtual nodes to form an AOV (Amplitude Versus Offset) diagram; and converting the AOV diagram into a structure text by classifying different types of nodes according to the node sequence of the AOV diagram intopological sorting. The method has generality and can be used for accurately and effectively convert any complex ladder diagram into a structure text. Visual ladder diagram programming is realized in places where only structure text programming can be used formerly, so that user use is convenient, the threshold of PLC (Programmable Logic Controller) programming is reduced, and the programming efficiency of PLC is increased.

The disclosed embodiments included a system, apparatus, method, and computer program product for performing a topological sort of a directed graph that comprises a cyclic component or subcomponent. The apparatus comprises a processor configured to execute computer-readable program code embodied on a computer program product. And executing the computer-readable program code comprises identifying a plurality of vertices in a directed graph that depend upon each other in a cyclic manner and removing those vertices and all of the vertices in the same component from a topology object. The topology object then may be utilized to sort the acyclic components and/or subcomponents of the directed graph based the dependencies between the remaining vertices.

The invention relates to a spacecraft resource constraint processing method based on time topological sorting and belongs to the technical field of autonomous control on spacecraft. The method comprises steps as follows: firstly, performing topological sorting on actions in planning results according to execution time of the actions; then layering the actions in a resource constraint network according to changes of resource numbers by the actions, and processing each resource mutation to improve the resource number computing efficiency. The method is particularly applicable to resource management in autonomous planning of spacecraft tasks in deep-space exploration. According to the method, the resource constraint network is adopted to describe resource information in planning, the changes of the resource numbers when a spacecraft executes the actions along with time are acquired through analysis of changes of apexes and edges in the network, advantages of an augmenting path method and a pre-flow push method for the maximum flow problem are combined, topological sorting is performed on resource mutations according to execution time, and the resource number computing process is optimized; resource constraint in the planning results can be effectively processed, and the computing efficiency is significantly improved.

The invention discloses a workflow system resource scheduling method in a cloud computing environment, aiming to schedule a plurality of tasks in a workflow. The workflow system resource scheduling method includes the following steps: S1, grouping all the tasks in the workflow; S2, distributing the latest finish time of the workflow to each task group, and calculating the latest finish time of each task group; S3, performing topological sorting on all the task groups; S4, sequentially operating the task groups from high to low according to topological sorting values, and arranging each task in a cloud service virtual machine and in a period both with lowest cost. The workflow system resource scheduling method has the advantages that an optimal solution of a serial portion of the workflow can be obtained by a dynamic programming algorithm; as compared with an average-price based algorithm, the dynamic programming algorithm has the advantages that tasks can be reasonably arranged to periods and cloud service virtual machines both with low cost, so that overall price is low.

A method, computer program product, and computer system for generating a timing sequence for activating resources linked through time dependency relationships. A Direct Acyclic Graph (DAG) includes nodes and directed edges. Each node represents a unique resource and is a predefined Recovery Time Objective (RTO) node or an undefined RTO node. Each directed edge directly connects two nodes and represents a time delay between the two nodes. The nodes are topologically sorted to order the nodes in a dependency sequence of ordered nodes. A corrected RTO is computed for each ordered node after which an estimated RTO is calculated as a calculated RTO for each remaining undefined RTO node. The ordered nodes in the dependency sequence are reordered according to an ascending order of the corrected RTO of the ordered nodes to form a timing sequence for activating the unique resources represented by the multiple nodes.

The invention relates to a method for converting a ladder diagram into a PLC (Programmable Logic Controller) program command, which comprises the following steps of: 1, presenting a topological structure of a ladder diagram by using a directed graph; 2, traversing a transposed graph GL <T> by using a depth-first search method, storing a topological sorting relation of parallel-connection peaks and coil peaks in a queue Q; 3, carrying out breadth-first search on the parallel-connection peaks according to a connection relation of the directed graph GL, carrying out depth-first search on serial-connection peaks adjacently connected with the parallel-connection peaks, generating an AND expression of the directed graph GL on the whole serial-connection path and an OR expression of the serial-connection peaks; 4, generating a final expression of the maximum combining item of the parallel-connection peaks; 5, carrying out breadth-first search on a connection relation graph Gp by using the Q,figuring out an OR expression of the corresponding parallel-connection peaks and verifying, finally, constructing the maximum combining item into the AND expression to form a final result; 6, judgingwhether a queue Q' is empty; and 7, processing a starting peak. The invention can be widely applied to the process of converting the ladder diagram into the PLC program command.

The invention provides a deep learning-oriented data processing method for GPU parallel computing. The method comprises the following steps: firstly, inputting data to model a calculation graph: (1) constructing operation rules of vertexes and edges of a directed graph; (2) defining an execution sequence of operations in the graph by using topological sorting; and (3) updating parameters through the training model, introducing a tensor life cycle, and rewriting a calculation graph based on data operation cost to obtain an optimal operation strategy, mainly comprising the following steps: firstly, modeling the calculation graph based on cost, and redefining an operation function on a CPU; fusing the swap-out operations with the same tensor into a single swap-out operation; and finally, obtaining a traversal sequence by applying a tensor replacement strategy based on calculation and transmission cost. Therefore, the computational graph modeling method based on the formalization rule is constructed. Finally, the extensible neural network and the calculation graph are combined, the training speed of the model can be increased, and the image processing effect is effectively improved.

A distributed transaction network for processing and verifying transactions asynchronously between transaction parties comprising a transferor and a transferee, the transferor having an obligation to transfer control of assets to the transferee. Each transaction party is randomly assigned a verifier upon it joining the network, which verifies the transaction of its transaction party by ensuring the asset of the transferor satisfies the transaction obligation and no fork condition exists. The transaction is executed only upon every verifier verifying and signing the transaction. The distributed transaction network further has a directed acyclic transaction map comprising topologically sorted transactions forming a single transaction path of sequentially executed transactions for each transaction party, to prevent the occurrence of race conditions, double spend, or fork conditions. The transaction network further comprises a global consensus mechanism to detect and replace failing verifiers and reverse invalid transactions which were improperly signed by the failing verifiers.

A high parallelism computing system and instruction scheduling method thereof are disclosed. The computing system comprises: an instruction reading and distribution module for reading a plurality of types of instructions in a specific order, and distributing the acquired instructions to corresponding function modules according to the types; an internal buffer for buffering data and instructions for performing computation; a plurality of function modules each of which sequentially executes instructions of the present type distributed by the instruction reading and distribution module and reads the data from the internal buffer; and wherein the specific order is obtained by topologically sorting the instructions according to a directed acyclic graph consisting of the types and dependency relationships. By reading the instructions based on the topological sorting the directed acyclic graph constructed according to the types and dependency relationships, the deadlock caused by the instruction dependencies can be avoided by a relatively simple operation.

The invention discloses an integrated circuit static time sequence analysis method for GPU accelerated calculation. The method comprises the steps that: RC time delay is calculated and delayed updating is performed; input circuit information is expressed as a circuit structure diagram, flattening is conducted on the circuit structure diagram, the edge relation in the circuit structure diagram is expressed as a father node pointer or a compression adjacency list, a dynamic planning and topological sorting algorithm on the circuit structure diagram is designed, and a GPU algorithm for static timing sequence analysis of an integrated circuit is designed; and the GPU algorithm conforms to a single-instruction multi-thread architecture, so that the time of CPU-GPU computing tasks is merged. Byadopting the technical scheme provided by the invention, the static time sequence analysis cost of the integrated circuit can be reduced, and the performance of a time sequence driven chip design automation algorithm is further improved.

The invention discloses a dependency relationship task scheduling method in combination with function on-demand configuration in edge computing, which comprises the following steps: step 1, acquiringrelevant parameters of a network and a task, and selecting an initialized edge server; step 2, performing greedy initial configuration on the edge server by using the related parameters in the step 1to obtain server configuration information; step 3, expressing the tasks with the dependency relationship in the step 1 by using a directed acyclic graph, and performing topological sorting on the tasks in the directed acyclic graph to form a topological sequence; step 4, iterating the topological sequence in the step 3 by using the server configuration information in the step 2, and calculating the earliest finishing time of each task running on each edge server to obtain a task distribution and scheduling scheme; and step 5, under the constraint of the actual capacity of the edge server, allocating and scheduling each task according to the allocation and scheduling scheme of the task in the step 4. The method can minimize the completion time of an application consisting of a plurality ofdependent tasks in an edge computing environment.

The invention provides a method for arranging an operational project sequence, which comprises the following steps of: determining mutual dependency relationship among a plurality of operational projects in a project and obtaining an oriented graph according to the dependency relationship; determining whether the oriented graph is an oriented acyclic graph or not, and if so, using a topological sorting method for carrying topological sorting to the oriented acyclic graph; and arranging a sequence among a plurality of operational projects after the topological sorting into a sequence among a plurality of operational projects in the project. The invention also provides a device for arranging the operational project sequence. According to the method and the device for arranging the operational project sequence, the problem of miscalculation which is further caused by closed-loop logical relationship in a plurality of operational projects during the process of system setting can be effectively avoided; and by adopting the method, the invention can obtain the operational project sequence correctly.

The invention provides a different structure converting method from an AOE (Activity On Edge) network to a multi-way tree structure, and aims to provide a multidimensional MBOM (Manufacturing Bill of Material) converting method based on the AOE network, which is simple and visible and occupies fewer system resources. The different structure converting method is realized through the technical scheme including the following steps: constructing an MBOM; conducting topological sorting on each node in the AOE network chart adopting the topological sorting algorithm; reading all nodes adopting the FIFO (First-In First-Out) algorithm by a data register; recording the nodes as PP (Process Plan) and performing one-way acyclic graph topological sorting; and then, performing recursion and traversing on all paths of each node through an MBOM conversion adapter adopting the DFS (Depth-First Search) algorithm; calculating the sum of the weights of all sides of each path; obtaining the path with the maximum weight sum and storing the path in the database; taking the path with the maximum weight sum as the critical path and the main path; inverting sequential relationship of all paths to generate an MBOM multi-way tree structure; reading the nodes layer-by-layer from top to bottom; writing the father node into a relational database table.

The invention belongs to the field of public safety, particularly relates to a novel network anti-fraud active inspection and early warning system, and aims to solve the problem of poor prevention robustness of a network and telephone fraud prevention technology. The system comprises: an automatic inspection module configured to construct a fraudulent clue clustering space; an online discrimination module which is configured to obtain the total probability association distribution of the first information of the theme leader and the affiliated member in the suspicious fraud clue through topological sorting and conditional distribution sampling; a credibility evaluation module which is configured to evaluate the suspicious fraud clues through a hierarchical label-free network comprehensiveevaluation method; and an active early warning module which is configured to actively push the suspicious fraud clue of which the weight is greater than a set early warning threshold to a mobile phoneor a case checking system of anti-fraud department personnel, and start electronic supervision for checking the suspicious fraud clue in a limited period. According to the invention, through activelycapturing the network and telephone fraud interaction structure and locking the fraud clue, the robustness of preventing the network and telephone fraud is improved.

The invention provides a high-parallelism computing system and an instruction scheduling method thereof. The computing system comprises an instruction reading and distributing module used for readinga plurality of types of instructions according to a specific sequence and distributing the obtained instructions to corresponding function modules according to the types; an internal cache which is used for caching data and instructions required for executing calculation; a plurality of functional modules which are used for sequentially executing the instructions of the category distributed by theinstruction reading and distributing module and reading required data from the internal cache, wherein the specific sequence is obtained by carrying out topological sorting on the instructions according to a directed acyclic graph formed by categories and dependency relationships. Therefore, the directed acyclic graph constructed according to the instruction category and the dependency relationship is subjected to topological sorting to perform value taking, and deadlock caused by instruction dependency can be avoided through relatively simple operation. Preferably, the sorting can be realized in an instruction compiling stage, so that the resource consumption of the computing system is further reduced.

The invention discloses a logic network topology sorting and storing method for a fault diagnosing system, which comprises the following steps: 1) performing topology sorting on a complicated topology structure which represents a logic relationship, wherein a complicated fault diagnosing logic which accords with an IEC61131-3 standard and is represented by a functional block principle chart fbd is a directed cyclic structure that comprises a directed tree-shaped structure and multiple feedback rings; 2) respectively establishing two kinds of tables in a database, namely a function block information table and a fault tree logic relationship table, wherein the function block information table describes the detailed attribute and executing information of each function block, the fault tree logic relationship table describes connecting relationship among the function blocks and sorting grade of the function block, and the tables are correlated through key words; and 3) according to the content of relationship tables of the function block in the database, directly generating a fbd chart which accords with an IEC61131-3 standard. The logic network topology sorting and storing method can reduce cost of a fault diagnosing system and realizes flexible configuration and reliable operation of the system.

The invention provides a module control method of a centralized distribution and transportation system. The module control method can be applied to the centralized distribution and transportation system. With increase of scale and complexity of the centralized distribution and transportation system, the dependency and execution sequence of modules become quite complex. According to the method, a topological sorting method is adopted to display all the modules on one horizontal line. The method comprises the following steps: information of module interfaces in the centralized distribution and transportation system is sorted and processed; a directed acyclic graph of the modules is obtained according to the module relations in the centralized distribution and transportation system; the formed directed acyclic graph of the modules is subjected to topological sorting according to a topological sorting algorithm; module execution requires certain sequence, and the execution sequence of the modules is controlled through topological sorting. The topological sorting method is adopted to sort all the modules in the centralized distribution and transportation system, the execution sequence of the modules is managed through topological sorting, that is, the sequence of execution events is determined, and centralized distribution is executed smoothly.

The invention discloses a task processing method and a task processing device. The task processing method comprises the following steps: establishing a task sequence diagram by utilizing a constraintrelationship among a plurality of tasks; performing topological sorting on theplurality of tasks in the task sequence diagram, and determining concurrently executed tasks; and executing the pluralityof tasks according to a sorting result. According to the task processing method and device provided by the embodiment of the invention, the task sequence diagram is established according to the execution sequence of the plurality of tasks, the plurality of tasks in the task sequence diagram are subjected to topological sorting, the task topological diagram is generated, and the plurality of tasksare executed according to the task topological diagram. When the tasks are executed according to the task topological graph, the tasks without the causal relationship can be executed in parallel, thewaiting time for executing the serial tasks is shortened, and the overall task execution efficiency is improved.

The invention provides a fault positioning method and system based on distribution network partitioning equivalence. The fault positioning method based on a distribution network partitioning equivalence comprises the following steps that: utilizing a topological sorting method to determine the longest access of a power distribution network, and dividing the power distribution network into a plurality of sub-regions under a situation that partitioning PMU (Power Management) configuration requirements and scale requirements are met; traversing all nodes of each sub-region, selecting a voltage deviation minimum value as a fault circuit end point, judging that the sub-region to which the fault circuit end point belongs as a fault region, judging that the sub-region without the fault circuit end point as a non-fault region, and adopting equivalent impedance to carry out non-fault region equivalence; and selecting a related branch of a node with the minimum voltage deviation, and carrying out method-of-bisection searching to determine the accurate position of the fault point. By use of the method, a search range is reduced, and the fault positioning accuracy and efficiency of the power distribution network is improved.

Techniques and systems for optimizing a logic network are described. Some embodiments automatically identify scenarios where Boolean methods are best driven by truth tables, binary decision diagrams (BDDs) or satisfiability (SAT). Some embodiments use circuit partitioning techniques that are based on hash-tables and topological sorting, and that are capable of grouping nodes with high simplification likelihood and still are able to efficiently scale to large circuits. Some embodiments feature a generalized resubstitution framework based on computing, and implementing, the Boolean difference between two nodes. Some embodiments include enhancements to (i) gradient-based and-inverter-graph (AIG) optimization, (ii) heterogeneous elimination for kerneling, and (iii) revisitation of maximum set of permissible functions (MSPF) computation with BDDs.

The invention provides a service combination instance migration effectiveness judgment method based on an executed path dynamic dependency graph. A service combination before and after an evolution, and an executed path of an instance to be migrated act as input, and migration effectiveness judgment results act as output. Realization of the method comprises the following steps: dependency relationship among activities in the executed path of the instance to be migrated is analyzed, a dynamic dependency graph of the executed path is generated and a set of all reachable variable definitions reaching the end of the executed path is obtained; the dynamic dependency graph is reduced via a backward dynamic slicing method; a control flow graph of the service combination after the evolution is obtained; whether a topological ordering, which is an activity sequence of the service combination after the evolution, exists is judged on the basis of the control flow graph of the service combination after the evolution and the dynamic dependency graph after reduction, and if the topological ordering exists, migration effectiveness is met; or the migration effectiveness is not met. A false negative probably generated by utilizing a conventional method can be avoided by utilizing the method so that the dynamic evolution of the service combination is better supported.

The embodiment of the invention discloses a task scheduling method and device, a server and a storage medium, and the method comprises the steps of calling a scheduler to carry out the topological sorting of a pre-constructed directed acyclic graph running chart, so as to determine a to-be-executed task node from at least one task node included in the directed acyclic graph running chart; and if the to-be-executed task node is not the termination node, executing a service sub-process in a target service corresponding to the to-be-executed task node by calling a processing interface, and when aservice sub-process execution result returned by the processing interface is received, triggering the scheduler to execute topological sorting on a pre-constructed directed acyclic graph running chart, and determining a to-be-executed task node from at least one task node included in the directed acyclic graph running chart. By adopting the embodiment of the invention, the utilization rate of resources can be improved, the execution relationship among the service sub-processes can be intuitively known, and the maintenance cost of task scheduling is favorably reduced.

The invention relates to a cross-cluster task execution method and device, computer equipment and a storage medium. The method comprises the steps of obtaining a dependency relationship between tasksin at least two clusters and the starting time of a bottommost sub-level task, and performing topological sorting on the dependency relationship between the tasks to obtain dependency relationship structure data; triggering the bottommost child-level task according to the starting time, and checking a parent-level task execution state corresponding to the bottommost child-level task according to the dependency relationship structure data; after all parent-level tasks are successfully executed, submitting child-level tasks in advance; checking an execution state of a task on which a pre-submitted sub-level task depends by utilizing a local scheduling service and a remote scheduling service; and after the local parent-level task and/or the remote parent-level task are/is successfully executed, submitting the current child-level task to be executed. By adopting the method, whether the associated task is executed or not can be accurately estimated, execution errors of cross-cluster tasks are reduced, and the resource utilization rate is increased.