A Statistical Mechanics of Some Interconnection Networks

Pinsky, Eugene; Yemini, Yechiam

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.



More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-139B-84
Published Here
August 7, 2013