The ideal goal is to find one or more allocation where the runtime of tasks in a processor is less than the program duration and satisfies the ram of the processor.
A row represents a processor and a column represents a task. Value one means a task is allocated.
we have an array of runtimes and ram along with the number of tasks and processor
what you need to do is to create an algorithm that can find all the possible allocation and check with the constrains to see if it is valid.
All the tasks allocated in a processor must have runtimes less than the program duration which is given
Must satisfy the ram of the processor. no tasks must be allocated in a processor that exceeds the ram of the processor.
No task should be allocated more than once.
Each processor must have at least one task allocated.