KL_GA: an application mapping algorithm for mesh-of-tree (MoT) architecture in network-on-chip design

As the very large-scale integrated circuit designs enter the deep sub-micron era, many-core processors are regarded as promising architectures to keep up with the Moore’s law. To provide effective communications between the on-chip components, network-on-chip was proposed as a new paradigm that exhi...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of supercomputing Vol. 71; no. 11; pp. 4056 - 4071
Main Authors Fang, Juan, Yu, Lu, Liu, Sitong, Lu, Jiajia, Chen, Tan
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2015
Subjects
Online AccessGet full text
ISSN0920-8542
1573-0484
1573-0484
DOI10.1007/s11227-015-1504-y

Cover

Abstract As the very large-scale integrated circuit designs enter the deep sub-micron era, many-core processors are regarded as promising architectures to keep up with the Moore’s law. To provide effective communications between the on-chip components, network-on-chip was proposed as a new paradigm that exhibits better scalability than the traditional buses. There have been previous researches on application mappings to reduce the power consumption, the network latency and the network area overhead. However, some of the previous proposed algorithms such as the Kernighan–Lin algorithm (KL) and some genetic algorithms (GA) have the problem of finding the local best result instead of a global optimal solution. In this paper, we propose a novel application mapping algorithm for the mesh-of-tree network topology, called KL_GA algorithm. Our proposed algorithm takes the advantage of both the Kernighan–Lin algorithm and genetic algorithms to reduce the overall communication cost. Our KL_GA algorithm first generates a mapping solution using a KL-based method. In order to avoid the appearance of premature phenomena, we next apply a GA-based algorithm to get rid of the population trapped in the local optimum and re-generate a new population. Our evaluations show that, compared to the random mapping algorithm, our KL_GA algorithm saves the power by 21.6 % and reduces the network latency by 16.3 % on the average.
AbstractList As the very large-scale integrated circuit designs enter the deep sub-micron era, many-core processors are regarded as promising architectures to keep up with the Moore’s law. To provide effective communications between the on-chip components, network-on-chip was proposed as a new paradigm that exhibits better scalability than the traditional buses. There have been previous researches on application mappings to reduce the power consumption, the network latency and the network area overhead. However, some of the previous proposed algorithms such as the Kernighan–Lin algorithm (KL) and some genetic algorithms (GA) have the problem of finding the local best result instead of a global optimal solution. In this paper, we propose a novel application mapping algorithm for the mesh-of-tree network topology, called KL_GA algorithm. Our proposed algorithm takes the advantage of both the Kernighan–Lin algorithm and genetic algorithms to reduce the overall communication cost. Our KL_GA algorithm first generates a mapping solution using a KL-based method. In order to avoid the appearance of premature phenomena, we next apply a GA-based algorithm to get rid of the population trapped in the local optimum and re-generate a new population. Our evaluations show that, compared to the random mapping algorithm, our KL_GA algorithm saves the power by 21.6 % and reduces the network latency by 16.3 % on the average.
Author Liu, Sitong
Fang, Juan
Yu, Lu
Lu, Jiajia
Chen, Tan
Author_xml – sequence: 1
  givenname: Juan
  surname: Fang
  fullname: Fang, Juan
  email: fangjuan@bjut.edu.cn
  organization: College of Computer Science, Beijing University of Technology
– sequence: 2
  givenname: Lu
  surname: Yu
  fullname: Yu, Lu
  organization: College of Computer Science, Beijing University of Technology
– sequence: 3
  givenname: Sitong
  surname: Liu
  fullname: Liu, Sitong
  organization: College of Computer Science, Beijing University of Technology
– sequence: 4
  givenname: Jiajia
  surname: Lu
  fullname: Lu, Jiajia
  organization: College of Computer Science, Beijing University of Technology
– sequence: 5
  givenname: Tan
  surname: Chen
  fullname: Chen, Tan
  organization: College of Computer Science, Beijing University of Technology
BookMark eNqNkMFOAjEQhhuDiYA-gLce9VBtd7u0eCNE0Yjxguem222X4tJu2hKyb-8inDwQT5PJzDfz5xuBgfNOA3BL8APBmD1GQrKMIUwKRApMUXcBhqRgOcKU0wEY4mmGES9odgVGMW4wxjRn-RDo96VYzJ6gdFC2bWOVTNY7uO0b62oom9oHm9ZbaHyAWx3XyBuUgtbw7sOv7qEMam2TVmkXNLQOOp32Pnwj71A_aGGlo63dNbg0son65lTH4OvleTV_RcvPxdt8tkSKTlhCmTE5L0uac8k4n1YVI31uRmSmJhXJZDExOeUl4SUuDJd5YSTVVaVKygqjjMrHIDve3blWdnvZNKINditDJwgWB1HiKEr0osRBlOh6iB0hFXyMQRuhbPrVkIK0zVmS_CH_8-0UMfa7rtZBbPwuuN7KGegHnJaQRA
CitedBy_id crossref_primary_10_1016_j_nancom_2017_11_002
crossref_primary_10_1007_s11227_016_1732_9
crossref_primary_10_1016_j_micpro_2022_104678
crossref_primary_10_1007_s11227_023_05700_7
crossref_primary_10_1016_j_sysarc_2021_102026
crossref_primary_10_1109_TNANO_2023_3237128
crossref_primary_10_1007_s11227_023_05127_0
crossref_primary_10_1587_elex_13_20151097
crossref_primary_10_1109_ACCESS_2019_2958945
crossref_primary_10_1109_TIE_2019_2926043
crossref_primary_10_3390_mi14030628
crossref_primary_10_1016_j_vlsi_2018_02_002
crossref_primary_10_1016_j_sysarc_2024_103064
crossref_primary_10_1007_s11227_019_03135_7
crossref_primary_10_1007_s11227_023_05078_6
crossref_primary_10_1142_S0218126619501135
crossref_primary_10_1631_FITEE_2200449
crossref_primary_10_1016_j_mejo_2022_105367
Cites_doi 10.1109/ISED.2012.17
10.1109/VLSID.2012.108
10.1016/j.sysarc.2010.10.001
10.1109/HPCC.2012.72
10.1016/j.advengsoft.2011.06.005
10.1016/j.sysarc.2013.08.012
10.1109/VLSISOC.2006.313219
10.1109/ISCAS.2010.5537920
10.1109/ISSOC.2005.1595630
10.23919/CJE.2014.10851854
10.1016/j.comnet.2012.06.015
10.1016/j.sysarc.2014.04.004
10.7873/DATE.2014.251
10.1109/DAC.2001.935594
10.1049/ip-cdt:20045092
10.1109/VLSISoC.2011.6081669
10.1109/MM.2007.4378783
10.1145/1028176.1006733
10.1109/TVLSI.2010.2091686
ContentType Journal Article
Copyright The Author(s) 2015
Copyright_xml – notice: The Author(s) 2015
DBID C6C
AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1007/s11227-015-1504-y
DatabaseName Springer Nature OA Free Journals
CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: C6C
  name: Springer Nature OA Free Journals
  url: http://www.springeropen.com/
  sourceTypes: Publisher
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-0484
EndPage 4071
ExternalDocumentID 10.1007/s11227-015-1504-y
10_1007_s11227_015_1504_y
GrantInformation_xml – fundername: National Natural Science Foundation of China (CN)
  grantid: 61202062
  funderid: http://dx.doi.org/10.13039/501100001809
– fundername: National Natural Science Foundation of China
  grantid: 61202076
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
123
199
1N0
1SB
2.D
203
28-
29L
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5QI
5VS
67Z
6NX
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDPE
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADMLS
ADQRH
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
B0M
BA0
BBWZM
BDATZ
BGNMA
BSONS
C6C
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EAD
EAP
EAS
EBD
EBLON
EBS
EDO
EIOEI
EJD
EMK
EPL
ESBYG
ESX
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAK
LLZTM
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WH7
WK8
YLTOR
Z45
Z7R
Z7X
Z7Z
Z83
Z88
Z8M
Z8N
Z8R
Z8T
Z8W
Z92
ZMTXR
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
ADTOC
UNPAY
ID FETCH-LOGICAL-c467t-2ff38bb438a7889dd7109271a2c6d12a56f348b18b05f8a35fa4eddcb475fcfc3
IEDL.DBID C6C
ISSN 0920-8542
1573-0484
IngestDate Tue Aug 19 17:32:25 EDT 2025
Wed Oct 01 06:04:06 EDT 2025
Thu Apr 24 22:52:27 EDT 2025
Fri Feb 21 02:27:42 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 11
Keywords NoC
Kernighan–Lin algorithm
Genetic algorithm
MoT topology
Language English
License cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c467t-2ff38bb438a7889dd7109271a2c6d12a56f348b18b05f8a35fa4eddcb475fcfc3
OpenAccessLink https://doi.org/10.1007/s11227-015-1504-y
PageCount 16
ParticipantIDs unpaywall_primary_10_1007_s11227_015_1504_y
crossref_citationtrail_10_1007_s11227_015_1504_y
crossref_primary_10_1007_s11227_015_1504_y
springer_journals_10_1007_s11227_015_1504_y
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2015-11-01
PublicationDateYYYYMMDD 2015-11-01
PublicationDate_xml – month: 11
  year: 2015
  text: 2015-11-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle An International Journal of High-Performance Computer Design, Analysis, and Use
PublicationTitle The Journal of supercomputing
PublicationTitleAbbrev J Supercomput
PublicationYear 2015
Publisher Springer US
Publisher_xml – name: Springer US
References Wang J, Li Y, Chai S, Peng Q (2011) Bandwidth-aware application mapping for NoC-based MPSoCs. J Comput Inf Syst 7(1):152–159
Sahu PK, Sharma A, Chattopadhyay S (2012) Application mapping onto mesh-of-tree based network-on-chip using discrete particle swarm optimization. In: Proceedings of international symposium on electronic system design, pp 172–176
Beltrame G, Sciuto D, Silvano C, Paulin P, Bensoudane E (2006) An application mapping methodology and case study for multi-processor on-chip architectures. In: Proceedings of IFIP WG 10.5 international conference on very large scale integration and system-on-chip, pp 146–151
WangJLiLWangZEnergy-efficient mapping for 3D NoC using logistic function based adaptive genetic algorithmsChin J Electron2014232254262
Bienia C, Li K (2009) Parsec 2.0: a new benchmark suite for chip-multiprocessors. In: Proceedings of the 5th annual workshop on modelling, benchmarking and simulation
Dally WJ, Towles B (2001) Route packets, not wires: on-chip interconnection networks. In: Proceedings of design automation conference, Las Vegas, pp 684–689
Shah N, Manna K, Chattopadhyay S (2011) An application mapping technique for butterfly-fat-tree network-on-chip. In: Proceedings of 2nd international conference on emerging applications of information technology (EAIT), pp 383–386
TosunSCluster-based application mapping method for network-on-chipAdv Eng Softw2011421086887410.1016/j.advengsoft.2011.06.005
Yu H, Ha Y, Veeravalli B (2010) Communication-aware application mapping and scheduling for NoC-based MPSoCs. In: Proceedings of IEEE international symposium on circuits and systems: nano-bio circuit fabrics and systems, pp 3232–3235
Shao J, Tian-Zhou C, Liu L (2012) Incremental run-time application mapping for heterogeneous network on chip. In: Proceedings of 14th IEEE international conference on high performance computing and communications (HPCC)
Ghosh A, Paul S, Bhunia S (2012) Energy-efficient application mapping in FPGA through computation in embedded memory blocks. In: Proceedings of the IEEE international conference on VLSI design, pp 424–429
Khalili F, Zarandi HR (2013) A reliability-aware multi-application mapping technique in networks-onchip. In: Proceedings of 21st Euromicro conference on parallel distributed and network-basedprocessing. IEEE, pp 478–485
Nurmi J (2005) Network-on-chip: a new paradigm for system-on-chip design. In: Proceedings of international symposium on system-on-chip, pp 2–6
TaylorMBLeeWMillerJEvaluation for the Raw microprocessor: an exposed-wire-delay architecture for ILP and streamsACM SIGARCH Comput Archit News200432221310.1145/1028176.1006733
Coskun Ç, Cüneyt FB (2013) Energy and buffer aware application mapping for networks-on-chip with self similar traffic. J Syst Archit 59(10):1364–1374
ZhangXChenXPhillipsCAchieving effective resilience for QoS-aware application mappingComput Netw201256143179319110.1016/j.comnet.2012.06.015
ZangMYouHLow power NOC process element mapping using genetic algorithmJ Inf Comput Sci201293557563
Çelik C, Bazlamaçci CF (2013) Energy and buffer aware application mapping for networks-on-chip with self similar traffic. J Syst Archit 59(10):1364–1374
Zhu D, Chen L, Yue S, Pedram M (2014) Application mapping for express channel-based networks-on-chip. In: Proceedings of design, automation and test in Europe (DATE)
KahngABLiBPehLSORION 2.0: a power-area simulator for interconnection networksIEEE Trans Very Large Scale Integr Syst201220l19119610.1109/TVLSI.2010.2091686
HoskoteYVangalSSinghAA 5-GHz mesh interconnect for a teraflop processorIEEE Micro2007275516110.1109/MM.2007.4378783
SahuPKMannaKExtending Kernighan-Lin partitioning heuristic for application mapping onto network-on-chipJ Syst Archit201460756257810.1016/j.sysarc.2014.04.004
TosunSNew heuristic algorithms for energy aware application mapping and routing on mesh-based NoCsJ Syst Archit2011571697810.1016/j.sysarc.2010.10.001
HuJMarculescuRCommunication and task scheduling of application-specific networks-on-chipIEEE Proc Comput Digit Tech2005152564365110.1049/ip-cdt:20045092
Jing N, He W, Mao Z (2011) A general statistical estimation for application mapping in network-on-chip. In: Proceedings of IEEE/IFIP 19th international conference on VLSI and system-on-chip (VLSI–SoC), pp 172–175
J Hu (1504_CR23) 2005; 152
1504_CR25
M Zang (1504_CR15) 2012; 9
1504_CR21
1504_CR20
S Tosun (1504_CR12) 2011; 42
1504_CR22
1504_CR7
1504_CR6
1504_CR9
X Zhang (1504_CR19) 2012; 56
S Tosun (1504_CR8) 2011; 57
PK Sahu (1504_CR10) 2014; 60
MB Taylor (1504_CR3) 2004; 32
AB Kahng (1504_CR24) 2012; 20
1504_CR13
1504_CR16
1504_CR18
1504_CR17
1504_CR2
1504_CR5
Y Hoskote (1504_CR4) 2007; 27
J Wang (1504_CR14) 2014; 23
1504_CR1
1504_CR11
References_xml – reference: Khalili F, Zarandi HR (2013) A reliability-aware multi-application mapping technique in networks-onchip. In: Proceedings of 21st Euromicro conference on parallel distributed and network-basedprocessing. IEEE, pp 478–485
– reference: Yu H, Ha Y, Veeravalli B (2010) Communication-aware application mapping and scheduling for NoC-based MPSoCs. In: Proceedings of IEEE international symposium on circuits and systems: nano-bio circuit fabrics and systems, pp 3232–3235
– reference: Dally WJ, Towles B (2001) Route packets, not wires: on-chip interconnection networks. In: Proceedings of design automation conference, Las Vegas, pp 684–689
– reference: Coskun Ç, Cüneyt FB (2013) Energy and buffer aware application mapping for networks-on-chip with self similar traffic. J Syst Archit 59(10):1364–1374
– reference: Zhu D, Chen L, Yue S, Pedram M (2014) Application mapping for express channel-based networks-on-chip. In: Proceedings of design, automation and test in Europe (DATE)
– reference: ZangMYouHLow power NOC process element mapping using genetic algorithmJ Inf Comput Sci201293557563
– reference: Jing N, He W, Mao Z (2011) A general statistical estimation for application mapping in network-on-chip. In: Proceedings of IEEE/IFIP 19th international conference on VLSI and system-on-chip (VLSI–SoC), pp 172–175
– reference: Shah N, Manna K, Chattopadhyay S (2011) An application mapping technique for butterfly-fat-tree network-on-chip. In: Proceedings of 2nd international conference on emerging applications of information technology (EAIT), pp 383–386
– reference: ZhangXChenXPhillipsCAchieving effective resilience for QoS-aware application mappingComput Netw201256143179319110.1016/j.comnet.2012.06.015
– reference: TaylorMBLeeWMillerJEvaluation for the Raw microprocessor: an exposed-wire-delay architecture for ILP and streamsACM SIGARCH Comput Archit News200432221310.1145/1028176.1006733
– reference: HoskoteYVangalSSinghAA 5-GHz mesh interconnect for a teraflop processorIEEE Micro2007275516110.1109/MM.2007.4378783
– reference: SahuPKMannaKExtending Kernighan-Lin partitioning heuristic for application mapping onto network-on-chipJ Syst Archit201460756257810.1016/j.sysarc.2014.04.004
– reference: Beltrame G, Sciuto D, Silvano C, Paulin P, Bensoudane E (2006) An application mapping methodology and case study for multi-processor on-chip architectures. In: Proceedings of IFIP WG 10.5 international conference on very large scale integration and system-on-chip, pp 146–151
– reference: Çelik C, Bazlamaçci CF (2013) Energy and buffer aware application mapping for networks-on-chip with self similar traffic. J Syst Archit 59(10):1364–1374
– reference: KahngABLiBPehLSORION 2.0: a power-area simulator for interconnection networksIEEE Trans Very Large Scale Integr Syst201220l19119610.1109/TVLSI.2010.2091686
– reference: Ghosh A, Paul S, Bhunia S (2012) Energy-efficient application mapping in FPGA through computation in embedded memory blocks. In: Proceedings of the IEEE international conference on VLSI design, pp 424–429
– reference: Bienia C, Li K (2009) Parsec 2.0: a new benchmark suite for chip-multiprocessors. In: Proceedings of the 5th annual workshop on modelling, benchmarking and simulation
– reference: TosunSNew heuristic algorithms for energy aware application mapping and routing on mesh-based NoCsJ Syst Archit2011571697810.1016/j.sysarc.2010.10.001
– reference: HuJMarculescuRCommunication and task scheduling of application-specific networks-on-chipIEEE Proc Comput Digit Tech2005152564365110.1049/ip-cdt:20045092
– reference: TosunSCluster-based application mapping method for network-on-chipAdv Eng Softw2011421086887410.1016/j.advengsoft.2011.06.005
– reference: Nurmi J (2005) Network-on-chip: a new paradigm for system-on-chip design. In: Proceedings of international symposium on system-on-chip, pp 2–6
– reference: Wang J, Li Y, Chai S, Peng Q (2011) Bandwidth-aware application mapping for NoC-based MPSoCs. J Comput Inf Syst 7(1):152–159
– reference: Sahu PK, Sharma A, Chattopadhyay S (2012) Application mapping onto mesh-of-tree based network-on-chip using discrete particle swarm optimization. In: Proceedings of international symposium on electronic system design, pp 172–176
– reference: Shao J, Tian-Zhou C, Liu L (2012) Incremental run-time application mapping for heterogeneous network on chip. In: Proceedings of 14th IEEE international conference on high performance computing and communications (HPCC)
– reference: WangJLiLWangZEnergy-efficient mapping for 3D NoC using logistic function based adaptive genetic algorithmsChin J Electron2014232254262
– ident: 1504_CR22
  doi: 10.1109/ISED.2012.17
– ident: 1504_CR21
  doi: 10.1109/VLSID.2012.108
– volume: 9
  start-page: 557
  issue: 3
  year: 2012
  ident: 1504_CR15
  publication-title: J Inf Comput Sci
– volume: 57
  start-page: 69
  issue: 1
  year: 2011
  ident: 1504_CR8
  publication-title: J Syst Archit
  doi: 10.1016/j.sysarc.2010.10.001
– ident: 1504_CR25
– ident: 1504_CR5
  doi: 10.1109/HPCC.2012.72
– volume: 42
  start-page: 868
  issue: 10
  year: 2011
  ident: 1504_CR12
  publication-title: Adv Eng Softw
  doi: 10.1016/j.advengsoft.2011.06.005
– ident: 1504_CR7
  doi: 10.1016/j.sysarc.2013.08.012
– ident: 1504_CR20
  doi: 10.1109/VLSISOC.2006.313219
– ident: 1504_CR18
  doi: 10.1109/ISCAS.2010.5537920
– ident: 1504_CR2
  doi: 10.1109/ISSOC.2005.1595630
– volume: 23
  start-page: 254
  issue: 2
  year: 2014
  ident: 1504_CR14
  publication-title: Chin J Electron
  doi: 10.23919/CJE.2014.10851854
– ident: 1504_CR16
– volume: 56
  start-page: 3179
  issue: 14
  year: 2012
  ident: 1504_CR19
  publication-title: Comput Netw
  doi: 10.1016/j.comnet.2012.06.015
– ident: 1504_CR6
– volume: 60
  start-page: 562
  issue: 7
  year: 2014
  ident: 1504_CR10
  publication-title: J Syst Archit
  doi: 10.1016/j.sysarc.2014.04.004
– ident: 1504_CR9
  doi: 10.7873/DATE.2014.251
– ident: 1504_CR13
  doi: 10.1016/j.sysarc.2013.08.012
– ident: 1504_CR1
  doi: 10.1109/DAC.2001.935594
– volume: 152
  start-page: 643
  issue: 5
  year: 2005
  ident: 1504_CR23
  publication-title: IEEE Proc Comput Digit Tech
  doi: 10.1049/ip-cdt:20045092
– ident: 1504_CR17
  doi: 10.1109/VLSISoC.2011.6081669
– volume: 27
  start-page: 51
  issue: 5
  year: 2007
  ident: 1504_CR4
  publication-title: IEEE Micro
  doi: 10.1109/MM.2007.4378783
– ident: 1504_CR11
– volume: 32
  start-page: 2
  issue: 2
  year: 2004
  ident: 1504_CR3
  publication-title: ACM SIGARCH Comput Archit News
  doi: 10.1145/1028176.1006733
– volume: 20
  start-page: 191
  issue: l
  year: 2012
  ident: 1504_CR24
  publication-title: IEEE Trans Very Large Scale Integr Syst
  doi: 10.1109/TVLSI.2010.2091686
SSID ssj0004373
Score 2.202217
Snippet As the very large-scale integrated circuit designs enter the deep sub-micron era, many-core processors are regarded as promising architectures to keep up with...
SourceID unpaywall
crossref
springer
SourceType Open Access Repository
Enrichment Source
Index Database
Publisher
StartPage 4056
SubjectTerms Compilers
Computer Science
Interpreters
Processor Architectures
Programming Languages
SummonAdditionalLinks – databaseName: Unpaywall
  dbid: UNPAY
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB7R5dD2UOhLpVDkQw8tlZfYsRMvtxUqRbSgHlgJTpGfgLrrrCCravvrsfOALUJUFWdPRs54Yo8z33wD8DFNpGKMOkwzl2DmSIaVowMcKQyJI3lmRax3PjzK9kfs4ISfLMFuVwtTo927lGRT0xBZmny1PTVu-7bwjVAaIZMch4CG4Xk_jD6B5YyHgLwHy6Ojn8PTmmUvXI4Er1voEJ6nOPgr63Kb9-n5-3Tq5vEcns78VM5_y_F44fTZWwHTzbsBnfzqzyrV13_uUDo-8sVW4UUbnaJh404vYcn6V7DSdX5A7UbwGuz3H8W34Q6SHi1kwNFERraHMyTHZ-XlRXU-QSEkRhN7dY5Lh2P-G306LI8_o8X0BbrwyDdgdFx6HAamyNS4kjcw2vt6vLuP24YNWIf9tsLUuVQoxVIhw816YEwEetKcSKozQ6jkmUuZUESohDshU-4ks8ZoxXLutNPpW-j50tt3gIRyLsmsTvKBZELHOpaEm9guTRMb1K1B0i1UoVs289hUY1zc8jBHUxbBlEU0ZTFfg62bR6YNlcdDwl-6xSrar_rqQekbB_m37vf_Jb0Oz2jtD_G3zwb0qsuZ_RACoUptto5-DcHx_vI
  priority: 102
  providerName: Unpaywall
Title KL_GA: an application mapping algorithm for mesh-of-tree (MoT) architecture in network-on-chip design
URI https://link.springer.com/article/10.1007/s11227-015-1504-y
https://link.springer.com/content/pdf/10.1007/s11227-015-1504-y.pdf
UnpaywallVersion publishedVersion
Volume 71
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: EBSCOhost Academic Search Ultimate
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 1573-0484
  dateEnd: 20241102
  omitProxy: true
  ssIdentifier: ssj0004373
  issn: 1573-0484
  databaseCode: ABDBF
  dateStart: 20030501
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 20241102
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 1573-0484
  databaseCode: ADMLS
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVLSH
  databaseName: SpringerLink Journals
  customDbUrl:
  mediaType: online
  eissn: 1573-0484
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 1573-0484
  databaseCode: AFBBN
  dateStart: 19970101
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAVX
  databaseName: SpringerLINK - Czech Republic Consortium
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004373
  issn: 1573-0484
  databaseCode: AGYKE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://link.springer.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: SpringerLink Journals (ICM)
  customDbUrl:
  eissn: 1573-0484
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0004373
  issn: 1573-0484
  databaseCode: U2A
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://www.springerlink.com/journals/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELagHYCBN6K85IGBhywSx3EdtoBaEKUVA5XaKbIdu0Vqk4q2Qv332E0CBSEQSyIlzg13du7s7-47AE49hwtCsEaYagcR7VIkNA6QpTB0tVulitl652aL3rfJQ8fv5GTRthbmG35_NTbxALbJkT4yoQtBs2VQNj6KznFZevtZAullYHJgdkPMJ7gAMH8S8dUFFfjnGliZJiM-e-ODwYKLqW-C9Tw2hGFmzC2wpJJtsFH0XYD5MtwBqvEY3YXXkCdwAX-GQ265FnqQD3qp2fL3h9AEpHCoxn2UamTRZ3jWTJ_P4SJ4AF8SmGSp4ChNkHkxgvE8q2MXtOu159t7lLdLQNL87SYIa-0xIYjHuNnXBnFs0yxx1eVY0tjF3KfaI0y4TDi-ZtzzNScqjqUgVV9LLb09UErSRO0DyITWDlXSqQacMGmrSBw_ts3KpKuMuApwCg1GMucSty0tBtEnC7JVemSUHlmlR7MKuPj4ZJQRafw2-LIwS5SvqfGvoz8s97fsg3_JPgSreD5z7KHLEShNXqfq2IQhE3ECymH95qZl73fdRu1kPiHNtY1D86zdegq77_-K1_4
linkProvider Springer Nature
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZgHIADb8R45sCBh4LaNO0ybhMCBts4DQlOVZImgNjaaeuExq8nWVs2EAJxbuq2jpPY_ezPAIeewwWlRGMSaAdT7QZYaFLFlsLQ1W4lUMzWO7fugvo9vX3wH_I67kGR7V5AkuOdelLs5hJi0yR9bJwYikezMEdNfEJKMFe7fmxcTsohvQxYrprIiPmUFGDmT0K-HkfFgxdhfhj3-OiNdzpTx83VMrSLF82yTF7Phqk4k-_fOBz_-SUrsJS7n6iW2csqzKh4DZaL1g4oX-nroBrN8Lp2jniMpiBu1OWWzuEJ8c5T0n9Jn7vI-LyoqwbPONHYAtzoqJW0j9E0PoFeYhRn2eY4ibG50EPROHFkA-6vLtsXdZx3ZMDSbKgpJlp7TAjqMW5C52oU2UxOUnE5kUHkEu4H2qNMuEw4vmbc8zWnKoqkoBVfSy29TSjFSay2ADGhtRMo6VSqnDJpC1UcP7L90KSrjLgyOMXEhDKnK7ddMzrhhGjZqjE0agytGsNRGU4-b-llXB2_DT4tJifMl-3g19GfBvG37O1_yT6A-Xq71QybN3eNHVggY7uw_3h2oZT2h2rPeD2p2M-t_ANDcfZi
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELWgSCwHdkRZfeDAIquJ46QuN1QohS7iQKXeItuxoVLrVG0Q6t9jN0lbJATiHGcUjZcZ5828B8CF5zBOCFYIB8pBRLkB4gpXkKUwdJVbDiS1_c6tdlDvkOeu3810Tsd5tXsOSaY9DZalSSelYaRK88Y3F2NbMukjk9AQNFkGK8QENythUA2q88ZIL4WYK-aORH2Cc1jzJxPfA1P-CRtg7UMP2eST9fsLgae2DTazjBHepVO8A5ak3gVbuRoDzDbnHpCNZvh4dwuZhguoNBwwy8DwBln_LR71kvcBNGkqHMjxO4oVspg0vGzFr1dwEVKAPQ11WiCOYo3MgyGMprUe-6BTe3it1lEmooCEOQMThJXyKOfEo8zcditRZIsvcdllWASRi5kfKI9Q7lLu-Ioyz1eMyCgSnJR9JZTwDkBBx1oeAki5Uk4ghVOuMEKF7S1x_MhKmAlXGnNF4OQeDEXGMG6FLvrhnBvZOj00Tg-t08NJEVzPXhmm9Bq_Db7JpyXMdtr419Gzmfvb9tG_bJ-D1Zf7Wth8ajeOwTqeLiL7V-YEFJLRhzw1eUrCz6Zr8Qt8vt2L
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT9wwEB7R5dD2UOhLpVDkQw8tlZfYsRMvtxUqRbSgHlgJTpGfgLrrrCCravvrsfOALUJUFWdPRs54Yo8z33wD8DFNpGKMOkwzl2DmSIaVowMcKQyJI3lmRax3PjzK9kfs4ISfLMFuVwtTo927lGRT0xBZmny1PTVu-7bwjVAaIZMch4CG4Xk_jD6B5YyHgLwHy6Ojn8PTmmUvXI4Er1voEJ6nOPgr63Kb9-n5-3Tq5vEcns78VM5_y_F44fTZWwHTzbsBnfzqzyrV13_uUDo-8sVW4UUbnaJh404vYcn6V7DSdX5A7UbwGuz3H8W34Q6SHi1kwNFERraHMyTHZ-XlRXU-QSEkRhN7dY5Lh2P-G306LI8_o8X0BbrwyDdgdFx6HAamyNS4kjcw2vt6vLuP24YNWIf9tsLUuVQoxVIhw816YEwEetKcSKozQ6jkmUuZUESohDshU-4ks8ZoxXLutNPpW-j50tt3gIRyLsmsTvKBZELHOpaEm9guTRMb1K1B0i1UoVs289hUY1zc8jBHUxbBlEU0ZTFfg62bR6YNlcdDwl-6xSrar_rqQekbB_m37vf_Jb0Oz2jtD_G3zwb0qsuZ_RACoUptto5-DcHx_vI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=KL_GA%3A+an+application+mapping+algorithm+for+mesh-of-tree+%28MoT%29+architecture+in+network-on-chip+design&rft.jtitle=The+Journal+of+supercomputing&rft.au=Fang%2C+Juan&rft.au=Yu%2C+Lu&rft.au=Liu%2C+Sitong&rft.au=Lu%2C+Jiajia&rft.date=2015-11-01&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=71&rft.issue=11&rft.spage=4056&rft.epage=4071&rft_id=info:doi/10.1007%2Fs11227-015-1504-y&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s11227_015_1504_y
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon