Thread allocation in CMP-based multithreaded network processors
This work tries to derive ideas for thread allocation in CMP-based network processors performing general applications by Continuous-Time Markov Chain modeling and Petri net simulations. The concept of PM ratio, where P and M indicate the computational and memory access overhead when processing a packet, is introduced and the relation to thread allocation is explored. Results indicate that the demand of threads in a processor diminishes rapidly as PM ratio increases to 0.066, and decreases slowly afterwards. Observations from a certain PM ratio can be applied to various softwarehardware combinations having the same ratio.
network processor markov chain petri net chip multiprocessor