The Task Of Multi-core Processors Routing Algorithm Mapping And Communication Research

As the development of the semiconductor, more and more IP cores have been integrated into a single chip. However, the connection of each IP core has been a huge challenge for the improvement of the chips. Recently, NoC has been proposed to solve this problem. It does not only bring high performance and low power consumption, but also the advantages of scalability and reusability. So this architecture has drawn more and more attention of the researchers. However, as the development of hardware, making a given application run on the NoC system with high efficiency has been a significant challenge.In this thesis, the main process for designing a complier is proposed, which can make a given application run on the NoC system with high efficiency. The thesis mainly discusses the mapping and routing process.In the mapping work, we optimized branch-and-bound algorithm and proposed the task-bonding algorithm. To reduce the searching space, the optimized algorithm binds the tasks together when they have a large communication in between. Experimental results show that the proposed algorithm can achieve high performance in a shorter time compared with the traditional brand-and-bound algorithm. For example, when mapping25tasks onto a5X5NoC system, with the same performance, only26.3%of runtime is used.In the routing algorithm, based on the traditional algorithm, we proposed the time division multiple access of the communication channel, which can reduce the demand of the bandwidth of the NoC system. To allocate and recycle the resource of the NoC system, the banker algorithm, which is widely used in operation system, is introduced. To obtain the minimum path for the communication process, the maze algorithm is used. Meanwhile, when there are multiple communication paths, three rules is used to choose a communication path. Experimental results show that the proposed algorithm can reduce the demand of the system bandwidth efficiently compared with the traditional routing algorithm. And when there are multiple communication paths, choosing the side one of the NoC system can reduce the block of communication.