skip to main content
10.1145/2023607.2023685acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5

Authors Info & Claims
Published:16 June 2011Publication History

ABSTRACT

Achieving maximal throughput of a crossbar switch depends on creation of non-conflict schedule for packet commutation. The first step in checking the efficiency of commutation is throughput modeling of the switch by uniform demand traffic. In this paper we study the dependence between uniformity of the output sequences of a pseudo-random numbers generator and the required number of simulations to achieve a specified precision for this type of traffic under Linux SL with CERN-grid. The relationships have been obtained through computer simulated commutation using Generalized Nets model of the known PIM-algorithm. A possibility is shown for one to choose between precision and number of simulations.

References

  1. Elhanany, I., Hamdi, M. High-performance packet switching architectures. Springer-Verlag London Limited, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  2. Chen W., Mavor J., Denyer P. and Renshaw D. Traffic routing algorithm for serial superchip system customisation. IEE Proc 137:{E}1, 1990.Google ScholarGoogle Scholar
  3. Anderson T., Owicki S., Saxe J. and Thacker C. High speed switch scheduling for local area networks. ACM Trans. Comput. Syst., vol. 11, no.4, Nov. 1993, pp.319--352. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Guannan Q., Hyung J., Jianping W., Zhiyi F., Si-Qing Zh, Designing Fully Distributed Scheduling Algorithms for Contention -Tolerant Crossbar Switches. Proc. of IEEE Conf. HPSR 2010, 13--16 June 2010, Richardson, TX. pp. 69--74.Google ScholarGoogle Scholar
  5. Divakaran D., Anhalt F., Altman E, Primet P. Size-Based Flow Scheduling in a CICQ Switch, Proc. of IEEE Conf. HPSR 2010, 13--16 June 2010, Richar., TX. pp. 57--62.Google ScholarGoogle ScholarCross RefCross Ref
  6. Paskalev P., Nikolov V. Evaluation of records similarity in a duplication search engine using neural network. Proc. of 4th Int. IEEE Conf. "Intelligent Systems - IS '08", 6--8 Sept. 2008, Varna, Bulgaria. pp.11--59 - 11--63.Google ScholarGoogle ScholarCross RefCross Ref
  7. Atanassov K. Generalized Nets and System Theory. Acad. Press "Prof.M.Drinov", Sofia, Bulgaria, 1997.Google ScholarGoogle Scholar
  8. Gupta P., McKeown N. Designing and Implementing a Fast Crossbar Scheduler. IEEE Micro, Jan-Feb 1999, pp.20--28. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Tashev T. Computering Simulation of Schedule Algorithm for High Performance Packet Switch Node Modelled by the Apparatus of Generalized Nets. Proceedings of 11th International Conference on Computer Systems and Technologies " CompSysTech'10 ", June 17--18 2010, Sofia, Bulgaria. ACM Press, ACM ICPS Vol. 471, pp.240--245. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Tashev T., Vorobiov V. Generalized Net Model for Non-Conflict Switch in Communication Node. Proc. of Int. Workshop "DCCN'2007" Sept. 10--12, 2007, Moscow, Russia. IPPI Publ., Moscow, pp. 158--163.Google ScholarGoogle Scholar
  11. http://www.imamod.ru/~vab/vfort/download.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. A study of modeling precision of an algorithm for crossbar switch node under scientific Linux SL release 5

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Other conferences
              CompSysTech '11: Proceedings of the 12th International Conference on Computer Systems and Technologies
              June 2011
              688 pages
              ISBN:9781450309172
              DOI:10.1145/2023607

              Copyright © 2011 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 16 June 2011

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              Overall Acceptance Rate241of492submissions,49%

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader