Loading…
Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing
The architecture definition, design, and validation of the interconnect networks is a key step in the design of modern on-chip systems. This paper proposes a mathematical formulation of the problem of simultaneously defining the topology of the network and the message routes for the traffic among th...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 134 |
container_issue | |
container_start_page | 125 |
container_title | |
container_volume | |
creator | Nikitin, Nikita Chatterjee, Satrajit Cortadella, Jordi Kishinevsky, Mike Ogras, Umit |
description | The architecture definition, design, and validation of the interconnect networks is a key step in the design of modern on-chip systems. This paper proposes a mathematical formulation of the problem of simultaneously defining the topology of the network and the message routes for the traffic among the processing elements of the system. The solution of the problem meets the physical and performance constraints defined by the designer. The method guarantees that the generated solution is deadlock free. It is also capable of automatically discovering topologies that have been previously used in industrial systems. The applicability of the method has been validated by solving realistic size interconnect networks modeling the typical multiprocessor systems. |
doi_str_mv | 10.1109/NOCS.2010.22 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5507555</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5507555</ieee_id><sourcerecordid>5507555</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1702-fffefaaa835b8275e02203d7bfab9d831345ea77fdc4b42ed801e8ad8359a5cf3</originalsourceid><addsrcrecordid>eNpFjF1LwzAYhSMy0M3deedN_kBn8iYx6WUp6oTqxI_r8bZ9s0W7dLQdsn9vRcFzc3h4DoexSykWUor0-mmVvy5AjAhwwqZSg9ZWuBs4_QejJ2z6s0lBWbBnbN73H2KMNiAFnLPieXvsQ4VNkn1hR7wI8ZNnTdNWOIQ2cow1f2kPA_Gs78Mm7igO3Lcdz7dhzx8PzRD2XVvRKOPmgk08Nj3N_3rG3u9u3_JlUqzuH_KsSCppBSTee_KI6JQpHVhDAkCo2pYey7R2SiptCK31daVLDVQ7IcnhaEyKpvJqxq5-fwMRrfdd2GF3XBsjrDFGfQN0xk_U</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Nikitin, Nikita ; Chatterjee, Satrajit ; Cortadella, Jordi ; Kishinevsky, Mike ; Ogras, Umit</creator><creatorcontrib>Nikitin, Nikita ; Chatterjee, Satrajit ; Cortadella, Jordi ; Kishinevsky, Mike ; Ogras, Umit</creatorcontrib><description>The architecture definition, design, and validation of the interconnect networks is a key step in the design of modern on-chip systems. This paper proposes a mathematical formulation of the problem of simultaneously defining the topology of the network and the message routes for the traffic among the processing elements of the system. The solution of the problem meets the physical and performance constraints defined by the designer. The method guarantees that the generated solution is deadlock free. It is also capable of automatically discovering topologies that have been previously used in industrial systems. The applicability of the method has been validated by solving realistic size interconnect networks modeling the typical multiprocessor systems.</description><identifier>ISBN: 1424470854</identifier><identifier>ISBN: 9781424470853</identifier><identifier>EISBN: 1424470862</identifier><identifier>EISBN: 9781424470860</identifier><identifier>DOI: 10.1109/NOCS.2010.22</identifier><identifier>LCCN: 2010923727</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cost function ; Design automation ; Design optimization ; Linear programming ; Network topology ; Network-on-a-chip ; Routing ; Space exploration ; System recovery ; USA Councils</subject><ispartof>2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip, 2010, p.125-134</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5507555$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5507555$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nikitin, Nikita</creatorcontrib><creatorcontrib>Chatterjee, Satrajit</creatorcontrib><creatorcontrib>Cortadella, Jordi</creatorcontrib><creatorcontrib>Kishinevsky, Mike</creatorcontrib><creatorcontrib>Ogras, Umit</creatorcontrib><title>Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing</title><title>2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip</title><addtitle>NOCS</addtitle><description>The architecture definition, design, and validation of the interconnect networks is a key step in the design of modern on-chip systems. This paper proposes a mathematical formulation of the problem of simultaneously defining the topology of the network and the message routes for the traffic among the processing elements of the system. The solution of the problem meets the physical and performance constraints defined by the designer. The method guarantees that the generated solution is deadlock free. It is also capable of automatically discovering topologies that have been previously used in industrial systems. The applicability of the method has been validated by solving realistic size interconnect networks modeling the typical multiprocessor systems.</description><subject>Cost function</subject><subject>Design automation</subject><subject>Design optimization</subject><subject>Linear programming</subject><subject>Network topology</subject><subject>Network-on-a-chip</subject><subject>Routing</subject><subject>Space exploration</subject><subject>System recovery</subject><subject>USA Councils</subject><isbn>1424470854</isbn><isbn>9781424470853</isbn><isbn>1424470862</isbn><isbn>9781424470860</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFjF1LwzAYhSMy0M3deedN_kBn8iYx6WUp6oTqxI_r8bZ9s0W7dLQdsn9vRcFzc3h4DoexSykWUor0-mmVvy5AjAhwwqZSg9ZWuBs4_QejJ2z6s0lBWbBnbN73H2KMNiAFnLPieXvsQ4VNkn1hR7wI8ZNnTdNWOIQ2cow1f2kPA_Gs78Mm7igO3Lcdz7dhzx8PzRD2XVvRKOPmgk08Nj3N_3rG3u9u3_JlUqzuH_KsSCppBSTee_KI6JQpHVhDAkCo2pYey7R2SiptCK31daVLDVQ7IcnhaEyKpvJqxq5-fwMRrfdd2GF3XBsjrDFGfQN0xk_U</recordid><startdate>2010</startdate><enddate>2010</enddate><creator>Nikitin, Nikita</creator><creator>Chatterjee, Satrajit</creator><creator>Cortadella, Jordi</creator><creator>Kishinevsky, Mike</creator><creator>Ogras, Umit</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2010</creationdate><title>Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing</title><author>Nikitin, Nikita ; Chatterjee, Satrajit ; Cortadella, Jordi ; Kishinevsky, Mike ; Ogras, Umit</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1702-fffefaaa835b8275e02203d7bfab9d831345ea77fdc4b42ed801e8ad8359a5cf3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Cost function</topic><topic>Design automation</topic><topic>Design optimization</topic><topic>Linear programming</topic><topic>Network topology</topic><topic>Network-on-a-chip</topic><topic>Routing</topic><topic>Space exploration</topic><topic>System recovery</topic><topic>USA Councils</topic><toplevel>online_resources</toplevel><creatorcontrib>Nikitin, Nikita</creatorcontrib><creatorcontrib>Chatterjee, Satrajit</creatorcontrib><creatorcontrib>Cortadella, Jordi</creatorcontrib><creatorcontrib>Kishinevsky, Mike</creatorcontrib><creatorcontrib>Ogras, Umit</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>IEL</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>Nikitin, Nikita</au><au>Chatterjee, Satrajit</au><au>Cortadella, Jordi</au><au>Kishinevsky, Mike</au><au>Ogras, Umit</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing</atitle><btitle>2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip</btitle><stitle>NOCS</stitle><date>2010</date><risdate>2010</risdate><spage>125</spage><epage>134</epage><pages>125-134</pages><isbn>1424470854</isbn><isbn>9781424470853</isbn><eisbn>1424470862</eisbn><eisbn>9781424470860</eisbn><abstract>The architecture definition, design, and validation of the interconnect networks is a key step in the design of modern on-chip systems. This paper proposes a mathematical formulation of the problem of simultaneously defining the topology of the network and the message routes for the traffic among the processing elements of the system. The solution of the problem meets the physical and performance constraints defined by the designer. The method guarantees that the generated solution is deadlock free. It is also capable of automatically discovering topologies that have been previously used in industrial systems. The applicability of the method has been validated by solving realistic size interconnect networks modeling the typical multiprocessor systems.</abstract><pub>IEEE</pub><doi>10.1109/NOCS.2010.22</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 1424470854 |
ispartof | 2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip, 2010, p.125-134 |
issn | |
language | eng |
recordid | cdi_ieee_primary_5507555 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Cost function Design automation Design optimization Linear programming Network topology Network-on-a-chip Routing Space exploration System recovery USA Councils |
title | Physical-Aware Link Allocation and Route Assignment for Chip Multiprocessing |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T08%3A15%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Physical-Aware%20Link%20Allocation%20and%20Route%20Assignment%20for%20Chip%20Multiprocessing&rft.btitle=2010%20Fourth%20ACM/IEEE%20International%20Symposium%20on%20Networks-on-Chip&rft.au=Nikitin,%20Nikita&rft.date=2010&rft.spage=125&rft.epage=134&rft.pages=125-134&rft.isbn=1424470854&rft.isbn_list=9781424470853&rft_id=info:doi/10.1109/NOCS.2010.22&rft.eisbn=1424470862&rft.eisbn_list=9781424470860&rft_dat=%3Cieee_6IE%3E5507555%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1702-fffefaaa835b8275e02203d7bfab9d831345ea77fdc4b42ed801e8ad8359a5cf3%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=5507555&rfr_iscdi=true |