Generating EGFT network topologies
First Claim
Patent Images
1. A method performed by a computer processor, the method comprising:
- receiving parameters that specify a number of servers, a number of switches, and a number of ports in the switches, for configuring an extended generalized fat tree network (EGFT) topology; and
generating a plurality of potential EGFT topologies based on the parameters and based on heuristics that favor higher bandwidth and lower latency, wherein generating the plurality of potential EGFT topologies comprises generating each level of the potential EGFT topologies recursively and from a bottom level of a potential EGFT topology to a top level.
2 Assignments
0 Petitions
Accused Products
Abstract
A method of generating a plurality of potential generalized fat tree network (GFT) topologies is provided herein. The method includes receiving parameters that specify a number of servers, a number of switches, and a number of ports in the switches. The parameters are for configuring an GFT topology. The method also includes generating a plurality of potential GFT topologies based on heuristics that favor higher bandwidth and lower latency. Generating the plurality of potential GFT topologies includes generating each level of the potential GFT topologies, recursively, and from a bottom level of a potential GFT topology to a top level.
-
Citations
20 Claims
-
1. A method performed by a computer processor, the method comprising:
-
receiving parameters that specify a number of servers, a number of switches, and a number of ports in the switches, for configuring an extended generalized fat tree network (EGFT) topology; and generating a plurality of potential EGFT topologies based on the parameters and based on heuristics that favor higher bandwidth and lower latency, wherein generating the plurality of potential EGFT topologies comprises generating each level of the potential EGFT topologies recursively and from a bottom level of a potential EGFT topology to a top level. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer system for generating a plurality of potential extended generalized fat trees, comprising:
-
a memory storing instructions; a processor configured to execute the instructions to; receive parameters that specify a number of servers, a number of switches, and a number of ports in the switches, for configuring an extended generalized fat tree network (EGFT) topology; and generate a plurality of potential EGFT topologies based on the parameters, and based on heuristics that favor higher bandwidth and lower latency, wherein generating the plurality of potential EGFT topologies comprises by generating each level of the potential EGFT topologies recursively and from a bottom level of a potential EGFT topology to a top level, wherein the potential EGFTs comprise; a plurality of parameterized levels; a plurality of link aggregation factors at each of the parameterized levels; and a number of top switches aggregated at each of the parameterized levels. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A non-transitory, computer-readable medium comprising machine-readable instructions executable by a processor to:
-
receive parameters that specify a number of servers, a number of switches, and a number of ports in the switches, for configuring an extended generalized fat tree network (EGFT) topology; and generate a plurality of potential EGFT topologies based on the parameters, and based on heuristics that favor higher bandwidth and lower latency, wherein generating the plurality of potential EGFT topologies comprises generating each level of the potential EGFT topologies recursively and from a bottom level of a potential EGFT topology to a top level, wherein the parameters comprise a bisection bandwidth threshold, and wherein the potential EGFTs comprise a bisection bandwidth greater than or equal to the bisection bandwidth threshold. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification