Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method for processing a computing task, comprising: in response to usage of multiple computing resources indicating that at least one part of computing resources among the multiple computing resources are used, determining a direction of a communication ring between the at least one part of computing resources; in response to receiving a request for processing the computing task, determining a number of computing resources associated with the request; and based on the usage and the direction of the communication ring, selecting from the multiple computing resources a sequence of computing resources which satisfy the number to process the computing task; wherein selecting the sequence of computing resources based on the usage and the direction of the communication ring comprises: establishing a topological relation based on the usage and the direction of the communication ring, a node in the topological relation representing a computing resource among the multiple computing resources, and a directed edge in the topological relation representing a communication path in the communication ring between the at least one part of computing resources; and based on an overlap degree for a plurality of nodes in a sequence with an existing ring in the topological relation, selecting the sequence of computing resources represented by the nodes in the sequence.
This invention relates to optimizing the allocation of computing resources in a distributed computing environment, particularly where resources are interconnected via a communication ring. The problem addressed is efficiently selecting a sequence of computing resources to process a task while considering resource usage and the directional flow of data within the ring. The method dynamically determines the direction of the communication ring based on active resource usage, then evaluates incoming task requests to identify the required number of resources. A topological relation is constructed, where nodes represent computing resources and directed edges represent communication paths in the ring. The method selects a sequence of resources by analyzing the overlap between candidate sequences and the existing ring structure, prioritizing configurations that minimize disruptions to ongoing communications. This approach ensures efficient task processing while maintaining optimal data flow within the ring topology. The solution is particularly useful in high-performance computing and distributed systems where resource allocation must balance performance and communication efficiency.
2. The method of claim 1 , further comprising determining the overlap degree, comprising: determining a node overlap degree of a node in the sequence with a node in the existing ring, and an edge overlap degree of a directed edge between nodes in the sequence with a directed edge in the existing ring; and determining the overlap degree based on the node overlap degree and the edge overlap degree.
3. The method of claim 2 , wherein determining the node overlap degree comprises: with respect to a current node in the sequence, in response to determining that the current node is comprised in the existing ring, increasing a node overlap degree of the current node.
This invention relates to network topology optimization, specifically improving the efficiency of ring-based network configurations. The problem addressed is the redundancy and inefficiency in network ring structures where nodes may be unnecessarily included in multiple rings, leading to increased costs and complexity. The solution involves analyzing node overlap within a network to optimize ring configurations by reducing redundant node inclusions. The method determines the degree of node overlap in a network ring structure. For each node in a sequence, the system checks whether the node is already part of an existing ring. If the node is found in the existing ring, the node's overlap degree is incremented. This process is repeated for all nodes in the sequence to quantify how many times each node is redundantly included in multiple rings. The overlap degree information is then used to optimize the network by minimizing redundant node inclusions, thereby improving efficiency and reducing costs. The method ensures that nodes are not unnecessarily duplicated across rings, leading to a more streamlined and cost-effective network topology. By tracking and adjusting node overlap, the system avoids redundant connections, enhancing network performance and reliability. This approach is particularly useful in large-scale network deployments where minimizing redundancy is critical for operational efficiency.
4. The method of claim 2 , wherein determining the edge overlap degree comprises: with respect to a current directed edge between two nodes in the sequence, in response to determining that the current directed edge is comprised in the existing ring, increasing an edge overlap degree of the current directed edge.
5. The method of claim 2 , further comprising: determining a communication bandwidth associated with a directed edge in the existing ring; and updating the edge overlap degree of the directed edge based on the communication bandwidth.
This invention relates to optimizing communication networks, particularly in managing bandwidth and connectivity in ring-based network topologies. The problem addressed is efficiently allocating and updating communication resources in a network ring to improve performance and reliability. The method involves analyzing an existing ring network structure, which consists of nodes connected in a closed loop with directed edges representing communication links. Each directed edge has an associated edge overlap degree, which quantifies the redundancy or shared usage of that link in the network. The method further includes determining the communication bandwidth of a directed edge, which represents the capacity or data transfer rate of that link. Based on this bandwidth, the edge overlap degree is updated to reflect changes in network conditions, such as increased or decreased traffic load. This adjustment ensures that the network remains balanced and efficient, preventing bottlenecks or underutilized links. The method may also involve comparing the updated edge overlap degree to a threshold to determine if the network configuration needs further optimization, such as rerouting traffic or adjusting link capacities. The goal is to maintain optimal network performance by dynamically adapting to changes in bandwidth requirements.
6. The method of claim 5 , wherein updating the edge overlap degree of the directed edge based on the communication bandwidth comprises: with respect to a current directed edge between two nodes in the sequence, in response to determining that a communication bandwidth of a communication path represented by the current directed edge is reduced, increasing the edge overlap degree.
7. The method of claim 2 , further comprising: selecting from the topological relation a sequence having a lower overlap degree with the existing ring.
8. The method of claim 1 , further comprising: updating the topological relation in response to the usage of the multiple computing resources changing.
9. The method of claim 1 , wherein the multiple computing resources are multiple graphics processing units, and the method further comprises: establishing a ring communication channel among the multiple graphics processing units based on an AllReduce rule; allocating to the multiple graphics processing units data that is to be processed; and processing by the multiple graphics processing units the data that is to be processed.
10. An apparatus for processing a computing task, comprising: at least one processor; and a memory coupled to the at least one processor and having instructions stored thereon, the instructions, when executed by the at least one processor, causing the device to perform acts comprising: in response to usage of multiple computing resources indicating that at least one part of computing resources among the multiple computing resources are used, determining a direction of a communication ring between the at least one part of computing resources; in response to receiving a request for processing the computing task, determining a number of computing resources associated with the request; and based on the usage and the direction of the communication ring, selecting from the multiple computing resources a sequence of computing resources which satisfy the number to process the computing task; wherein selecting the sequence of computing resources based on the usage and the direction of the communication ring comprises: establishing a topological relation based on the usage and the direction of the communication ring, a node in the topological relation representing a computing resource among the multiple computing resources, and a directed edge in the topological relation representing a communication path in the communication ring between the at least one part of computing resources; and based on an overlap degree for a plurality of nodes in a sequence with an existing ring in the topological relation, selecting the sequence of computing resources represented by the nodes in the sequence.
11. The apparatus of claim 10 , further comprising determining the overlap degree, comprising: determining a node overlap degree of a node in the sequence with a node in the existing ring, and an edge overlap degree of a directed edge between nodes in the sequence with a directed edge in the existing ring; and determining the overlap degree based on the node overlap degree and the edge overlap degree.
12. The apparatus of claim 11 , wherein determining the node overlap degree comprises: with respect to a current node in the sequence, in response to determining that the current node is comprised in the existing ring, increasing a node overlap degree of the current node.
This invention relates to network topology optimization, specifically for managing node overlaps in ring-based network configurations. The problem addressed is efficiently determining the degree of node overlap in a network ring to optimize routing and resource allocation. The apparatus includes a processor and memory storing instructions for analyzing network nodes in a sequence. When evaluating a current node in the sequence, the system checks if the node is already part of an existing ring. If the node is found in the existing ring, the system increments a node overlap degree counter for that node. This process helps quantify how many times a node is reused in the ring structure, which is useful for balancing network load, reducing redundancy, and improving efficiency in ring-based networks. The apparatus may also include components for generating the node sequence, identifying existing rings, and applying the overlap degree data to optimize network performance. The overlap degree calculation is part of a broader method for analyzing and improving network topology by tracking node reuse in ring configurations.
13. The apparatus of claim 11 , wherein determining the edge overlap degree comprises: with respect to a current directed edge between two nodes in the sequence, in response to determining that the current directed edge is comprised in the existing ring, increasing an edge overlap degree of the current directed edge.
This invention relates to graph-based data processing, specifically methods for analyzing and quantifying edge overlaps in directed graphs, particularly in the context of detecting and evaluating ring structures within the graph. The problem addressed is the need to efficiently identify and measure the degree of overlap between directed edges in a sequence of nodes, particularly when those edges form part of an existing ring structure. A ring in a directed graph is a closed loop where a sequence of directed edges returns to the starting node. The apparatus includes a processor configured to analyze a directed graph by processing a sequence of nodes and their connecting edges. When evaluating a current directed edge between two nodes in the sequence, the processor checks whether this edge is part of an existing ring structure. If the edge is confirmed to be part of the ring, the processor increases an edge overlap degree metric for that edge. This metric quantifies how frequently or significantly the edge contributes to ring formations, aiding in tasks such as cycle detection, network analysis, or anomaly detection in graph-based systems. The method ensures accurate measurement of edge participation in rings, improving the reliability of graph analysis algorithms.
14. The apparatus of claim 11 , the acts further comprising: determining a communication bandwidth associated with a directed edge in the existing ring; and updating the edge overlap degree of the directed edge based on the communication bandwidth.
15. The apparatus of claim 14 , wherein updating the edge overlap degree of the directed edge based on the communication bandwidth comprises: with respect to a current directed edge between two nodes in the sequence, in response to determining that a communication bandwidth of a communication path represented by the current directed edge is reduced, increasing the edge overlap degree.
16. The apparatus of claim 11 , the acts further comprising: selecting from the topological relation a sequence having a lower overlap degree with the existing ring.
A system and method for optimizing network topology design involves analyzing and modifying network structures to improve efficiency and reliability. The technology addresses the challenge of integrating new network elements into existing ring-based topologies while minimizing disruptions and resource conflicts. The system evaluates topological relations between network components, such as nodes and links, to determine optimal configurations. A key aspect is selecting a sequence of connections with a lower overlap degree with an existing ring structure. This reduces redundancy, avoids congestion, and enhances fault tolerance by ensuring that new connections do not excessively interfere with established pathways. The method may involve dynamic adjustments based on real-time network conditions, ensuring adaptability to changing demands. By prioritizing sequences with minimal overlap, the system improves network performance, reduces maintenance costs, and enhances scalability. The approach is particularly useful in telecommunications, data centers, and other high-demand network environments where efficient resource allocation is critical. The solution leverages computational algorithms to assess topological relationships and make data-driven decisions, ensuring robust and efficient network operations.
17. The apparatus of claim 10 , wherein the multiple computing resources are multiple graphics processing units, and the method further comprises: establishing a ring communication channel among the multiple graphics processing units based on an AllReduce rule; allocating to the multiple graphics processing units data that is to be processed; and processing by the multiple graphics processing units the data that is to be processed.
18. A computer program product, tangibly stored on a computer readable medium and comprising machine executable instructions which, when executed, cause a machine to implement a method for processing a computing task, comprising: in response to usage of multiple computing resources indicating that at least one part of computing resources among the multiple computing resources are used, determining a direction of a communication ring between the at least one part of computing resources; in response to receiving a request for processing the computing task, determining a number of computing resources associated with the request; and based on the usage and the direction of the communication ring, selecting from the multiple computing resources a sequence of computing resources which satisfy the number to process the computing task; wherein selecting the sequence of computing resources based on the usage and the direction of the communication ring comprises: establishing a topological relation based on the usage and the direction of the communication ring, a node in the topological relation representing a computing resource among the multiple computing resources, and a directed edge in the topological relation representing a communication path in the communication ring between the at least one part of computing resources; and based on an overlap degree for a plurality of nodes in a sequence with an existing ring in the topological relation, selecting the sequence of computing resources represented by the nodes in the sequence.
This invention relates to resource management in distributed computing systems, specifically optimizing the selection of computing resources for processing tasks based on usage patterns and communication ring topology. The problem addressed is inefficient resource allocation in systems where computing tasks require coordinated processing across multiple resources, leading to suboptimal performance or increased latency. The system monitors the usage of multiple computing resources to detect which resources are actively in use. When a request for processing a computing task is received, the system determines the number of resources required for the task. Based on the current usage and the direction of a communication ring connecting the resources, the system selects an optimal sequence of resources to execute the task. The selection process involves constructing a topological relation representing the resources as nodes and communication paths as directed edges. The system evaluates the overlap degree of potential resource sequences with existing communication rings in the topology to minimize disruptions and maximize efficiency. This ensures that the selected resources are both available and optimally positioned in the communication network to handle the task with minimal latency and resource contention. The approach improves task processing efficiency by dynamically adapting to resource usage and network topology.
19. The computer program product of 18 , further comprising determining the overlap degree, comprising: determining a node overlap degree of a node in the sequence with a node in the existing ring, and an edge overlap degree of a directed edge between nodes in the sequence with a directed edge in the existing ring; and determining the overlap degree based on the node overlap degree and the edge overlap degree.
This invention relates to computer program products for analyzing and comparing sequences of nodes and edges in directed graphs, particularly for evaluating the similarity or overlap between a new sequence and an existing ring structure. The problem addressed is the need to quantify how closely a new sequence of nodes and directed edges aligns with an existing ring, which is useful in applications like network analysis, pattern recognition, and data validation. The invention involves a method for determining an overlap degree between a sequence of nodes and a directed ring structure. The process includes calculating a node overlap degree, which measures how many nodes in the sequence match nodes in the existing ring, and an edge overlap degree, which assesses how many directed edges in the sequence align with directed edges in the ring. The overall overlap degree is then derived from these two measurements, providing a quantitative assessment of similarity. This approach ensures that both the nodes and the directed connections between them are considered, offering a comprehensive evaluation of structural alignment. The technique is particularly valuable in scenarios where maintaining or identifying consistent patterns in directed graphs is critical, such as in cybersecurity, biological network analysis, or software dependency graphs.
20. The computer program product of claim 19 , wherein determining the node overlap degree comprises: with respect to a current node in the sequence, in response to determining that the current node is comprised in the existing ring, increasing a node overlap degree of the current node.
This invention relates to optimizing network topology in a ring-based network, particularly for reducing redundancy and improving efficiency. The problem addressed is the need to assess and manage node overlap in a network ring to prevent excessive redundancy while maintaining connectivity. The invention involves a computer program product that evaluates node overlap in a sequence of nodes forming a ring structure. When processing a current node in the sequence, the program checks if the node is already part of an existing ring. If the node is found in the existing ring, the node overlap degree for that node is incremented. This process helps quantify how many times a node is reused in the ring, allowing for adjustments to minimize unnecessary node repetition. The system may also include steps for generating a ring sequence, validating the sequence, and ensuring the ring meets specific criteria, such as connectivity and minimal overlap. The overlap degree calculation is used to refine the ring structure, ensuring optimal performance and resource utilization. This approach is particularly useful in network design, where minimizing redundant nodes improves efficiency and reduces costs.
Unknown
February 2, 2021
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.