Research On Mapping And Routing Path Allocation Problems Of Network-on-chip

As the device feature size is continuously shrinking and the bandwidth requirements are increasing, traditional shared-bus architecture will no longer be able to meet the requirements of complex System-on-Chip(SoC) implementations. Meanwhile the inherently non-scalable nature of the shared-bus architecture, as well as its global clock synchronization nature will become the true show stoppers in most practical applications. Network-on-Chip(NoC) communication architectures have emerged as a promising new alternative to address the above problems associated with on-chip communication by employing a packet-based micro-network for microprocessors, DSPs, and memorizers inter-IPs communication. In contrast to shared-bus,NoC have the properties scalable, reuse and lower energy consuming. NoC platforms can be classified into three categories based on their flexibility for customization which are hard NoC, firm NoC and soft NoC. Relying on national 863 project"high performance computer and their key softwares". In this dissertation, we present solving methodologies for the key problems of mapping and routing path allocation in form NoC platform designing. The main work and achievements are as fllows:a) The problems in NoC architecture have been investigated in this dissertation and implementation technology differences have been analysised with parallel computing and computer network as the limitation of on-chip resources.b) A energy consuming model of NoC platforms at system level has been studied. With the model we can analysis and calculate energy consuming of the system conveniently. The model is the theory foundation of communication energy consuming optimization with mapping procedure.c) A mapping algorithm called MCEC based on A* searching is proposed in this dissertation,which is used to solve the mapping problem in the design of firm NoC platform. MCEC algorithm can find the solution to the problem with reasonable time consuming. The communication energy consuming of the system is minimized with application of the algorithm as well as meeting system performance constraint.d) A routing path allocation algorithm called RPA_LB based on particle swarm optimization is proposed in this dissertation, which is used to solve the communication load allocation disadvantage with in XY routing algorithm. Experiments show that the proposed algorithm can allocate communication loads efficiently and balance all links communication loads which can reduce the bandwidth requirements of the system as well as implementation cost.