Modelling and performance evaluation of a novel internal priority routing scheme for finite-buffered multistage interconnection networks

D. C. Vasiliadis, G. E. Rizos, C. Vassilakis and E. Glavas
International Journal of Parallel, Emergent and Distributed Systems, Vol. 26, No. 5, October 2011, 381–397, Taylor & Francis Abstract:

In this paper, the modelling, analysis and performance evaluation of a novel architecture for internal priority finite-buffered Multistage Interconnection Networks (MINs) is presented. We model the proposed architecture giving the details of its operation and describing its states and detailing conditions and effects of state transition; we also provide a formal model for evaluating its performance. The proposed architecture’s performance is subsequently analyzed under the uniform traffic condition, considering various offered loads, buffer-lengths and MIN sizes, using simulations. We compare the internal priority scheme vs. the non priority (or single priority) scheme, by gathering metrics for the two most important network performance factors, namely packet throughput and the mean time a packet needs to traverse the network. We demonstrate and quantify the improvements on MIN performance stemming from the introduction of priorities in terms of throughput and a combined performance indicator which depicts the overall performance of the MIN. These performance measures can be valuable assets for designers of parallel multiprocessor systems and networks in order to minimize the overall deployment costs and delivering efficient systems.

Note: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.