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

An algorithm of non-conflict schedule with joint diagonals activation of connectivity matrix

Published: 22 June 2012 Publication History

Abstract

A synthesis of an algorithm for non-conflict schedule with joint diagonals activation is done. A software model of the algorithm is built. Rapidity, performance and memory resources are analyzed. It is calculated the performance and memory resource for different switching matrix types and sizes. A comparison of the proposed algorithm with other algorithms for non-conflict schedules is done.

References

[1]
Kolchakov, K. An Approach for Performance Improvement of Class of Algorithms for Synthesis of Non-conflict Schedule in the Switch Nodes. Proceedings of the 11th International Conference on Computer Systems and Technologies, CompSysTech'10, 17--18 June 2010, Sofia, Bulgaria, pp.235--239,
[2]
Kolchakov, K. An Algorithm Synthesis of Non-Conflict Schedule by Diagonal Connectivity Matrix Activation. Proceedings of the International Conference AUTOMATICS AND INFORMATICS'11, John Atanasoff Society of Automatics and Informatics, Bulgaria, Sofia 03.10--07.10.2011., pp. B-247 -- B251.
[3]
Kolchakov, K. Software Models with Sparse Mask Matrices for Non-Conflict Schedule obtaining in a Switching Node. Proceedings of the International Conference (DCCN - 2009) "Distributed Computer and communication networks DCCN 2009", Sofia, Bulgaria. October 5--9 2009. Moscow: R&D Company "Information and Networking technologies", 2009, pp. 121--126.
[4]
Kolchakov, K. A Modelling Approach for Obtaining of a Non - Conflict Schedule. Proceedings of the International Conference (DCCN -- 2007) "Distributed Computer and communication networks DCCN -- 2007", Moscow, Russia, September 10--12, 2007. Moscow: IPPI Publ., 2007, pp. 168--173.
[5]
Kolchakov, K. Synthesis of an Optimized Non-conflict Schedule Accounting the Direction of Messages Transfer in a Communication Node. Cybernetics and Information Technologies, Bulgarian Academy of Scienses, Vol. 4, No 2, 2004, Sofia, pp. 88--95.
[6]
Tashev T., Monov V. A Study of Modelling precision of an algorithm for crossbar switch node under scientific Linux SL release 5. Proceedings of 12th International Conference, CompSysTech'11, Vienna, Austria, June 16--17, 2011. ACM PRESS, ICPS VOL, 578. pp. 466--471.
[7]
Serpanos, D., P. Antoniadis. FIRM: A Class of Distributed Scheduling Algorithms for High-Speed ATM Switches with Multiple Input Queues. IEEE Infocom 2000 Conference, Tel Aviv, Israel, March 2000.
[8]
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.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '12: Proceedings of the 13th International Conference on Computer Systems and Technologies
June 2012
440 pages
ISBN:9781450311939
DOI:10.1145/2383276
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: 22 June 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. conflict elimination
  2. crossbar switch
  3. message switching node traffic
  4. network nodes
  5. packet messages
  6. sparse matrix

Qualifiers

  • Research-article

Conference

CompSysTech'12

Acceptance Rates

Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 37
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media