 Scheduling the augmented task graph without considering communication is equivalent to scheduling the original task graph with communication. Algorithm 4 produces an optimal schedule when the task graph is an in-forest. It can be used in the out-forest...  Advanced Computer Architecture and Parallel Processing - 244. lappuseautors: Hesham El-Rewini, Mostafa Abd-El-Barr - 2005 - 288 lapasIerobežota priekšskatīšana - Par šo grāmatu
 | 1999 - 426 lapas
...itself. The trees rooted at the children of a node are called the left and right subtrees of that node. The depth of a node is defined as the length of the path from the node to the root. On the other hand, the height of a tree is the maximal depth of any... | |
| |
