This paper presents an ecient routing and Β―ow control mechanism to implement multidestination message passing in wormhole networks. The mechanism is a variation of tree-based multicast with pruning to recover from deadlocks and it is well suited for distributed shared-memory multiprocessors (DSMs) w
β¦ LIBER β¦
Prospects of distributed shared memory for reducing global traffic in shared-bus multiprocessors
β Scribed by Gyungho Lee; Jinseok Kong
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 431 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1383-7621
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An efficient implementation of tree-base
β
M.P. Malumbres; JosΓ© Duato
π
Article
π
2000
π
Elsevier Science
π
English
β 398 KB
Evaluation of Compiler-Controlled Updati
β
Jonas Skeppstedt; Fredrik Dahlgren; Per StenstrΓΆm
π
Article
π
1999
π
Elsevier Science
π
English
β 291 KB
We consider in this paper the effectiveness of a new approach called compiler-controlled updating to reduce coherence-miss penalties in shared-memory multiprocessors. A key part of the method is a compiler algorithm that identifies the last store instruction to a memory block in a flow graph using c
On the effectiveness of runtime techniqu
β
Marcelo Lobosco; Orlando Loques; Claudio L. de Amorim
π
Article
π
2008
π
John Wiley and Sons
π
English
β 648 KB