Multi-Objective Genetic Algorithm for Task Assignment on Heterogeneous Nodes

Algorithm 1

Step 1: Maximize {𝑘∣𝑡_𝑖=𝑐∇𝑖={1,…,𝑘}, 𝑃_client≤𝑃^max_client}

Step 2: Set 𝑡_𝑖=𝑠  ∇𝑖={(𝑘+1)⋯𝑁}

WHILE ( 𝑃_client≥𝑃^max_client or𝑃_server≥𝑃^max_server or BW≥BW^max )

  Step 3:  IF ∃𝑖=max_𝑖{BW_𝑖∣𝑡_𝑖=𝑠}

       THEN  𝑡_𝑖=𝑡𝑒𝑚𝑝

    ELSE IF ∃𝑖=max_𝑖{BW_𝑖∣𝑡_𝑖=𝑡𝑒𝑚𝑝}

        THEN  𝑡_𝑖=𝑠𝑝𝑎𝑡

      ELSE IF ∃𝑖=max_𝑖{BW_𝑖∣𝑡_𝑖=𝑠𝑝𝑎𝑡}

         THEN  𝑡_𝑖=𝑐𝑜𝑚𝑏

    END

 Repeat Step 3 until BW≤BW^max

 Step 4: IF (𝑃_server≥𝑃^max_server  and 𝑡_𝑖=𝑐𝑜𝑚𝑏  ∇𝑖={1,…,𝑁}

           THEN STOP

    ELSEIF 𝑃_client≥𝑃^max_client THEN

       IF ∃𝑖∣𝑡_𝑖=𝑐 THEN

         Set  𝑡_𝑖=𝑠

       ELSE STOP

    END

END