Skip to main content
SpringerLink
Log in

High Performance Computations for Study the Stability of a Numerical Procedure for Crossbar Switch Node

  • Conference paper
  • First Online:
Numerical Analysis and Its Applications (NAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10187))

Included in the following conference series:

Abstract

In the present paper the problem concerning computation of the upper bound of the throughput (THR) of crossbar switch node is formulated. The task is solved using an appropriate numerical procedure. The input data for this procedure are the results of high performance simulations executed on the grid-structure of the IICT-BAS (www.grid.bas.bg). The modeling of the THR utilizes MiMa-algorithm for a node with \((n\times n)\) commutation field, specified by the Generalized Nets. For studying the stability of the numerical procedure we use a modified family of patterns for hotspot load traffic simulation. The obtained results give an upper bound of the THR for \(n\in [3,97]\) which enables us to estimate the limit of the THR for \(n\rightarrow \infty .\) This estimate is obtained to be \(100\%\) for the applied family of patterns. The numerical procedure is stable (small input perturbations lead to small changes in the output).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alexandrov, A.: Ad-hoc Kalman filter based fusion algorithm for real-time wireless sensor data integration. Flexible Query Answering Systems 2015. AISC, vol. 400, pp. 151–159. Springer, Cham (2016). doi:10.1007/978-3-319-26154-6_12

    Chapter  Google Scholar 

  2. Anderson, T., Owicki, S., Saxe, J., Thacker, C.: High speed switch scheduling for local area networks. ACM Trans. Comput. Syst. 11(4), 319–352 (1993)

    Article  Google Scholar 

  3. Atanassov, K.: Generalized Nets and System Theory. Prof. M. Drinov Academic Publishing House, Sofia (1997)

    MATH  Google Scholar 

  4. Atanasova, T., Mishina, A.: Multiservice networks in digital houses. J. Probl. Eng. Cybern. Robot. 65, 14–21 (2012). Prof. M. Drinov Academic Publishing House, Sofia, Bulgaria

    Google Scholar 

  5. 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). doi:10.1007/978-3-319-26520-9_21

    Chapter  Google Scholar 

  6. Chao, H., Lui, B.: High Performance Switches and Routers. Wiley, Hoboken (2007)

    Book  Google Scholar 

  7. Chao-Lin, Y., Chang, C.-S., Lee, D.-S.: CR switch: a load-balanced switch with contention and reservation. IEEE/ACM Trans. Netw. 17(5), 1659–1671 (2007)

    Article  Google Scholar 

  8. Chen, T., Mavor, J., Denyer, P., Renshaw, D.: Traffic routing algorithm for serial superchip system customisation. IEE Proc. 137(1), 65–73 (1990)

    Google Scholar 

  9. Kang, K., Park, K., Sha, L., Wang, Q.: Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound. Real-Time Syst. 49(1), 117–135 (2013)

    Article  MATH  Google Scholar 

  10. Tashev, T.: Modelling throughput crossbar switch node with nonuniform load traffic. In: Proceedings of the International Conference on DCCN, October 26–28 2011, Moscow, Russia, pp. 96–102. R&D Company, Mosco (2011). (in Russian)

    Google Scholar 

  11. Tashev, T.: MiMa algorithm throughput modelling for crossbar switch with hotspot load traffic. In: Proceedings of the International Conference on DCCN 2013, October 7–10 2013, Moscow, Russia, pp. 257–264. JSC TECHNOSPHERA, Moscow (2013). (in Russian)

    Google Scholar 

  12. Tashev, T., Atanasova, T.: Computer simulation of MiMa algorithm for input buffered crossbar switch. Int. J. Inf. Technol. Knowl. 5(2), 183–189 (2011)

    Google Scholar 

  13. Tashev, T., Bakanov, A., Tasheva, R.: Determination of the value of convergence parameter in a procedure of calculating the upper boundary of throughput for packet switch. In: Proceedings of International Conference on RAM 2013, October 8–10 2013, Bankya, Bulgaria, pp. 34–37. Prof. M. Drinov Academic Publishing House, Sofia (2013)

    Google Scholar 

  14. 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). doi:10.1007/978-3-319-15585-2_33

    Google Scholar 

  15. Vabishchevich, P., Fort, V.: http://www.nomoz.org/site/629615/vfort.html. Accessed 15 Apr 2016

Download references

Author information

Authors and Affiliations

  1. Institute of Information and Communication Technologies - B.A.S., Acad. G. Bonchev St., Block 2, 1113, Sofia, Bulgaria

    Tasho D. Tashev & Vladimir V. Monov

  2. Technical University-Sofia, 8 Kl.Ohridski Blvd., 1000, Sofia, Bulgaria

    Radostina P. Tasheva

Authors
  1. Tasho D. Tashev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimir V. Monov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Radostina P. Tasheva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tasho D. Tashev .

Editor information

Editors and Affiliations

  1. Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Sofia, Bulgaria

    Ivan Dimov

  2. Department of Applied Analysis, Eötvös Loránd University, Budapest, Hungary

    István Faragó

  3. Department of Applied Mathematics and Statistics, University of Rousse, Ruse, Bulgaria

    Lubin Vulkov

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tashev, T.D., Monov, V.V., Tasheva, R.P. (2017). High Performance Computations for Study the Stability of a Numerical Procedure for Crossbar Switch Node. In: Dimov, I., Faragó, I., Vulkov, L. (eds) Numerical Analysis and Its Applications. NAA 2016. Lecture Notes in Computer Science(), vol 10187. Springer, Cham. https://doi.org/10.1007/978-3-319-57099-0_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57099-0_76

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57098-3

  • Online ISBN: 978-3-319-57099-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation