On pancyclicity properties of OTIS-mesh
In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementati...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2011-03, Vol.111 (8), p.353-359 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 359 |
|---|---|
| container_issue | 8 |
| container_start_page | 353 |
| container_title | Information processing letters |
| container_volume | 111 |
| creator | Shafiei, T. Hoseiny-Farahabady, M.R. Movaghar, A. Sarbazi-Azad, H. |
| description | In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph
G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-
G can embed any cycle of length
l,
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
|
G
|
2
}
.
► We use graph to model interconnection network. ► We prove pancyclicity in OTIS-mesh by considering two separate cases for 2-D and 3-D mesh for the factor graph
G of OTIS-G. ► Using construction method it is showed that if
G has
N nodes and at least one dimension of even radix, then OTIS-G contains any cycle of length
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
N
2
}
. |
| doi_str_mv | 10.1016/j.ipl.2010.11.027 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671264021</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019010003856</els_id><sourcerecordid>2257663851</sourcerecordid><originalsourceid>FETCH-LOGICAL-c387t-400d84dd69b88c7c9722c512efd27f357410dfc70805144565b167ae2a13c2093</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AG9FEL20zqRpkuJJFj8WFvbgeg7ZNMUs3bYmXWH_vakrHjx4GgaemXnnIeQSIUNAfrfJXN9kFMYeM6DiiExQCppyxPKYTAAopIAlnJKzEDYAwFkuJuRm2Sa9bs3eNM64YZ_0vuutH5wNSVcny9X8Nd3a8H5OTmrdBHvxU6fk7elxNXtJF8vn-exhkZpciiFlAJVkVcXLtZRGmFJQagqktq6oqPNCMISqNgIkFMhYwYs1cqEt1ZgbCmU-JbeHvTHHx86GQW1dMLZpdGu7XVCRRsoZUIzo1R900-18G9MpyUpalMhHCA-Q8V0I3taq926r_V4hqNGc2qhoTo3mFKKK5uLM9c9iHYxuah_9uPA7SHMZ3_rOen_gbBTy6axXwTjbGls5b82gqs79c-ULEAh_fg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>849259161</pqid></control><display><type>article</type><title>On pancyclicity properties of OTIS-mesh</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Shafiei, T. ; Hoseiny-Farahabady, M.R. ; Movaghar, A. ; Sarbazi-Azad, H.</creator><creatorcontrib>Shafiei, T. ; Hoseiny-Farahabady, M.R. ; Movaghar, A. ; Sarbazi-Azad, H.</creatorcontrib><description>In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph
G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-
G can embed any cycle of length
l,
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
|
G
|
2
}
.
► We use graph to model interconnection network. ► We prove pancyclicity in OTIS-mesh by considering two separate cases for 2-D and 3-D mesh for the factor graph
G of OTIS-G. ► Using construction method it is showed that if
G has
N nodes and at least one dimension of even radix, then OTIS-G contains any cycle of length
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
N
2
}
.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2010.11.027</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Applied sciences ; Computer networks ; Computer science; control theory; systems ; Cycle ; Embedding ; Exact sciences and technology ; Graph theory ; Graphs ; Information retrieval. Graph ; Interconnect ; Interconnection networks ; Mathematical problems ; Miscellaneous ; Networks ; Optical interconnects ; Optoelectronics ; OTIS-mesh ; Pancyclicity ; Path ; Studies ; Theoretical computing</subject><ispartof>Information processing letters, 2011-03, Vol.111 (8), p.353-359</ispartof><rights>2011 Elsevier B.V.</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 15, 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c387t-400d84dd69b88c7c9722c512efd27f357410dfc70805144565b167ae2a13c2093</citedby><cites>FETCH-LOGICAL-c387t-400d84dd69b88c7c9722c512efd27f357410dfc70805144565b167ae2a13c2093</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ipl.2010.11.027$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23897209$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Shafiei, T.</creatorcontrib><creatorcontrib>Hoseiny-Farahabady, M.R.</creatorcontrib><creatorcontrib>Movaghar, A.</creatorcontrib><creatorcontrib>Sarbazi-Azad, H.</creatorcontrib><title>On pancyclicity properties of OTIS-mesh</title><title>Information processing letters</title><description>In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph
G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-
G can embed any cycle of length
l,
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
|
G
|
2
}
.
► We use graph to model interconnection network. ► We prove pancyclicity in OTIS-mesh by considering two separate cases for 2-D and 3-D mesh for the factor graph
G of OTIS-G. ► Using construction method it is showed that if
G has
N nodes and at least one dimension of even radix, then OTIS-G contains any cycle of length
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
N
2
}
.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Computer networks</subject><subject>Computer science; control theory; systems</subject><subject>Cycle</subject><subject>Embedding</subject><subject>Exact sciences and technology</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Information retrieval. Graph</subject><subject>Interconnect</subject><subject>Interconnection networks</subject><subject>Mathematical problems</subject><subject>Miscellaneous</subject><subject>Networks</subject><subject>Optical interconnects</subject><subject>Optoelectronics</subject><subject>OTIS-mesh</subject><subject>Pancyclicity</subject><subject>Path</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AG9FEL20zqRpkuJJFj8WFvbgeg7ZNMUs3bYmXWH_vakrHjx4GgaemXnnIeQSIUNAfrfJXN9kFMYeM6DiiExQCppyxPKYTAAopIAlnJKzEDYAwFkuJuRm2Sa9bs3eNM64YZ_0vuutH5wNSVcny9X8Nd3a8H5OTmrdBHvxU6fk7elxNXtJF8vn-exhkZpciiFlAJVkVcXLtZRGmFJQagqktq6oqPNCMISqNgIkFMhYwYs1cqEt1ZgbCmU-JbeHvTHHx86GQW1dMLZpdGu7XVCRRsoZUIzo1R900-18G9MpyUpalMhHCA-Q8V0I3taq926r_V4hqNGc2qhoTo3mFKKK5uLM9c9iHYxuah_9uPA7SHMZ3_rOen_gbBTy6axXwTjbGls5b82gqs79c-ULEAh_fg</recordid><startdate>20110315</startdate><enddate>20110315</enddate><creator>Shafiei, T.</creator><creator>Hoseiny-Farahabady, M.R.</creator><creator>Movaghar, A.</creator><creator>Sarbazi-Azad, H.</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110315</creationdate><title>On pancyclicity properties of OTIS-mesh</title><author>Shafiei, T. ; Hoseiny-Farahabady, M.R. ; Movaghar, A. ; Sarbazi-Azad, H.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c387t-400d84dd69b88c7c9722c512efd27f357410dfc70805144565b167ae2a13c2093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Computer networks</topic><topic>Computer science; control theory; systems</topic><topic>Cycle</topic><topic>Embedding</topic><topic>Exact sciences and technology</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Information retrieval. Graph</topic><topic>Interconnect</topic><topic>Interconnection networks</topic><topic>Mathematical problems</topic><topic>Miscellaneous</topic><topic>Networks</topic><topic>Optical interconnects</topic><topic>Optoelectronics</topic><topic>OTIS-mesh</topic><topic>Pancyclicity</topic><topic>Path</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shafiei, T.</creatorcontrib><creatorcontrib>Hoseiny-Farahabady, M.R.</creatorcontrib><creatorcontrib>Movaghar, A.</creatorcontrib><creatorcontrib>Sarbazi-Azad, H.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shafiei, T.</au><au>Hoseiny-Farahabady, M.R.</au><au>Movaghar, A.</au><au>Sarbazi-Azad, H.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On pancyclicity properties of OTIS-mesh</atitle><jtitle>Information processing letters</jtitle><date>2011-03-15</date><risdate>2011</risdate><volume>111</volume><issue>8</issue><spage>353</spage><epage>359</epage><pages>353-359</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>In optoelectronic OTIS multicomputer networks (also known as Swapped networks), electrical and optical interconnects are used for local and global communication, respectively. An interesting instance of the OTIS multicomputers is the OTIS-mesh. Pancyclicity is of great importance in the implementation of a variety of parallel algorithms in multicomputers. This paper addresses the Pancyclicity problem of OTIS-mesh. More precisely, we prove that if the factor graph
G of an OTIS network is a 2-D or 3-D mesh with at least one even radix, OTIS-
G can embed any cycle of length
l,
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
|
G
|
2
}
.
► We use graph to model interconnection network. ► We prove pancyclicity in OTIS-mesh by considering two separate cases for 2-D and 3-D mesh for the factor graph
G of OTIS-G. ► Using construction method it is showed that if
G has
N nodes and at least one dimension of even radix, then OTIS-G contains any cycle of length
l
∈
{
4
,
6
,
7
,
8
,
9
,
…
,
N
2
}
.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2010.11.027</doi><tpages>7</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2011-03, Vol.111 (8), p.353-359 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671264021 |
| source | Elsevier ScienceDirect Journals Complete |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer networks Computer science control theory systems Cycle Embedding Exact sciences and technology Graph theory Graphs Information retrieval. Graph Interconnect Interconnection networks Mathematical problems Miscellaneous Networks Optical interconnects Optoelectronics OTIS-mesh Pancyclicity Path Studies Theoretical computing |
| title | On pancyclicity properties of OTIS-mesh |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T00%3A28%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20pancyclicity%20properties%20of%20OTIS-mesh&rft.jtitle=Information%20processing%20letters&rft.au=Shafiei,%20T.&rft.date=2011-03-15&rft.volume=111&rft.issue=8&rft.spage=353&rft.epage=359&rft.pages=353-359&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2010.11.027&rft_dat=%3Cproquest_cross%3E2257663851%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=849259161&rft_id=info:pmid/&rft_els_id=S0020019010003856&rfr_iscdi=true |