Researches for more reliable arrangement graphs in multiprocessor computer system (Q2286137)
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 7149686
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Researches for more reliable arrangement graphs in multiprocessor computer system |
scientific article; zbMATH DE number 7149686 |
Statements
Researches for more reliable arrangement graphs in multiprocessor computer system (English)
0 references
9 January 2020
0 references
arrangement graph
0 references
inclusion-exclusion principle
0 references
probabilistic fault model
0 references
subgraph reliability
0 references
0.7907153964042664
0 references
0.779389500617981
0 references
0.7749566435813904
0 references
0.7645396590232849
0 references
0.753115177154541
0 references
