Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
138 results about "Topological sorting" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may represent tasks to be performed, and the edges may represent constraints that one task must be performed before another; in this application, a topological ordering is just a valid sequence for the tasks. A topological ordering is possible if and only if the graph has no directed cycles, that is, if it is a directed acyclic graph (DAG). Any DAG has at least one topological ordering, and algorithms are known for constructing a topological ordering of any DAG in linear time.
Operating system auto-update procedure
InactiveUS20110173601A1Version controlSpecific program execution arrangementsOperating systemOperational system
The present invention pertains to differential updating of an operating system in a client device. A delta update file includes an ordered list of operations to be performed on the new install partition in memory that will port from the old install partition. A binary differential compression algorithm may be used to determine differences for the update and to compress the data being transmitted to the client device. Blocks in the partition may cyclically depend from one another. Edges are cut to break cycles. During system operation, disk images are scanned. File operations are created and a blocks vector is developed. A graph is created where the edge weights are set equal to the number of blocks. Given this, cycles are then broken and a final order resulting from a topological sort is produced.
Owner:GOOGLE LLC
Method for converting ladder diagram language into structure text language
ActiveCN101957745AAccurate conversionValid conversionSpecific program execution arrangementsProgramming languageProgrammable logic controller
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.
Owner:SHENYANG GOLDING NC & INTELLIGENCE TECH CO LTD
Topological sorting of cyclic directed graphs
InactiveUS9171102B1Digital data information retrievalSpecial data processing applicationsTheoretical computer scienceTopological sorting
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.
Owner:CA TECH INC
Internet-based design method of artistic picture splicing system
InactiveCN102194241AGuaranteed identifiabilitySmooth transition2D-image generationSystems designNew energy
The invention provides an Internet-based design method of an artistic picture splicing system. The method refers to the content-based image retrieving technology in the image retrieving field and the image-synthesis-related method in the computer graphics, and according to input images, a plurality of images searched from the Internet are spliced into an artistic spliced image. Different from theconventional content-based image retrieving method, the method has the advantages that a brand-new energy function for retrieving based on shape and color is provided; a relatively ideal retrieving result is obtained; when the hierarchical relationship between subblocks is determined, three important clews used for judging the hierarchical relationship between the neighboring subblocks are provided and the topological sorting is introduced so as to generalize all local hierarchical relationships effectively to obtain an ideal general hierarchical relationship; and according to the input images, an artistic spliced image is obtained and the method is a brand-new attempt in the fields of recreation and art.
Owner:XI AN JIAOTONG UNIV
Spacecraft resource constraint processing method based on time topological sorting
InactiveCN104573856AEfficient use ofImprove computing efficiencyResource allocationForecastingTopological sortingResource constraints
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.
Owner:BEIJING INSTITUTE OF TECHNOLOGYGY
Workflow system resource scheduling method in cloud computing environment
ActiveCN103473122AMeet price requirementsLow priceResource allocationTopological sortingDynamic programming
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.
Owner:江阴逐日信息科技有限公司
Method and system for managing resources
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.
Owner:KYNDRYL INC
Visualization graph procedure topology sorting method
ActiveCN103207903AImprove efficiencyImprove hit rateSpecial data processing applicationsGraphicsData stream
The invention discloses a visualization graph procedure topology sorting method. The visualization graph procedure topology sorting method includes: sorting symbols in ascending order according to transverse x coordinates firstly and sorting symbols which has the same x coordinates in ascending order according to vertical y coordinates so as to form a preliminary sequence; designing a destruction symbol in a loop-locked graph network, and setting an input point of a succeeding symbol, which is connected with an output point of a loop-locked symbol, to be known; performing topology sorting according to depth-first and a data flow dependency relationship, and defining a topology sorting push rule; and preferentially judging whether status of a succeeding symbol which follows the symbol is known according to the data flow dependency relationship of the input and the output points, and sorting symbols with the data flow dependency relationship according to branch ergodic. The visualization graph procedure topology sorting method can reduce manual intervention processes, solve closed loop deadlock dependence, form an execution branch according to the data flow dependency relationship, and improve procedure operating efficiency.
Owner:NR ELECTRIC CO LTD +1
Method for converting ladder diagram into PLC (Programmable Logic Controller) program command
InactiveCN102354144AQuick searchAnalyzing the time complexity of the job is easyProgramme control in sequence/logic controllersRelation graphDepth-first search
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.
Owner:BEIJING UNION UNIVERSITY
Deep learning-oriented data processing method for GPU parallel computing
InactiveCN110941494AIncrease training speedImprove adaptabilityResource allocationNeural learning methodsComputational scienceConcurrent computation
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.
Owner:HARBIN ENG UNIV
Automatic layout method for digraph created GMF graph editor
ActiveCN103500250ANo overlapOrderly rowsSpecial data processing applicationsGraphicsComputational science
The invention provides a layout method for a diagraph created GMF graph editor. The layout method includes the following steps that digraph data created by a GMF graph editor are analyzed to obtain graphics primitive information; a topological sorting method is used for processing all component graphics primitives in a layering mode; positions of connecting points in the diagraph are set; the position of each component graphics primitive is set; the size of each component graphics primitive is set; a Mikami-Tabuchi routing algorithm is used for performing layout on routes of ligatures between the graphics primitives, and when overlapping happens on the ligatures, a neighborhood ligature avoiding strategy is used for eliminating the overlapping. Compared with a built-in layout method of the GMF graph editor, the GMF graph editor created layout method for the diagraph has the advantages that the mutual overlapping phenomenon between the component graphics primitives can not happen; the graphics primitives in each layer of components are arrayed in order, and the appearance is clear; the ligatures between the graphics primitives can not pass through the component graphics primitives, and the mutual overlapping can not happen between the ligatures.
Owner:ZHEJIANG UNIV
Asynchronous directed acyclic map based distributed transaction network
ActiveUS20200073698A1Reduce stepsEasy to implementFinanceEncryption apparatus with shift registers/memoriesComputer networkTopological sorting
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.
Owner:WU ZHONGWEI
Visual natural language analysis mining system and modeling method thereof
ActiveCN111259064AEfficient Analysis and MiningEasy to trainNatural language analysisDatabase management systemsSorting algorithmData stream
The invention discloses a visual natural language analysis mining system and a modeling method thereof. The system comprises a visual algorithm component module, a background analysis module, a storage module, a result display module and a model retraining module. The modeling method comprises the steps that a pre-designed graphical algorithm assembly is selected and dragged to canvas to constructa specific natural language analysis mining process, the data flow direction between algorithms in the process is determined, a process description language is generated, and a request is sent to a background analysis module; the background analysis module performs logic analysis on the process DAG, and generates a calling sequence of the components by adopting a topological sorting algorithm; executing specific mining analysis logic according to the process description language; generating a structured analysis result by using a process technology, and storing the structured analysis resultby using a storage module; checking and auditing an analysis result; and performing optimization training on the audited data through a user algorithm model.
Owner:同方知网数字出版技术股份有限公司
High parallelism computing system and instruction scheduling method thereof
ActiveUS20200004514A1Avoid deadlockImprove parallelismInstruction analysisInterprogram communicationComputer architectureConcurrent computation
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.
Owner:XILINX INC
Forward-looking multithreading partitioning method
InactiveCN101655783AFast executionIncrease profitConcurrent instruction executionTopological orderTopological sorting
The invention discloses a forward-looking multithreading partitioning method, comprising the following steps: constructing a corresponding expanding program correlogram for each loop statement basic block and each non loop statement basic block in a single threading application program; designing a corresponding directed acyclic graph for each expanding program correlogram; designing a forward-looking node for each directed acyclic graph, and removing the node from the directed acyclic graph; performing topological sorting for each directed acyclic graph; at last, partitioning forward-lookingmultithreading for a single-chip multi-core processor according to the sequence semantics in the single threading application program and the obtained topological order. The method performs forward-looking multithreading partitioning by the loop statement and the non loop statement, can fully dig control dependency and data dependency in the program, fully utilizes thread-level parallelism, reduces unnecessary delay waiting by forward-looking performing, increases the performing speed of the program on the multi-core processor and improves the utilization ratio of the processor.
Owner:SHANGHAI UNIV
A Software Identification Method Based on Data Stream Slicing
The invention discloses a software identification method based on a data stream sliced sheet, which comprises the following steps: carrying out software identification and virus detection on software by adopting a computer system, wherein, the computer system comprises a feature extraction module which is provided with a data dependence extraction module, a data dependence graph sliced sheet module, a topological sorting module and a sliced sheet rule module, wherein, the data dependence extraction module is connected with the data collection module; the data dependence extraction module and the data collection module have an common input (I); the outputs of the feature extraction module and the data collection module are connected with a similarity comparison module, and give out a software feature extraction algorithm secondary flight display system (SFDS) based on the data stream sliced sheet; a software feature judgment system aiming to the data stream sliced sheet is realized; and on the judgment system, robustness and confidence experiment and analysis are carried out on the provided algorithm.
Owner:NORTHWEST UNIV(CN)
Integrated circuit static time sequence analysis method for GPU accelerated calculation
ActiveCN112257364AImprove performanceMinimize the adverse impact of total time consumptionCAD circuit designSpecial data processing applicationsStatic timing analysisSorting algorithm
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.
Owner:PEKING UNIV
Dependency relationship task scheduling method combined with function on-demand configuration in edge calculation
ActiveCN110069341AIncrease profitImprove experienceProgram initiation/switchingResource allocationCompletion timeEarliest finish time
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.
Owner:UNIV OF SCI & TECH OF CHINA
Method and device for arranging operational project sequence
InactiveCN101576980AGuaranteed resultsResourcesSpecial data processing applicationsMutual dependencyTopological sorting
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.
Owner:YONYOU
Different structure converting method from AOE (Activity On Edge) network to multi-way tree structure
InactiveCN104182499AIncreased complexityEmbody dynamic characteristicsRelational databasesSpecial data processing applicationsSorting algorithmDepth-first search
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.
Owner:CHENGDU AIRCRAFT INDUSTRY GROUP
Novel network anti-fraud active inspection and early warning system
ActiveCN111915468AImprove robustnessOvercoming multi-source heterogeneityForecastingPayment protocolsEarly warning systemTopological sorting
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI
High-parallelism computing system and instruction scheduling method thereof
ActiveCN110659070AAvoid fetch orderImprove parallelismConcurrent instruction executionNeural architecturesComputer architectureScheduling instructions
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.
Owner:XILINX INC
Logic network topology sorting and storing method for fault diagnosing system
ActiveCN104020756AConvenient configuration requirementsFlexible configurationElectric testing/monitoringSpecial data processing applicationsAlgorithmTheoretical computer science
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.
Owner:NARI TECH CO LTD
Module control method of centralized distribution and transportation 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.
Owner:WELLONG ETOWN INT LOGISTICS +2
Task processing method and task processing device
ActiveCN111221643AReduce waiting timeImprove execution efficiencyResource allocationEnergy efficient computingTopological graphTheoretical computer science
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.
Owner:ALIBABA GRP HLDG LTD
Fault positioning method and system based on distribution network partitioning equivalence
ActiveCN110133450AImprove positioning efficiencyReduce computing scaleFault location by conductor typesSystems intergating technologiesTopological sortingComputer science
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.
Owner:SHANDONG UNIV
Scalable boolean methods in a modern synthesis flow
ActiveUS20200074019A1Small sizeDesign optimisation/simulationSpecial data processing applicationsBinary decision diagramDecision graph
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.
Owner:SYNOPSYS INC
Service combination instance migration effectiveness judgment method based on dynamic dependency graph
ActiveCN103606042ASupport dynamic evolutionAvoid false negativesResourcesControl flowService composition
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.
Owner:NANJING UNIV OF SCI & TECH
Event-driven floor trading cargo centralized distribution and transportation system
ActiveCN104376445AImprove operational efficiencyIncrease the real load rateCustomer relationshipFinanceArray data structureTopological sorting
The invention discloses an event-driven floor trading cargo centralized distribution and transportation system. For ensuring smooth execution of cargo transportation, all operating links of a cargo centralized distribution system are firstly defined to be a series of events, and then an event sequence is calculated by means of a topological sorting method. The event-driven floor trading cargo centralized distribution and transportation system establishes the priority of main events according to the relation of different events, establishes a directed acyclic graph, enables all root nodes of the directed acyclic graph to form a root node array, generates an empty linked list, sequentially traverses all nodes in the root node array by means of a recursive call method and stores the topological sorting of the nodes in the linked list so as to complete the topological sorting of the events, and achieves accurate and intelligent topological sorting generation according to the relation of the events.
Owner:WELLONG ETOWN INT LOGISTICS +1
Task scheduling method and device, server and storage medium
PendingCN112214289AIntuitive Understanding of Execution RelationshipsIncrease profitProgram initiation/switchingTopological sortingProcessing
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.
Owner:TENCENT TECH (SHENZHEN) CO LTD
Who we serve
- R&D Engineer
- R&D Manager
- IP Professional
Why Patsnap Eureka
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com