In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs are partitioned into several levels, during executing process, the ready application set can insert in term of a certain regular.
In the proposed algorithm, each application is represented by a directed acyclic graph, and then all directed acyclic graphs are partitioned into several levels, during executing process, the ready application set can insert in term of a certain regular.
该算法采用有向无环图表示每个应用，然后，将所有这些图进行分层，执行过程中，就绪的应用组可以按照一定的规则动态插入。