Abstract
Large-scale simulation of the throughput (TP) of an existing LPF-algorithm (Longest Port First) for crossbar switch are presented. The throughput for Generalized Nets (GN) model of algorithm is studied for uniform independent and identically distributed Bernoulli traffic. The presented simulations are executed on the AVITOHOL supercomputer located at the IICT, Bulgaria. The modeling of the TP utilizes LPF for a switch with \(N\in [2,60]\) commutation field size. Problems arise due to the time complicatedness of the implementation of the LPF-algorithm \((O(N^{4.7})\)). It is necessary to reduce the time complexity without introducing distortions into the results of simulation. One variant of the LPF with simplified random selection of a starting cell of weighting-matrix are discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cheung, S.Y.: CrossBar. Department of Computer Science, Emory University, Atlanta, Georgia, USA. http://www.mathcs.emory.edu/-cheung/Courses/355/Syllabus/90-parallel/CrossBar.html. Accessed 10 Apr 2021
Meng, J., Gebara, N., Ng, H.-C., Costa, P., Luk, W.: Investigating the feasibility of FPGA-based network switches. In: 2019 IEEE 30th International Conference on Application-Specific Systems Architectures and Processors (ASAP), vol. 2160-052X, IEEE Publications, pp. 218–226 (2019)
Chen, T., Mavor, J., Denyer, P., Renshaw, D.: Traffic routing algorithm for serial superchip system customization. IEE Proc. 137(1), 65–73 (1990)
Rojas-Cessa, R.: Interconnections for Computer Communications and Packet Networks. CRC Press, Taylor & Francis Group, Boca Raton (2017)
Kolchakov, K., Monov, V.: An approach to weights distribution of requests in two algorithms for non-conflict scheduling. In: Problems of Engineering Cybernetics and Robotics, vol. 70, pp. 21–26, Prof. Marin Drinov Academic Publishing House, Sofia (2018)
Balabanov, T., Zankinski, I., Barova, M.: Distributed evolutionary computing migration strategy by incident node participation. In: Lirkov, I., Margenov, S.D., Waśniewski, J. (eds.) LSSC 2015. LNCS, vol. 9374, pp. 203–209. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26520-9_21
Hensel, S., Marinov, M.A.: Comparison of time warping algorithms for rail vehicle velocity estimation in low-speed scenarios. Metrol. Measure. Syst. J. 24(1), 161–173 (2017)
Nedyalkov, I.: An original and simple method for studying the performance of a VoIP network. In: 2020 XI National Conference with International Participation (ELECTRONICA), pp. 1–4 (2020)
Otsetova-Dudin, E., Markov, K.: Mobility factor in new generations wireless networks. In: 2020 IEEE 10th International Conference on Intelligent Systems (IS), pp. 601–605 (2020)
Tashev, T., Marinov, M., Monov, V., Tasheva, R.: Modeling of the MiMa-algorithm for crossbar switch by means of Generalized Nets. In: 2016 IEEE 8th International Conference on Proceedings of Intelligent Systems (IS), Sofia, Bulgaria, pp. 593–598. IEEE Publications (2016)
Atanassov, K.: Generalized nets as a tool for the modelling of data mining processes. In: Sgurev, V., Yager, R.R., Kacprzyk, J., Jotsov, V. (eds.) Innovative Issues in Intelligent Systems. SCI, vol. 623, pp. 161–215. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-27267-2_6
Mekkittikul, A., McKeown, N.: A practical algorithm to achieve 100% throughput in input-queued switches. Proc. IEEE INFOCOM 1998, 792–799 (1998)
Tashev, T., Monov, V.: A numerical study of the upper bound of the throughput of a crossbar switch utilizing MiMa-algorithm. In: Dimov, I., Fidanova, S., Lirkov, I. (eds.) NMA 2014. LNCS, vol. 8962, pp. 295–303. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-15585-2_33
Tashev, T., Marinov, M., Tasheva, R., Alexandrov, A.: Generalized nets model of the LPF-algorithm of the crossbar switch node for determining LPF-execution time complexity. In: AIP Conference Proceedings, vol. 2333(1), pp. 090039-1–090039-8 (2021). https://doi.org/10.1063/5.0042856
Tashev, T.: Computering simulation of schedule algorithm for high performance packet switch node modelled by the apparatus of generalized nets. In: Proceedings of the 11th International Conference on Computer Systems and Technologies CompSysTech 2010, pp. 240–245. Association for Computing Machinery, NY, United States (2010)
Vabishchevich, P.: VFort. http://www.nomoz.org/site/629615/vfort.html. Accessed 15 Apr 2021
HPC and Data Centre at IICT-BAS. http://www.hpc.acad.bg/system-1/. Accessed 2021
Acknowledgment
We acknowledge the provided access to thee-infrastructure of the NCHDC - part of the Bulgarian National Roadmap on RIs, which is supported financially by the Grant No. D01-387/18.12.2020.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Tashev, T.D., Alexandrov, A.K., Arnaudov, D.D., Tasheva, R.P. (2022). Large-Scale Computer Simulation of the Performance of the Generalized Nets Model of the LPF-algorithm. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2021. Lecture Notes in Computer Science, vol 13127. Springer, Cham. https://doi.org/10.1007/978-3-030-97549-4_55
Download citation
DOI: https://doi.org/10.1007/978-3-030-97549-4_55
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-97548-7
Online ISBN: 978-3-030-97549-4
eBook Packages: Computer ScienceComputer Science (R0)