Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths
The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scal...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6586 |
| _version_ | 1826215511649681408 |
|---|---|
| author | Sobalvarro, Patrick G. |
| author_facet | Sobalvarro, Patrick G. |
| author_sort | Sobalvarro, Patrick G. |
| collection | MIT |
| description | The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scale multiprocessors is problematic. Unfortunately, the addition of multiple paths between message sources and sinks in a network complicates the calculation of blocking probabilities. A methodology for exact calculation of blocking probabilities for small networks with redundant paths is presented here, with some discussion of its potential use in approximating blocking probabilities for large networks with redundant paths. |
| first_indexed | 2024-09-23T16:32:32Z |
| id | mit-1721.1/6586 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:32:32Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/65862019-04-12T08:31:35Z Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths Sobalvarro, Patrick G. The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scale multiprocessors is problematic. Unfortunately, the addition of multiple paths between message sources and sinks in a network complicates the calculation of blocking probabilities. A methodology for exact calculation of blocking probabilities for small networks with redundant paths is presented here, with some discussion of its potential use in approximating blocking probabilities for large networks with redundant paths. 2004-10-08T20:29:03Z 2004-10-08T20:29:03Z 1991-12-01 AIM-1337 http://hdl.handle.net/1721.1/6586 en_US AIM-1337 1073151 bytes 836222 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Sobalvarro, Patrick G. Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title | Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title_full | Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title_fullStr | Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title_full_unstemmed | Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title_short | Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths |
| title_sort | calculation of blocking probabilities in multistage interconnection networks with redundant paths |
| url | http://hdl.handle.net/1721.1/6586 |
| work_keys_str_mv | AT sobalvarropatrickg calculationofblockingprobabilitiesinmultistageinterconnectionnetworkswithredundantpaths |