%0 Conference Proceedings
%T KLSAT: An Application Mapping Algorithm Based on Kernighan–Lin Partition and Simulated Annealing for a Specific WK-Recursive NoC Architecture
%+ Beijing Institute of Technology (BIT)
%+ Henan University of Economics and Law
%A Wang, Xiaojun
%A Shi, Feng
%A Zhang, Hong
%Z Part 2: NOC and Networks
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 16th IFIP International Conference on Network and Parallel Computing (NPC)
%C Hohhot, China
%Y Xiaoxin Tang
%Y Quan Chen
%Y Pradip Bose
%Y Weiming Zheng
%Y Jean-Luc Gaudiot
%I Springer International Publishing
%3 Network and Parallel Computing
%V LNCS-11783
%P 31-42
%8 2019-08-23
%D 2019
%R 10.1007/978-3-030-30709-7_3
%K WK-recursive network
%K Kernighan–Lin algorithm
%K Simulated annealing algorithm
%K Application mapping
%K Network-on-Chip
%Z Computer Science [cs]Conference papers
%X Application mapping is a critical phase in NoC design because of the running time, the network latency and the power consumption. In order to reduce these problems of applications running on multicore architecture, we propose a novel application mapping algorithm, called KLSAT mapping algorithm. It is used for the triplet-based architecture (TriBA) topology which is WK-recursive based networks well conform to a modular design due to the properties of regularity and scalability. The KLSAT mapping algorithm exploits the advantage of both the Kernighan–Lin partitioning algorithm and simulated annealing algorithm to reduce the overall power consumption and network latency. Compared to the random mapping algorithm, the experiment results reveal that the solutions generated by the proposed mapping algorithm reduce average power consumption and network latency by 6.4%, 12.2% in mapping 27 cores and 29.5%, 26.7% in mapping 81 cores respectively.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-03770573/document
%2 https://inria.hal.science/hal-03770573/file/486810_1_En_3_Chapter.pdf
%L hal-03770573
%U https://inria.hal.science/hal-03770573
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-11783