Create a single large list before starting scheduling instead of dynamically building a priority list while scheduling every control step.

 It sorts all operations using the ALAP labels in ascending order as the primary key and the ASAP labels in descending order as the secondary key. Continue reading this post…

It is a generalization of the ASAP since it produces same results in the absence of resource constraints.

It uses a priority list of ready nodes (ready node: node that has its predecessors scheduled – the priority list is sorted with respect to a priority function) Continue reading this post…

Nodes are assigned to their last state that they can possibly be in.

1. All nodes in V which have no successors are assigned to the last state which can be inferred from the Time constraint T and they are removed from set V

Continue reading this post…

Nodes are assigned to their earliest state that they can possibly be in.

1. All nodes in V which have no predecessors are assigned to state 1 and they are removed from set V
2. All the nodes that have all their predecessors scheduled are assigned to their earliest possible state.

Continue reading this post…

Do you know that a username in Gmail of the form username@gmail.com is the same as u.s.e.r.n.a.m.e@gmail.com and user.name@gmail.com.

This is really something valuable and this what makes Gmail better than other email servers including Hotmail and Yahoo. Continue reading this post…