Ieiet
Slēptie lauki
Grāmatas Grāmatas
" The DAG Model A parallel program can be represented by a directed acyclic graph (DAG) G = (V, E), where V is a set of v nodes and E is a set of e directed edges. A node in the DAG represents a task which in turn is a set of instructions which must be... "
On the Move to Meaningful Internet Systems 2007: CoopIS, DOA, ODBASE, GADA ... - 1332. lappuse
laboja - 2007 - 1860 lapas
Ierobežota priekšskatīšana - Par šo grāmatu

Annual Review of Scalable Computing, 2. sējums

Yuen Chung Kwong - 2000 - 248 lapas
...The DAG Model A parallel program can be represented by a directed acyclic graph (DAG) G = ( V, E). where V is a set of v nodes and E is a set of e directed...of instructions which must be executed sequentially without preemption in the same processor. The weight of a node «i is called the computation cost and...
Ierobežota priekšskatīšana - Par šo grāmatu




  1. Mana bibliotēka
  2. Palīdzība
  3. Izvērstā grāmatu meklēšana