Dynamic routing method for multistage bus networks in distributed shared memory environment

A dynamic routing method for a multistage bus network in a distributed shared memory environment, wherein, when a forward U-turn routing is performed, the method comprises:

• a first step of calculating a stage where a forward U-turn is possible;
• a second step of comparing the calculated stage with a current stage so as to check whether a U-turn is possible in the current stage;
• a third step of, when the checked result of the second step is not affirmative, checking traffic levels of a plurality of switches in a next stage which are connected to a switch in the current stage;
• a fourth step of selecting a switch having the lowest traffic level of the checked switches as a route switch of the next stage, changing the next stage to a current stage, and then repeating a procedure from the second step;
• and
• a fifth step of, when the checked result of the second step is affirmative, performing a U-turn at the current stage, and performing a backward routing;
• and
• when a backward U-turn routing is performed, the method comprises:
• a sixth step of calculating a stage where a backward U-turn is possible;
• a seventh step of comparing the calculated stage with a current stage so as to check whether a U-turn is possible in the current stage;
• an eighth step of, when the checked result of the seventh step is not affirmative, checking traffic levels of a plurality of switches in a previous stage which are connected to a switch in the current stage;
• a ninth step of selecting a switch having the lowest traffic level of the checked switches as a route switch of the previous stage, changing the previous stage to a current stage, and then repeating a procedure from the seventh step;
• and
• a tenth step of, when the checked result of the seventh step is affirmative, performing a U-turn at the current stage, and performing a forward routing.