'Columbia University Libraries/Information Services'
Doi
Abstract
Despite intensive research on distributed processor interconnection architectures, relatively little work has been done on the performance analysis of such systems. The reason for this, besides the complexity of the behavior of such systems, is that Queueing Theory cannot easily handle systems consisting of many tightly interacting components. An alternate approach, based upon statistical mechanics, is used. We analyze interconnection structures such as crossbar, linear array, binary tree and ring
