Deadlock-Free Message Routing in Multiprocessor Interconnection Networks (Q4727425)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4001474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deadlock-Free Message Routing in Multiprocessor Interconnection Networks |
scientific article; zbMATH DE number 4001474 |
Statements
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks (English)
0 references
1987
0 references
communication networks
0 references
concurrent computation
0 references
graph model
0 references
message passing
0 references
multiprocessors
0 references
parallel processing
0 references
deadlock-free routing algorithm
0 references
interconnection networks
0 references
virtual channels
0 references
k-ary n-cubes
0 references
cube-connected cycles
0 references
shuffle-exchange networks
0 references
0.9784813
0 references
0.92147326
0 references
0.91003615
0 references
0 references
0.90230846
0 references
