Inorder "List" Schedule cycle 0

Question

Hey, in our processor architectures sheet we have the following task:
 

Determine a schedule using the following approach while having of each resource 1 :   

• schedule step by step, i.e., starting with cycle 0, then cycle 1, ...
• in each step, determine the nodes ready to be executed, i.e., the nodes whose predecessors all have terminated, and append them to the ready list
• if multiple nodes get ready at the same time, append them to the ready list in ascending index order
• in each step, check the ready list (in-order) to schedule as many nodes as possible: a ready node can only be scheduled if an appropriate resource is available
• if a node gets scheduled, it is removed from the ready list
• continue until all nodes are scheduled 

if my first node has no prerequisites, i.e. u = 112 - 5, do I add it to the schedule list in cycle 0 and schedule it in cycle 1 or can I immediately schedule it in cycle 0?

Answer 1

Hi,

if a node is ready and the required resource is available, you can schedule it. So as the ready list is empty at the start (cycle 0) and the resources are not yet occupied by others, the node u=112-5 is the first one in the ready list and will immediately start.