3 results about "Graph coloring" patented technology

A distributed inference communication method of a super-large-scale graph neural network comprises the following steps: dividing a global topology to be processed into a plurality of local sub-domains matched with the number of GPUs, and determining a local master node and a boundary master node allocated to each GPU; calculating coloring priorities of nodes, and performing parallel graph coloring based on the coloring priorities to construct a global independent set sequence; mapping the global independent set sequence to the local sub-domains of the GPUs to generate a local task slice sequence, which comprises boundary node slices and internal node slices, evaluating communication load and calculation load of the slices, and taking the internal node slices as calculation fillers to be executed in the communication waiting period of the boundary node slices; and each GPU executes an inference task by using a multi-stream asynchronous pipeline constructed locally according to the local task slice sequence. The method can improve the throughput of distributed inference.

The application belongs to the technical field of electric digital data processing, and relates to a complex construction node steel bar arrangement logic optimization method. Steel bar geometric parameters and anchoring constraint relationships are extracted, a directed acyclic graph is constructed with steel bar sections as nodes, spatial occupation intersections as edges, and construction sequences and construction specifications as weights; spatial arrangement conflicts are converted into loop identification problems in the graph, and graph coloring processing is used to divide conflict edges into levels and give avoidance priorities; based on topological sorting traversal, bending avoidance directions and offset rules are determined according to coloring values; offset compensation calculation is performed through topological reverse sequence, offset values are reversely transmitted to non-conflict steel bar sections along the edges, and arrangement coordinates and bending node logic sequences are output. The application converts serial collisions into graph structure operations, overcomes chain collisions and local deadlocks caused by serial avoidance, and eliminates space occupation caused by avoidance.