Min Max Algorithm in Grid Computing with code in C

Here you will find the easiest explanation for min max algorithm in grid computing.

Let us first know why this algorithm is needed?

This is a static task scheduling algorithm used for load balancing.

Why we call it Min-Max when actually we are finding the maximum first then minimum?

This is because the semantics of saying Min-Max means that the task with minimum execution time (lightest process ) is allocated to the machine with maximum completion time (worst machine).

Let us take an example before moving to the code

Here Task 1 will execute in 140ms in VM1 and in 100 ms in VM2. Task 2 will execute for 20ms in VM1 and in 100ms in VM2 . Task 3 will run for 60 ms in VM1 and for 70 ms in VM2.

What is a Task ?

Let’s take an example. Suppose you have developed a social media app called fakebook. Now user one wants to change her DP , another user wants to create her account and the third user wants to like a picture.

All these are the tasks and involve manipulation in the database. The entity responsible for that change is the backend server. For effective use of the server you have made virtual partitions of the server making some virtual machines good for light computation and some virtual machines for heavy computation.

Algorithm to solve the problem

  1. Find maximum time for each task , in the above image maximum time for each task is (140 ms ,T1 ,VM1), (100 ms, T2, VM2) ,(70 ms, T3, VM2)
  2. Now find the set with minimum time and that is (70 ms, T3, VM2)
  3. Execute T3 in VM2 for 70ms
  4. Since 70ms has been elapsed we need to update our data. New data is:

5. Here we impute T3 as INT_MIN to let our code know that this task is over and it denotes negative infinite. Now repeat step 1

6. Find maximum time for each task , in the above image maximum time for each task is (170 ms ,T1 ,VM2), (170 ms, T2, VM2)

7. Now find the set with minimum time and that is (170 ms, T2, VM2)

8. Execute T2 in VM2 for 170ms

9. Since 170ms has been elapsed we need to update our data. New data is:

10. Find maximum time for each task , in the above image maximum time for each task is (340 ms ,T1 ,VM2)

11. Exit Since all task has been scheduled.

Makespan produced by any algorithm for a schedule can be calculated as follows:

Here makespan = max(70,170,340) = 340 ms

Finally the Code

Hi, I am a final year undergraduate from KIIT Bhubaneshwar pursuing my B.Tech in Computer Science and Engineering