Answer Happy

Problem 3 To compile the algorithm, a computer (consisting of several processors) needs to perform a set of different operations (we will assume that each operation is performed exactly in 1 timestep on one processor), and the operations depend on each other and some of them can be performed only if there were done all the previous ones. Here is a table with the dependencies of the operation from each other. 1->3, 5, 6 2->4 3,5 ->8 6->7 4, 6->10 8->9 9, 10 -> 12 11,12->13 1) Imagine that we have an unlimited number of processors (how many NECESSARY operations can be performed in parallel), determine what is the minimum number of timesteps will be required to complete all operations and bring the example of this scheduling. 2) Create an optimal schedule of operations if you only have 2 processors available. 3) Create an optimal schedule of operations if you only have 3 processors available. 4) What are the two maximum size antichains?