Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies

On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal...

Full description

Saved in:
Bibliographic Details
Main Authors: Romanov, Aleksandr, Romanova, Irina, Ivannikov, Alexander
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Network topology
Parallel processing
Program processors
Search methods
Symmetric matrices
Topology
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 6
container_issue
container_start_page 1
container_title
container_volume
creator Romanov, Aleksandr
Romanova, Irina
Ivannikov, Alexander
description On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on a high-level programming language which makes it possible to generate quasi-optimal topological solutions in accordance with the requirements to reduce hardware costs and the average distance between nodes. Proposed quasioptimal topologies synthesis algorithm improvement by using the method of parallel computing allows speeding up the process of synthesis to 2 117 times and getting topologies with the number of nodes up to 18.
doi_str_mv 10.1109/EWDTS.2017.8110092
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8110092</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8110092</ieee_id><sourcerecordid>8110092</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-e2114cf81bc0bdc8a8059dd9001176b77c781089dd055a3c71147c3563dfef863</originalsourceid><addsrcrecordid>eNotUEtOwzAUNEhIlNILwMYHqItf0sTJsirlI4FYUAS7ynGcxuDaxnaB3oXDYqCrkeaNZt4MQmdAJwC0vlg8Xy4fJxkFNqkSQevsAJ1AkVdlntV1fogG2ZRlhJXwcoxGIbxSSqGEos5ggL5nzmkleFTWYNth-dXzbYjqQ-IguRf9GDeeG9Fjblrc2K1px9hxz7WWGgu7cduozPrvem9NlGTOvbZ4I2Nv24A763Hsk9nOJAgq_Ia8b3lQxLqoNlxjI-On9W_EGiJ65XC0zmq7VjKcoqOO6yBHexyip6vFcn5D7h6ub-ezO6KAFZHIDGAqugoaQZtWVLyiRd22daoJrGwYE6wCWiWKFgXPBUtyJvKizNtOdmmmITr_91VSypXz6S2_W-3HzH8AP_VsTw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies</title><source>IEEE Xplore All Conference Series</source><creator>Romanov, Aleksandr ; Romanova, Irina ; Ivannikov, Alexander</creator><creatorcontrib>Romanov, Aleksandr ; Romanova, Irina ; Ivannikov, Alexander</creatorcontrib><description>On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on a high-level programming language which makes it possible to generate quasi-optimal topological solutions in accordance with the requirements to reduce hardware costs and the average distance between nodes. Proposed quasioptimal topologies synthesis algorithm improvement by using the method of parallel computing allows speeding up the process of synthesis to 2 117 times and getting topologies with the number of nodes up to 18.</description><identifier>EISSN: 2472-761X</identifier><identifier>EISBN: 1538632993</identifier><identifier>EISBN: 9781538632994</identifier><identifier>DOI: 10.1109/EWDTS.2017.8110092</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Network topology ; Parallel processing ; Program processors ; Search methods ; Symmetric matrices ; Topology</subject><ispartof>2017 IEEE East-West Design &amp; Test Symposium (EWDTS), 2017, p.1-6</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8110092$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8110092$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Romanov, Aleksandr</creatorcontrib><creatorcontrib>Romanova, Irina</creatorcontrib><creatorcontrib>Ivannikov, Alexander</creatorcontrib><title>Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies</title><title>2017 IEEE East-West Design &amp; Test Symposium (EWDTS)</title><addtitle>EWDTS</addtitle><description>On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on a high-level programming language which makes it possible to generate quasi-optimal topological solutions in accordance with the requirements to reduce hardware costs and the average distance between nodes. Proposed quasioptimal topologies synthesis algorithm improvement by using the method of parallel computing allows speeding up the process of synthesis to 2 117 times and getting topologies with the number of nodes up to 18.</description><subject>Algorithm design and analysis</subject><subject>Network topology</subject><subject>Parallel processing</subject><subject>Program processors</subject><subject>Search methods</subject><subject>Symmetric matrices</subject><subject>Topology</subject><issn>2472-761X</issn><isbn>1538632993</isbn><isbn>9781538632994</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2017</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotUEtOwzAUNEhIlNILwMYHqItf0sTJsirlI4FYUAS7ynGcxuDaxnaB3oXDYqCrkeaNZt4MQmdAJwC0vlg8Xy4fJxkFNqkSQevsAJ1AkVdlntV1fogG2ZRlhJXwcoxGIbxSSqGEos5ggL5nzmkleFTWYNth-dXzbYjqQ-IguRf9GDeeG9Fjblrc2K1px9hxz7WWGgu7cduozPrvem9NlGTOvbZ4I2Nv24A763Hsk9nOJAgq_Ia8b3lQxLqoNlxjI-On9W_EGiJ65XC0zmq7VjKcoqOO6yBHexyip6vFcn5D7h6ub-ezO6KAFZHIDGAqugoaQZtWVLyiRd22daoJrGwYE6wCWiWKFgXPBUtyJvKizNtOdmmmITr_91VSypXz6S2_W-3HzH8AP_VsTw</recordid><startdate>201709</startdate><enddate>201709</enddate><creator>Romanov, Aleksandr</creator><creator>Romanova, Irina</creator><creator>Ivannikov, Alexander</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201709</creationdate><title>Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies</title><author>Romanov, Aleksandr ; Romanova, Irina ; Ivannikov, Alexander</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-e2114cf81bc0bdc8a8059dd9001176b77c781089dd055a3c71147c3563dfef863</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithm design and analysis</topic><topic>Network topology</topic><topic>Parallel processing</topic><topic>Program processors</topic><topic>Search methods</topic><topic>Symmetric matrices</topic><topic>Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Romanov, Aleksandr</creatorcontrib><creatorcontrib>Romanova, Irina</creatorcontrib><creatorcontrib>Ivannikov, Alexander</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Romanov, Aleksandr</au><au>Romanova, Irina</au><au>Ivannikov, Alexander</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies</atitle><btitle>2017 IEEE East-West Design &amp; Test Symposium (EWDTS)</btitle><stitle>EWDTS</stitle><date>2017-09</date><risdate>2017</risdate><spage>1</spage><epage>6</epage><pages>1-6</pages><eissn>2472-761X</eissn><eisbn>1538632993</eisbn><eisbn>9781538632994</eisbn><abstract>On the basis of an integrated network-on-chip (NoC) topologies optimality criterion, as well as applying the adjacency matrix to describe NoC topologies, exhaustive search method and its modification by using branch and bound and Monte-Carlo methods are extended to the synthesis of NoC quasi-optimal topologies. Designed ScaNoC suboptimal topology synthesis algorithm is implemented on a high-level programming language which makes it possible to generate quasi-optimal topological solutions in accordance with the requirements to reduce hardware costs and the average distance between nodes. Proposed quasioptimal topologies synthesis algorithm improvement by using the method of parallel computing allows speeding up the process of synthesis to 2 117 times and getting topologies with the number of nodes up to 18.</abstract><pub>IEEE</pub><doi>10.1109/EWDTS.2017.8110092</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2472-761X
ispartof 2017 IEEE East-West Design & Test Symposium (EWDTS), 2017, p.1-6
issn 2472-761X
language eng
recordid cdi_ieee_primary_8110092
source IEEE Xplore All Conference Series
subjects Algorithm design and analysis
Network topology
Parallel processing
Program processors
Search methods
Symmetric matrices
Topology
title Application of exhaustive search, branch and bound, parallel computing and Monte-Carlo methods for the synthesis of quasi-optimal network-on-chip topologies
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T20%3A29%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Application%20of%20exhaustive%20search,%20branch%20and%20bound,%20parallel%20computing%20and%20Monte-Carlo%20methods%20for%20the%20synthesis%20of%20quasi-optimal%20network-on-chip%20topologies&rft.btitle=2017%20IEEE%20East-West%20Design%20&%20Test%20Symposium%20(EWDTS)&rft.au=Romanov,%20Aleksandr&rft.date=2017-09&rft.spage=1&rft.epage=6&rft.pages=1-6&rft.eissn=2472-761X&rft_id=info:doi/10.1109/EWDTS.2017.8110092&rft.eisbn=1538632993&rft.eisbn_list=9781538632994&rft_dat=%3Cieee_CHZPO%3E8110092%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-e2114cf81bc0bdc8a8059dd9001176b77c781089dd055a3c71147c3563dfef863%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8110092&rfr_iscdi=true