Skip to main content
SpringerLink
Log in

Q-Memory Task Routing to Prevent Deadlocks in Ethernet Control with Memory Crossbar Switching

  • Published:
Optical Memory and Neural Networks Aims and scope Submit manuscript

Abstract

In Ethernet system, as a result of head of line blocking, numerous control data queues with high priority may cause priority queues to become overcrowded and their receiving DMAs (Direct Memory Access) to run out of buffer space, forcing them to delete packets that are still arriving from the network. Thus the primary goal of this work is to prevent deadlock in an Ethernet system while sending congested information across the Ethernet protocol and channel. In order to allow many processors to interact concurrently without causing a conflict, this research paper proposes a Memory crossbar switching control in which the memory is divided into global and local partitions utilizing the q-learning architecture in the development of a Q-Memory task routing architecture. The path average value therefore represents congestion information for each router and its surrounding nodes. The nearby router receives the path average value if the message is received. The networks-on-chip protocol and channel should be used to provide congestion information in order to prevent deadlock in a system and improve communication.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.
Fig. 9.
Fig. 10.
Fig. 11.
Fig. 12.

Similar content being viewed by others

DATA AVAILABILITY

No data, models, or code were generated or used during the study

REFERENCES

  1. Jeong, S., Jeon, B., Chung, B., and Kim, H.K., Convolutional neural network-based intrusion detection system for AVTP streams in automotive Ethernet-based networks, Veh. Commun., 2021, vol. 29, p. 100338.

    Google Scholar 

  2. Karcher, N., Gebauer, R., Bauknecht, R., Illichmann, R., and Sander, O., Versatile configuration and control framework for real-time data acquisition systems, IEEE Trans. Nucl. Sci., 2021, vol. 68, no. 8, pp. 1899–1906.

    Article  Google Scholar 

  3. Chen, M., Zhang, Z., and Ren, H., Design and verification of high-performance memory interface based on AXI bus, in 2021 IEEE 21st International Conference on Communication Technology (ICCT), 2021, pp. 695–699.

  4. Mancini, T., Melatti, I., and Tronci, E., Any-horizon uniform random sampling and enumeration of constrained scenarios for simulation-based formal verification, IEEE Trans. Software Eng., 2021.

  5. Restuccia, F., Meza, A., and Kastner, R., AKER: A Design and Verification Framework for Safe and Secure SoC Access Control, arXiv preprint arXiv:2106.13263, 2021.

  6. Nasahl, P., Schilling, R., Werner, M., and Mangard, S., HECTOR-V: A heterogeneous CPU architecture for a secure RISC-V execution environment, in Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, 2021, pp. 187–199.

  7. Kolympianakis, F.G., Securing access in embedded systems via DMA protection and light-weight cryptography, 2021.

  8. Ziegler, T., Binnig, C., and Leis, V., Scale store: A fast and cost-efficient storage engine using DRAM, NVMe, and RDMA, Memory, 2022, vol. 2, no. P4, pp. P2.

    Google Scholar 

  9. Atik, E., A new fault-tolerant real-time ethernet protocol: Design and evaluation, Master’s Thesis, Middle East Technical University, 2021.

  10. Gupta, P. and Pathak, V., A minimum spanning tree-based routing technique of FAT tree for efficient data center networking, Math. Stat. Eng. Appl., 2022, vol. 71, no. 1, pp. 79-85.

    Google Scholar 

  11. Wang, S.Y., Chen, Y.R., Hsieh, H.C., Lai, R.S., and Lin, Y.B., A flow control scheme based on per hop and per flow in commodity switches for lossless networks, IEEE Access, 2021, vol. 9, pp. 156013–156029.

    Article  Google Scholar 

  12. Fuhrer, B., Shpigelman, Y., Tessler, C., Mannor, S., Chechik, G., Zahavi, E., and Dalal, G., Implementing Reinforcement Learning Datacenter Congestion Control in NVIDIA NIC, arXiv preprint arXiv:2207.02295, 2022.

  13. Zheng, H., Wang, K., and Louri, A., Adapt-noc: A flexible network-on-chip design for heterogeneous manycore architectures, in 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA), 2021, pp. 723–735.

  14. Konstantinou, D., Nicopoulos, C., Lee, J., and Dimitrakopoulos, G., Multicast-enabled network-on-chip routers leveraging partitioned allocation and switching, Integration, 2021, vol. 77, pp. 104–112.

    Article  Google Scholar 

  15. Schouten, R.H.J., Moormann, L., van de Mortel-Fronczak, J.M., and Rooda, J.E., Synthesis and implementation of distributed supervisory controllers with communication delays, Arxiv preprint arxiv: 2102.09821, 2021.

  16. Yang, M.C., Lee, Y.S., and Han, T.H., MRBS: An area-efficient multicast router for network-on-chip using buffer sharing, IEEE Access, 2021, vol. 9, pp. 168783–168793.

    Article  Google Scholar 

  17. Zaitsev, D.A., Shmeleva, T.R., and Probert, D.E., Applying infinite Petri nets to the cybersecurity of intelligent networks, grids and clouds, Appl. Sci., 2021, vol. 11, no. 24, p. 11870.

    Article  Google Scholar 

  18. Wu, X.C. and Ng, T.E., Detecting and resolving PFC deadlocks with ITSY entirely in the data plane, in IEEE INFOCOM 2022-IEEE Conference on Computer Communications, 2022, pp. 1928–1937.

  19. Wang, S.Y., Chen, Y.R., Hsieh, H.C., Lai, R.S., and Lin, Y.B., A flow control scheme based on per hop and per flow in commodity switches for lossless networks, IEEE Access, 2021, vol. 9, pp. 156013–156029.

    Article  Google Scholar 

  20. Noureddine, W. and Tobagi, F., Selective back pressure in switched Ethernet LANs, in Seamless Interconnection for Universal Services. Global Telecommunications Conference, GLOBECOM'99 (Cat. no. 99CH37042), 1999, vol. 2, pp. 1256–1263.

  21. Boyan, J.A., Packet routing in dynamically changing networks: A reinforcement learning method, Proc. NIPS94, 1994.

  22. Hajar, M.S., Kalutarage, H., and Al-Kadri, M.O., RRP: A reliable reinforcement learning based routing protocol for wireless medical sensor networks, in 2023 IEEE 20th Consumer Communications and Networking Conference (CCNC), 2023, pp. 781–789.

  23. Fang, J., Wei, Z., Liu, Y., and Hou, Y., TB-TBP: A Task-Based Adaptive Routing Algorithm for Network-on-Chip in Heterogenous CPU-GPU Architectures. No, S. School of Engineering and Technology Sri Padmavathi Mahila Visvavisyalayam (Scheme of Instruction and Evaluation of B. Tech (ECE), Department of Electronics and Communication Engineering I Year–I Semester (2016–2017), 2023.

  24. Jafar, S., Rajnish, R., and Kumar, P., Parallel computing: A paradigm to unimaginable computing speed and efficiency, Data Intensive Computing Applications for Big Data, 2018, vol. 29, p. 210.

    Google Scholar 

  25. Wu, Y., Wang, L., Wang, X., Han, J., Zhu, J., Jiang, H., and Liu, L., Upward packet popup for deadlock freedom in modular chiplet-based systems, in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), 2022, pp. 986–1000.

  26. Shillaker, S. and Pietzuch, P., Faasm: Lightweight isolation for efficient stateful serverless computing, in 2020 USENIX Annual Technical Conference (USENIX ATC 20), 2020, pp. 419–433.

Download references

ACKNOWLEDGMENTS

The authors would like to thank the Deanship of Universiti Teknologi Malaysia for supporting this work.

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Author information

Authors and Affiliations

  1. National Institute of Electronics and Information Technology, 431004, Aurangabad, Maharashtra, India

    Smita Sudhakar Palnitkar

  2. Puranmal Lahoti Government Polytechnic, 413531, Latur, Maharashtra, India

    Sudhir Kanade

Authors
  1. Smita Sudhakar Palnitkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sudhir Kanade
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

The authors confirm contribution to the paper as follows and all authors reviewed the results and approved the final version of the manuscript.

Corresponding authors

Correspondence to Smita Sudhakar Palnitkar or Sudhir Kanade.

Ethics declarations

CONSENT FOR PUBLICATION

All contributors agreed and given consent to Publish.

CONFLICT OF INTEREST

The authors of this work declare that they have no conflicts of interest.

Additional information

Publisher’s Note.

Allerton Press remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Smita Sudhakar Palnitkar, Sudhir Kanade Q-Memory Task Routing to Prevent Deadlocks in Ethernet Control with Memory Crossbar Switching. Opt. Mem. Neural Networks 33, 72–85 (2024). https://doi.org/10.3103/S1060992X24010077

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1060992X24010077

Keywords:

Search

Navigation