If we know all the tasks take the same amount of time, then we can just put the same number of tasks on each processor. However, if we know the amount of time for tasks is different for each task, then we have to come up with a different way to assign tasks to processors. One possible solution could be to run a sorted greedy algorithm, where we average the amount of work assigned to each processor by limiting it to around total work/number of cores.
If we know all the tasks take the same amount of time, then we can just put the same number of tasks on each processor. However, if we know the amount of time for tasks is different for each task, then we have to come up with a different way to assign tasks to processors. One possible solution could be to run a sorted greedy algorithm, where we average the amount of work assigned to each processor by limiting it to around total work/number of cores.