Hello, every1, i need to ask a question kindly give the bruteforce solution for the given questions thanks.
lets i have P processors n have T tasks need to be scheduled on that processors.
p1 p2 p3 ... pn
t1 3 5 3
t2 5 3 1
t3 2 2 1
this means that task t1 can be executed on p1 in 3 unit of time, on p2 5 unit of time n so on ...
now i want to find a way that i can schedule the tasks on different processors so that all the tasks are completed in shortst time... i need to go throug all the
possible patterns untill i get the shortest time schedule... so how now i will solve this problem