Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  apply flow maximization and develop a minimal adaptive routing scheme towards lor average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts beten packets that have been selected to have the same next hop path.  propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lors average packet latencies across all packet injection rates of an NoC.
['Ying-Cherng Lan', 'Michael C. Chen', 'Alan Su', 'Yu Hen Hu', 'Sao-Jie Chen']
I am writing a research paper on a idea Flow Maximization for NoC Routing Algorithms
[{"from": "human", "value": "I am writing a research paper on a idea Flow Maximization for NoC Routing Algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  apply flow maximization and develop a minimal adaptive routing scheme towards lor average packet latencies in a network-on-chip. The minimal adaptive algorithm allows packets to be forwarded in multiple directions. Typical routing algorithms select the next hop path for each packet and then resolve conflicts beten packets that have been selected to have the same next hop path.  propose a novel decision flow which combines routing direction and port arbitration while maximizing flow. Upon a 2-D mesh NoC, our implementation lors average packet latencies across all packet injection rates of an NoC."}]