Dynamic flow control method based on longitudinal expansion networking, electronic equipment and medium

Abstract

The invention relates to the technical field of computers, in particular to a dynamic flow control method based on longitudinal extension networking, electronic equipment and a medium, and the method comprises the following steps: S1, setting a group of flow control credit values for the mth chip Am in the longitudinal extension networking; step S2, when a first Am corresponding to the Ai has a flow control credit value increase demand, whether the Ai has a flow control credit value Di to be distributed at present is judged, the Di is a flow control credit value obtained based on reduction of an Eim corresponding to at least one second Am corresponding to the Ai and / or a reserved flow control credit value set by the Ai, and if yes, the Eim corresponding to the first Am is updated based on the Di; and S3, the Am communicates with the Ai based on the current flow control credit value, and the step S2 is returned. According to the invention, efficient and flexible dynamic flow control can be realized, and the utilization rate and communication efficiency of system resources under flow fluctuation are improved.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular, to a dynamic flow control method, an electronic device, and a medium based on scale-up networking. Background Art

[0002] In traditional scale-up network communication, the flow control mechanism is consistent with the corresponding scenario, and good traffic settings can improve the efficiency of network communication. However, in an actual network, traffic fluctuates, such as a burst operation of a single network card, or the superposition of burst traffic from multiple network card accesses. Therefore, the traffic needs to be adjusted. The current solution mainly involves quasi-static switching of traffic control, which requires the previous traffic service to stop before traffic switching can be performed. If the existing quasi-static switching of traffic control is adopted, there are at least the following disadvantages: 1. Traffic service needs to stop: Quasi-static switching brings additional waiting time, which is not conducive to the overall efficiency of the system. 2. Coordination between multiple cards: To avoid function errors, all cards in the entire system are stopped. Otherwise, in quasi-static switching, if there is traffic, the function will malfunction, and the coordination of multiple cards is essential. Even for the traffic adjustment of two point-to-point cards, all cards in the entire system need to stop working. It can be seen that only static traffic control cannot have a corresponding effect on dynamic traffic fluctuations. Therefore, a corresponding dynamic traffic control mechanism is needed to adjust traffic control and improve the utilization rate of system resources and communication efficiency under traffic fluctuations. Summary of the Invention

[0003] The purpose of the present invention is to provide a dynamic flow control method, an electronic device, and a medium based on scale-up networking, which can achieve efficient and flexible dynamic traffic control, and improve the utilization rate of system resources and communication efficiency under traffic fluctuations.

[0004] According to a first aspect of the present invention, there is provided a dynamic flow control method based on scale-up networking, including: Step S1: Set a set of flow control credit values {E m for the m-th chip A in the scale-up networking 1 m , E 2 m ,..., E i m ,..., E M m}, where E i m is the initial flow control credit value of the data packet that A m can send to the i-th chip A i . The value range of i is from 1 to M, the value range of m is from 1 to M, and M is the total number of chips in the scale-up networking. , Q i is A i The corresponding physical cache; Step S2, when A i The corresponding first A m When there is a need to increase the flow control credit value, determine whether there is currently a flow control credit value D i to be allocated, D i , D i is based on reducing at least one second A i corresponding to A m The corresponding E i m The obtained flow control credit value and / or A i The set reserved flow control credit value. If it exists, then based on D i Update the first A m The corresponding E i m , the first A m , the second A m and A i are different chips, and the updated E i m satisfies ; Step S3, A m Based on the current {E 1 m , E 2 m ,..., E i m ,..., E M m} communicate with A i and return to Step S2.

[0005] According to the second aspect of the present invention, there is provided an electronic device, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executed by the at least one processor, and the instructions are configured to execute the method described in the first aspect of the present invention.

[0006] According to the third aspect of the present invention, there is provided a computer-readable storage medium storing computer-executable instructions, and the computer instructions are used to execute the method described in the first aspect of the present invention.

[0007] Compared with the prior art, the present invention has obvious advantages and beneficial effects. By means of the above technical solutions, a dynamic flow control method, an electronic device and a medium based on vertical expansion networking provided by the present invention can achieve considerable technical progressiveness and practicality, and have wide industrial utilization value. It has at least the following beneficial effects: The present invention increases the flow control credit value for the chips that need to increase the flow control credit value by maintaining the flow control credit value to be allocated for the chips, without affecting other chips. Moreover, the chips do not need to pause operation or stop the traffic service of the chips, and the flow control credit value can be dynamically updated, thereby realizing dynamic flow control, greatly reducing the problem of traffic fluctuations in multi-card networking, promoting the optimal configuration and efficient utilization of system resources, and improving the utilization rate of system resources and communication efficiency under traffic fluctuations. Brief Description of the Drawings

[0008] To more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained based on these drawings.

[0009] Figure 1 It is a flowchart of a dynamic flow control method based on vertical expansion networking provided by an embodiment of the present invention. Detailed Embodiment

[0010] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts belong to the scope of protection of the present invention.

[0011] An embodiment of the present invention provides a dynamic flow control method based on vertical expansion networking, including: Step S1: Set a set of flow control credit values {E m , E 1 m ,..., E 2 m ,..., E i m ,..., E M m} for the m-th chip A in the vertical expansion networking. E i m is the initial flow control credit value of the data packet that A m can send to the i-th chip A i . The value range of i is from 1 to M, and the value range of m is from 1 to M. M is the total number of chips in the vertical expansion networking. , and Q i is the physical cache corresponding to A i .

[0012] Among them, all chips in the vertically extended network are connected to the same switch, and the chips communicate with each other through the switch. Specifically, static register groups with the same structure can be set for all chips in the vertically extended network. Each static register group includes M registers, and each register is used to store a corresponding E i m . The static register group can be specifically set in the adaptation layer. Each chip is set with a corresponding MAC (Media Access Control Address) address to achieve point-to-point flow control. The flow control credit value specifically refers to the number of data packets. The initial flow control credit value is the maximum value of the initially set flow control credit. Indicates that the total physical cache space corresponding to the control credit value in the static register group of a chip is less than or equal to the physical cache space. When i and m are equal, E i m =0.

[0013] Step S2, when A i The corresponding first A m When there is a need to increase the flow control credit value, it is judged whether there is currently a flow control credit value D i to be allocated. D i is the flow control credit value obtained based on reducing at least one second A i corresponding to A i and / or the reserved flow control credit value set by A m corresponding to E i m . If it exists, then based on D i update the E i corresponding to the first A m , the first A i m , the first A m , the second A m and A i are different chips. The updated E i m satisfies .

[0014] Among them, when there is a traffic fluctuation corresponding to A i and there is a need to increase the traffic, there is a need to increase the flow control credit value corresponding to A i . It should be noted that. The first A m The first A m , the second A m both refer to one of the A m , that is, one of the chips, but the first A m , the second A m are different A m , that is, different chips, the first Am , the second A m and A i are also different chips. It should be noted that A i and the first A m or A i and the second A m can specifically obtain the content of the increase or decrease of the corresponding flow control credit value based on interrupts or by setting the corresponding pins.

[0015] Step S3, A m Based on the current {E 1 m , E 2 m ,..., E i m ,..., E M m} communicate with A i and return to step S2.

[0016] The embodiment of the present invention proposes a dynamic flow control mechanism based on the vertical expansion networking of multiple cards of a switch, which can solve the traffic fluctuation between point-to-point at the minimum cost without stopping the work of the entire network. The present invention utilizes static registers and corresponding processes, and can be compatible with the scheduling algorithms on the system side. Compared with the traditional scheme, the complexity is significantly reduced, and the utilization rate of system resources and communication efficiency under traffic fluctuations are improved.

[0017] It should be noted that step S2 can be implemented based on different dynamic adjustment strategies, which will be further described through several specific embodiments below.

[0018] Embodiment 1 The step S2 includes: Step S21, when there is a need to increase the flow control credit value corresponding to the first A i corresponding to A m , determine whether there is at least one second A m that can reduce the flow control credit value. The second A m is a chip whose communication frequency with A i is less than the preset communication frequency threshold. If it exists, execute step S22; otherwise, execute step S23.

[0019] Among them, a chip with a communication frequency less than the preset communication frequency threshold can be regarded as an infrequently used chip, that is, the second A m is an A i that does not often send data packets to A m . The actually required flow control credit value of the second A m is greater than the currently allocated A i corresponding to the A iThe chip corresponding to the flow control credit value.

[0020] Step S22: Decrease at least one second A m Send a decreased flow control credit value, based on the second A m Increase the first A by the decreased flow control credit value m For the flow control credit value, execute step S3.

[0021] It should be noted that when A i The corresponding first A m When there is a need to increase the flow control credit value, according to the second A m The decreased flow control credit value is for the first A m Increase the flow control credit value to meet all the requirements for increasing the flow control credit value, or increase part of the flow control credit value to meet all the requirements for increasing the flow control credit value, which can be flexibly set according to specific application scenarios and requirements.

[0022] Step S23: Send a rejection instruction for increasing the flow control credit value to the first A m Execute step S3.

[0023] As an embodiment, step S22 includes: Step S221: Sort the second A m In ascending order of the communication frequency with A i In ascending order.

[0024] Among them, chips with a communication frequency less than the preset communication frequency threshold can be regarded as infrequently used chips, that is, the second A m Is the A that infrequently sends data packets to A i , The second A m The actually required A m The chip corresponding to the flow control credit value is greater than the currently allocated A i The chip corresponding to the flow control credit value. i

[0025]

[0025] Step S222: Sequentially determine whether there is a target second A whose flow control credit value can be decreased F i In ascending order of the communication frequency with A, where F m Is the flow control credit value that the first A m Currently needs to increase. If there is, execute step S223; otherwise, execute step S23. m For the first A m

[0026]

[0026] It should be noted that the strategy executed in step S222 is to increase the flow control credit value for the first A m To meet all the requirements for increasing the flow control credit value. If not, reject the increase in the flow control credit value.

[0027] Step S223: Set the target second A m The maximum value of the control credit is reduced by F m , the first A m The maximum value of the control credit increases F m , execute step S3.

[0028] As an embodiment, the step S22 includes: Step C221: Determine whether there is a target second A whose flow control credit value can be reduced. m , F m For the first A m If the control credit value that needs to be increased currently exists, execute step C222; otherwise, execute step S23.

[0029] Step C222: Reduce the second A of each target according to a preset ratio. m The flow control credit value of all targets is the second A m The total amount of reduced flow control credits is less than or equal to F m .

[0030] It should be noted that the preset ratio can be set to an equal ratio or an unequal ratio, depending on the specific application requirements. m The reduced flow control credit value is the first A m The flow control credit value that satisfies all the flow control credit value increase requirements may be increased, or part of the flow control credit value that satisfies all the flow control credit value increase requirements may be increased.

[0031] Embodiment 2 The step S2 comprises: Step C21, A i Actively send messages to each A during idle time or periodically m Send a flow control credit recovery request.

[0032] Step C22: If there is a second A that can reduce the flow control credit value m , then the second A m The corresponding E i m Reduce L i m , A i The corresponding flow control credit value to be allocated is updated D i =D i +L i m , D i The initial value of L is 0. i m For the second A m The current flow control credit value that can be reduced.

[0033] Step C23: When A i The corresponding first A m has a requirement to increase the flow control credit value, determine whether D i ≥F m , where F m is the increased flow control credit value required by the first A m currently. If it is satisfied, execute Step C24; otherwise, return to Step C21.

[0034] Step C24: Update the E m corresponding to the first A i m =E i m +F m , update D i =D i -F m .

[0035] It should be noted that A i actively sends a flow control credit value recovery request to each A m at idle times or periodically, actively recovering the flow control credit value. When the first A m has a requirement to increase the flow control credit value, it can more quickly achieve the increase of the flow control credit value, further improving the timeliness of dynamic flow control.

[0036] Example 3: The said Step S2 includes: Step D21: Set a reserved flow control credit value V i for A i , and set an initial value for V i .

[0037] Step D22: When the first A i corresponding to A m has a requirement to increase the flow control credit value, if V i ≥F m , where F m is the increased flow control credit value required by the first A m currently, then execute Step D23; if it is not satisfied and 0<V i <F m , then execute Step D24; if V i =0, then execute Step D25; Step D23: Update the E m corresponding to the first A i m =E i m +F m , update Vi =V i -F m Execute step D25.

[0038] Among them, through step D23, the flow control credit value that meets all the requirements for increasing the flow control credit value can be increased for the first A m Increase the flow control credit value that meets all the requirements for increasing the flow control credit value.

[0039] Step D24, update the corresponding E of the first A m corresponding E i m =E i m +V i Update V i =0, execute step D25.

[0040] Among them, through step D24, the flow control credit value that meets the requirements for increasing the flow control credit value can be increased for a part of the first A m Increase the flow control credit value that meets the requirements for increasing the flow control credit value.

[0041] Step D25, if the second A m Reduces the flow control credit value and V i +L i m Is less than or equal to the initial value of V i Then update V i =V i +L i m If the second A m Reduces the flow control credit value and V i +L i m Is greater than or equal to the initial value of V i Then update V i Equal to the initial value of V i L i m Is the flow control credit value that the second A m Can currently reduce.

[0042] It should be noted that through step D25, the reserved flow control credit value can be restored as soon as possible, providing guarantee for the next requirement for increasing the flow control credit value and improving the efficiency of dynamic adjustment.

[0043] Embodiment 4 The step S2 includes: Step E21, when the second A m Can reduce the flow control credit value, the second A m Reduces the flow control credit value and actively sends the reduced flow control credit value L i m To A i .

[0044] Step E22, A i Update the corresponding flow control credit value to be allocated D i = D i + L i m , D i The initial value of D is 0.

[0045] Step E23, when there is a need to increase the flow control credit value for the corresponding first A i Judge whether D m ≥ F i is satisfied, where F m is the increased flow control credit value required for the first A m currently. If so, execute step D24; otherwise, return to step D21. m m

[0046] Step D24, update the corresponding E of the first A m = E i m i m + F m i , update D i = D m - F m .

[0047] It should be noted that the second A m reduces the flow control credit value and actively sends the reduced flow control credit value L i m to A i . When there is a need to increase the flow control credit value for the first A m , it can more quickly realize the increase of the flow control credit value, further improving the timeliness of dynamic flow control.

[0048] It should be noted that the above-mentioned Tojo adjustment strategies can be used alone, or multiple strategies can be selected to be used in parallel, or multiple strategies can be selected and used in combination with a selection order.

[0049] As an embodiment, the step S3 includes: Step S31, A m Obtain the data packet B to be sent to A i . mi

[0050] Step S32, judge whether the current E i m is greater than or equal to the flow control credit value required by B mi . If so, execute step S33; otherwise, wait until E i m mi satisfies being greater than or equal to B miExecute step S33 when the required flow control credit value is reached.

[0051] Step S33: Send B mi to A i , and update E i m = E i m - C mi , when A m receives the reply message for B i from A mi , update E i m = E i m + C mi .

[0052] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the technical field to which this invention belongs. The terms used in the description of this invention in this specification are only for the purpose of describing specific embodiments, and are not intended to limit this invention. The term "and / or" used herein includes any and all combinations of one or more of the related listed items.

[0053] It should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts depict the steps as sequential processes, many of the steps can be implemented in parallel, concurrently, or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but there can also be additional steps not included in the drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0054] An embodiment of the present invention also provides an electronic device, including: at least one processor; and a memory communicatively connected to the at least one processor; wherein, the memory stores instructions executed by the at least one processor, and the instructions are configured to execute the method of the embodiment of the present invention.

[0055] An embodiment of the present invention also provides a computer-readable storage medium storing computer-executable instructions for executing the method of the embodiment of the present invention.

[0056] In the embodiments of the present invention, by maintaining the flow control credit value to be allocated for the chip and increasing the flow control credit value for the chip that needs to increase the flow control credit value, it will not affect other chips, and the chip does not need to pause work or stop the traffic service of the chip, and the flow control credit value can be dynamically updated, thereby realizing dynamic traffic control, greatly reducing the problem of traffic fluctuations in multi-card networking, promoting the optimal configuration and efficient utilization of system resources, and improving the utilization rate of system resources and communication efficiency under traffic fluctuations.

[0057] The above are only the preferred embodiments of the present invention, and do not impose any form of limitation on the present invention. Although the present invention has been disclosed above with the preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art can make some changes or modifications to the equivalent embodiments by using the disclosed technical content within the scope of the technical solution of the present invention. However, as long as the content does not deviate from the technical solution of the present invention, any simple modification, equivalent change and modification made to the above embodiments according to the technical essence of the present invention still fall within the scope of the technical solution of the present invention.

Claims

1. A dynamic flow control method based on vertical expansion networking, characterized in that: include: Step S1: For the mth chip A in the vertical expansion network m Set a set of flow control credit values ​​{E1 m ,E2 m ,...,E i m ,...,E M m }, E i m A m Able to provide the i-th chip A i The initial flow control credit value of the data packet sent. The value range of i is 1 to M, and the value range of m is 1 to M. M is the total number of chips in the vertical expansion network. , Q i A i The corresponding physical cache; Step S2: When A i The corresponding first A m When there is a need to increase the flow control credit value, judge A i Is there a flow control credit value D to be allocated? i , D i Based on reducing A i At least one second A m The corresponding E i m The obtained flow control credit value and / or A i The reserved flow control credit value set, if any, is based on D i Update First A m The corresponding E i m , first A m , Second A m and A i For different chips, the updated E i m satisfy ; Step S3, A m Based on the current m ,E2 m ,...,E i m ,...,E M m } and A i Communicate and return to step S2.

2. The method according to claim 1, characterized in that The step S2 comprises: Step S21: When A i The corresponding first A m When there is a demand to increase the flow control credit value, it is determined whether there is at least one second A that can reduce the flow control credit value. m , Second A m For A i If there is a chip whose communication frequency is less than the preset communication frequency threshold, execute step S22; otherwise, execute step S23; Step S22: reduce at least one second A m Send a reduced flow control credit value based on the second A m The reduced flow control credit value increases the first A m The flow control credit value is , and step S3 is executed; Step S23: To the first A m Send a flow control credit value increase rejection instruction and execute step S3.

3. The method according to claim 2, characterized in that The step S22 comprises: Step S221: The second A m Follow the A i The communication frequencies are sorted from small to large; Step S222: According to A i The communication frequency is determined in order from small to large to determine whether there is a flow control credit value that can reduce F m The goal of the second A m , F m For the first A m If the control credit value currently needs to be increased exists, execute step S223; otherwise, execute step S23; Step S223: Set the target second A m The maximum value of the control credit is reduced by F m , the first A m The maximum value of the control credit increases F m , execute step S3.

4. The method according to claim 2, characterized in that: The step S22 comprises: Step C221: Determine whether there is a target second A whose flow control credit value can be reduced. m , F m For the first A m If the control credit value currently needs to be increased exists, execute step C222, otherwise, execute step S23; Step C222: Reduce the second A of each target according to a preset ratio. m The flow control credit value of all targets is the second A m The total amount of reduced flow control credits is less than or equal to F m .

5. The method according to claim 1, characterized in that The step S2 comprises: Step C21, A i Actively send messages to each A during idle time or periodically m Send a flow control credit recovery request; Step C22: If there is a second A that can reduce the flow control credit value m , then the second A m The corresponding E i m Reduce L i m , A i The corresponding flow control credit value to be allocated is updated D i =D i +L i m , D i The initial value of L is 0. i m For the second A m The current flow control credit value that can be reduced; Step C23: When A i The corresponding first A m When there is a demand for increasing the flow control credit value, determine whether D is met i ≥F m , F m For the first A m If the current control credit value to be increased is satisfied, then execute step C24; otherwise, return to step C21; Step C24: Update the first A m The corresponding E i m =E i m +F m , update D i =D i -F m .

6. The method according to claim 1, characterized in that The step S2 comprises: Step D21: A i Set the reserved flow control credit value V i , is V i Set initial value; Step D22: When A i The corresponding first A m When there is a need to increase the flow control credit value, if V i ≥F m , F m For the first A m The current control credit value that needs to be increased, then execute step D23, if it is not satisfied and 0 <V i <F m , then execute step D24, if V i =0, then execute step D25; Step D23: Update the first A m The corresponding E i m =E i m +F m , update V i =V i -F m , execute step D25; Step D24: Update the first A m The corresponding E i m =E i m +V i , update V i =0, execute step D25; Step D25: If the second A m Reduce the flow control credit value and V i +L i m Less than or equal to V i The initial value of V i =V i +L i m , if the second A m Reduce the flow control credit value and V i +L i m Greater than or equal to V i The initial value of V i Equal to V i The initial value of L i m For the second A m The current flow control credit value that can be reduced.

7. The method according to claim 1, characterized in that The step S2 comprises: Step E21: When the second A m When the flow control credit value can be reduced, the second A m Reduce the flow control credit value and actively transfer the reduced flow control credit value L i m Send to A i ; Step E22, A i Update the corresponding flow control credit value to be allocated D i =D i +L i m , D i The initial value of is 0; Step E23: When A i The corresponding first A m When there is a demand for increasing the flow control credit value, determine whether D is met i ≥F m , F m For the first A m If the current control credit value needs to be increased, then execute step D24, otherwise, return to step D21; Step D24: Update the first A m The corresponding E i m =E i m +F m , update D i =D i -F m .

8. The method according to claim 1, characterized in that The step S3 comprises: Step S31, A m Get pending A i Packet B sent mi ; Step S32: Determine the current E i m Is it greater than or equal to B? mi Required flow control credit value, if yes, then execute step S33, otherwise, wait for E i m Satisfies greater than or equal to B mi When the required flow control credit value is reached, step S33 is executed; Step S33: B mi Send to A i , update E i m =E i m -C mi , when A m Receive A i For B mi When replying to the message, update E i m =E i m +C mi .

9. An electronic device, characterized in that: include: at least one processor; and, a memory communicatively coupled to the at least one processor; The memory stores instructions to be executed by the at least one processor, wherein the instructions are configured to execute the method according to any one of claims 1 to 8.

10. A computer-readable storage medium, characterized in that: Computer executable instructions are stored, and the computer executable instructions are used to execute the method of any one of the preceding claims 1-8.

Images