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

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.