DocumentCode :
1149028
Title :
Expected Capacity of (m2)-Networks
Author :
Masson, Gerald M. ; Morris, S. Brent
Author_Institution :
Department of Electrical Engineering and Computer Science, Johns Hopkins University
Issue :
7
fYear :
1983
fDate :
7/1/1983 12:00:00 AM
Firstpage :
649
Lastpage :
657
Abstract :
A concentrator is an interconnection network with n inputs and m outputs, n > m, wherein any specified subset of inputs of size less than or equal to some number, called the network´s actual capacity, can always be simultaneously connected to some equal-sized but unspecifiable subset of outputs. Guaranteed throughput as described by actual capacity has heretofore been the principle measure for evaluating concentrator performance. In many applications, however, a more practical measure of a concentrator´s capability is a probabilistic measure of its throughput in the following sense: given an input subset of size k, k ≤ m, what is the average number of inputs that can be connected to outputs? This measure will be called expected capacity. This paper considers the expected capacity of a special class of sparse crossbar concentrators called ( m 2 ) networks. It is seen that the expected capacity values for ( m 2 ) networks are usually quite close to k.
Keywords :
( m 2 ) networks; Actual capacity; binomial networks; concentrator; expected capacity; prime component counts; prime decomposition; Capacity planning; Communication system control; Joining processes; Missiles; Multiprocessor interconnection networks; Size measurement; Throughput; ( m 2 ) networks; Actual capacity; binomial networks; concentrator; expected capacity; prime component counts; prime decomposition;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1983.1676296
Filename :
1676296
Link To Document :
بازگشت