CoNA: Dynamic application mapping for congestion reduction in many-core systems

Mohamamd Fattah, Marco Ramirez, Masoud Daneshtalab, Pasi Liljeberg, Juha Plosila
2012 2012 IEEE 30th International Conference on Computer Design (ICCD)  
Increasing the number of processors in a single chip toward network-based many-core systems requires a run-time task allocation algorithm. We propose an efficient mapping algorithm that assigns communicating tasks of incoming applications onto resources of a many-core system utilizing Network-on-Chip paradigm. In our contiguous neighborhood allocation (CoNA) algorithm, we target at the reduction of both internal and external congestion due to detrimental impact of congestion on the network
more » ... rmance. We approach the goal by keeping the mapped region contiguous and placing the communicating tasks in a close neighborhood. A completely synthesizable simulation environment where none of the system objects are assumed to be ideal is provided. Experiments show at least 40% gain in different mapping cost functions, as well as 16% reduction in average network latency compared to existing algorithms.
doi:10.1109/iccd.2012.6378665 dblp:conf/iccd/FattahRDLP12 fatcat:vlq2iraqefd4nclkc3hczpx6gu