Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6586

Full metadata record

DC Field	Value	Language
dc.creator	Sobalvarro, Patrick G.	-
dc.date	2004-10-08T20:29:03Z	-
dc.date	2004-10-08T20:29:03Z	-
dc.date	1991-12-01	-
dc.date.accessioned	2013-10-09T02:46:07Z	-
dc.date.available	2013-10-09T02:46:07Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1337	-
dc.identifier	http://hdl.handle.net/1721.1/6586	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.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.	-
dc.format	1073151 bytes	-
dc.format	836222 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1337	-
dc.title	Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI