Traffic aware scheduling algorithm for network on chip

Document Type

Conference Proceeding


Steady advancements in semiconductor technology over the past few decades have lead to researchers have proposed network-on-chip (NoC) as the on-chip communication model. An efficient NoC design methodology is based upon several key design choices, such as: network topology selection, good routing policy and efficient application to NoC mapping. In this paper a novel off-line non-preemptive static traffic aware scheduling (TAS) policy is proposed for hard NoC platforms. The proposed scheduling policy maps the application onto the NoC architecture keeping track of the network traffic, which is generated with every resource and communication path allocation. The main contribution of the proposed algorithm is that the application mapping and scheduling process are handled together and inter-process communication latency are dynamically calculated based on the application mapping and PE interaction. Our TAS algorithm has been evaluated for various design metrics such as application completion time, resource utilization and task throughput. Simulation results show significant improvements over traditional approaches.


Design methodology; Dynamic scheduling; Lead compounds; Network topology; Network-on-a-chip; Resource management; Routing; Scheduling algorithm; Telecommunication traffic; Traffic control


Controls and Control Theory | Electrical and Computer Engineering | Electrical and Electronics | Other Electrical and Computer Engineering | Signal Processing


Conference held: Las Vegas, NV, 27-29 April 2009


Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library