MARM-GA: Mapping Applications to Reconfigurable Mesh using Genetic Algorithm

Kullu, Pinar; Tosun, Suleyman

doi:10.1109/dsd.2019.00013

Cited by 9 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8 d , is an application‐specific communication, which is often used to test the efficiency of NoC design [24]. GAs are referred to [14, 18].…”

Section: Experiments Resultsmentioning

confidence: 99%

“…Different heuristic algorithms have been proposed in the literature which try to get the best answer in the limited computing resources, such as BMAP (batch Markovian arrival process), SMAP (smart mobile access point), NMAP (near‐optimal mapping), SA (simulated annealing algorithm), PSO (particle swarm optimisation), GA (genetic algorithm), ACO (ant colony optimisation), GHA (genetic‐based hyper‐heuristic algorithm), [7–15]. GA is a very efficient algorithm which is often used in NoC mapping solutions, [14, 16–18]. The authors of [16, 17] proposed to change the coding style of the chromosome.…”

Section: Introductionmentioning

confidence: 99%

“…The authors of [16, 17] proposed to change the coding style of the chromosome. The authors of [14, 18] proposed to change the way of crossover. All of them are aimed to solve the genetic inheritance of the mapping solutions which are based on GA.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Network‐on‐chip heuristic mapping algorithm based on isomorphism elimination for NoC optimisation

Weng

Liu

Yang

2020

IET Computers & Digital Techniques

View full text Add to dashboard Cite

“…8 d , is an application‐specific communication, which is often used to test the efficiency of NoC design [24]. GAs are referred to [14, 18].…”

Section: Experiments Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Network‐on‐chip heuristic mapping algorithm based on isomorphism elimination for NoC optimisation

Weng

Liu

Yang

2020

IET Computers & Digital Techniques

View full text Add to dashboard Cite

“…A few of the existing heuristic based mapping algorithms utilize evolutionary approaches like ant colony optimization (ACO), 17,18 particle swarm optimization (PSO), [19][20][21] and genetic algorithms. [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%

“…Further, they refined the mapping through a combination of genetic and simulated annealing algorithms. 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 .…”

Section: Related Workmentioning

confidence: 99%

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

Comparative Performance Analysis of Routing Topology for NoC Architecture

Satish¹,

Ramachandra²

2021

Emerging Research in Computing, Information, Communication and Applications

View full text Add to dashboard Cite

MARM-GA: Mapping Applications to Reconfigurable Mesh using Genetic Algorithm

Cited by 9 publications

References 12 publications

Network‐on‐chip heuristic mapping algorithm based on isomorphism elimination for NoC optimisation

Network‐on‐chip heuristic mapping algorithm based on isomorphism elimination for NoC optimisation

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

Comparative Performance Analysis of Routing Topology for NoC Architecture

Contact Info

Product

Resources

About