Performance Analysis of Multilayered Multipriority Asymmetric-Sized Delta Networks

Algorithm 1

Queue-process for multilayered, multipriority MINs.

Queue-Process (cs_id, cl_id, nl_id, sq_id)

Input: Current stage_id (cs_id); Current and Next Stage Layer_id (cl_id, nl_id) of Send- and Accept-Queue/s respectively;

     Send-Queue_id (sq_id) of Current Stage

{

 Processor = 0;

 for (pr_id= P−1; pr_id>= 0; pr_id- -) // where P is the total number of priorities

 if (Pop[sq_id][cs_id][cl_id][pr_id] > 0) and (processor = 0)

 // pr_id-class Send-Queue is not empty and processor is still ready for forwarding

 {

  RA_bit = get_bit(RA[sq_id][cs_id][clid][pr_id][1]); // get the (cs_id)th bit of Routing Address (RA)

  // for the leading packet of pr_id-class Send-Queue by a cyclic logical left shift

       if (RA_bit = 0) // upper port forwarding

       aq_id = 2 ∗ (sq_id% (N/2) ); // link for perfect shuffle algorithm

         // where N is the total number of input/output ports

else // lower port forwarding

            aq_id = 2 ∗ (sq_id% (N/2) ) + 1; // link for perfect shuffle algorithm

  // the above network implementation (omega-type) has the same interconnection links between the crossbar stages

Unicast-Forwarding (cs_id, cl_id, nl_id, sq_id, aq_id, pr_id);

Processor = 1;

   }

}