An enhanced cost-aware mapping algorithm based on improved shuffled frog leaping in network on chips

Boroumand, Bahador; Yaghoubi, Elham; Barekatain, Behrang

doi:10.1007/s11227-020-03271-5

Cited by 11 publications

(3 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge,

SpecMap

is the first static mapping technique that supports multi‐tasking. Therefore, for comparison, we used a few well‐known mono‐tasking algorithms NMAP, 10 ONMAP, 48 PSO, 19 ISFLA, 26 and cluster (the cluster‐based algorithm for static mapping) 7 . The simulation environment and performance analysis are described in the following subsections.…”

Section: Resultsmentioning

confidence: 99%

“…[22][23][24] Recently, application mapping also adopted many of the bio-inspired based search algorithms. [25][26][27][28] These evolutionary approaches face some difficulties such as slower convergence and higher CPU time.…”

Section: Related Workmentioning

confidence: 99%

“…A few of the existing heuristic based mapping algorithms utilize evolutionary approaches like ant colony optimization (ACO), 17,18 particle swarm optimization (PSO), 19‐21 and genetic algorithms 22‐24 . Recently, application mapping also adopted many of the bio‐inspired based search algorithms 25‐28 . These evolutionary approaches face some difficulties such as slower convergence and higher CPU time.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

SpecMap: An efficient spectral partitioning based static application mapping algorithm for 2D mesh NoCs

R.S.

Jayaraj

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryNetwork‐on‐chip (NoC) is adopted as a flexible and effective communication backbone by multiprocessor systems with core counts ranging from a few to hundreds. The performance of NoC based systems greatly rely on the communication between cores when two dependent tasks of an application are mapped to these cores. Hence, application mapping becomes a critical issue in NoC‐based systems as it affects the overall performance of the system. Application mapping aims to reduce the communication among the cores by carefully mapping the highly communicating tasks. Most of the existing static mapping approaches consider only single‐task platforms. In this article, we propose an efficient multi‐task static mapping algorithm called , for regular 2D NoC systems. consists of three stages namely, (i) graph partitioning, (ii) topology clustering, and (iii) mapping. In the graph partitioning stage, accurately identifies and groups the highly communicating tasks based on spectral graph partitioning. Then, the clustering and mapping stages allocate the most communicating tasks in the same or adjacent multi‐tasking cores. It also eliminates the interference between multiple applications by mapping them into different clusters of the NoC network. Simulations of have been conducted on different synthetic and real‐life applications using Gem5 simulator. The simulation results show considerable improvements for SpecMap in terms of communication cost, average network latency, energy consumption, throughput, and execution time as compared to the state‐of‐the‐art algorithms.

show abstract

“…To the best of our knowledge,