An analytical performance model for multistage interconnection networks with finite, infinite and zero length buffers☆
References (15)
- C. Bouras, J. Garofalakis, P. Spirakis, V. Triantafillou, A general performance model for multistage interconnection...
- et al.
The NYU Ultracomputer — Designing an MIMD shared memory parallel computer
IEEE Trans. Comput.
(1983) - G. Pfister, M.C. Brantley, D.A. George, S.L. Harvey, W.J. Kleinfelder, K.P. McAuliffe, E.A. Melton, V.A. Norton, J....
Finding the right ATM switch for the market
IEEE J. Comput.
(1994)- et al.
Queueing delays in buffered multistage interconnection networks
- et al.
Analysis and simulation of buffered Delta Networks
IEEE Trans. Comput.
(1981) - et al.
The performance of multistage interconnection networks with finite buffers
Cited by (18)
An analytical model for the performance evaluation of multistage interconnection networks with two class priorities
2013, Future Generation Computer SystemsCitation Excerpt :Following the transformation in Appendix B the system (21) is obtained. The above formulas (18) and (21) clearly express the steady-state utilizations of queues for high and low priority packets respectively as Eqs. (17) and (20) in [6,7]. The above general formulas (18) and (21) are recursive functions of the utilization, depending on the utilization of the current, previous, next and last stages.
Analytical model for performance evaluation of Multilayer Multistage Interconnection Networks servicing unicast and multicast traffic by partial multicast operation
2010, Performance EvaluationCitation Excerpt :Also, MINs are proposed to connect a large number of processors in parallel systems, providing satisfactory routing and efficient multiple communication tasks concurrently as main benefits. Multistage Interconnection Networks (MINs) with the Banyan property [1–3] are networks where a unique path from an input to an output exists. In order to handle QoS requirements by MINs when they have to service various types of traffic, one approach is to assign a higher service priority to real-time traffic (e.g. video or voice delivery traffic) and a lower priority to non-real-time traffic (such as file transfer traffic).
Scheduling length for switching element disjoint multicasting in Banyan-type switching networks
2003, Journal of Systems ArchitectureClass-based weighted fair queuing scheduling on quad-priority Delta Networks
2012, International Journal of Parallel, Emergent and Distributed SystemsClass-based weighted fair queuing scheduling on dual-priority delta networks
2012, Journal of Computer Networks and CommunicationsAnalytical model for performance-evaluation of multistage interconnection networks supporting multi-class priority service
2011, International Journal of Parallel, Emergent and Distributed Systems
- ☆
This research was partially supported by the European Union ESPRIT Basic Research Projects ALCOM IT (contract no. 20244) and GEPPCOM (contract no. 9072) and the Greek Ministry of Education. A short version of this paper [1] has appeared in Euro-Par '97.