Abstract
Theoretical models and numerical results for performance of the computer interconnection networks with heterogeneous activity are presented. The networks are modeled as a ring or as 2-dim toroidal square lattice of nodes with local processors with two or, respectively, four output ports/buffers. The processors generate messages with two different rates, λ 1 or λ 2 , per clock cycle and per output buffer, depending on the intensity of the flow of the arriving messages. The average queue lengths and average latencies are obtained. The model of independent queues and the Jackson theorem are not applicable for this type of networks. It is shown that the networks undergo the phase transition of the second order with non-trivial critical exponents.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
