Node Mapping Algorithm between Torus and Petersen-Torus Networks

In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing sys...

Full description

Saved in:
Bibliographic Details
Main Authors: Jung-hyun Seo, HyeongOk Lee, Moon-Suk Jang, Soon-Hee Han
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computers
Embedding
Hypercubes
Interconnection Network
Joining processes
Multiprocessor interconnection
Parallel algorithms
Petersen-Torus
Routing
Torus
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 544
container_issue
container_start_page 540
container_title
container_volume 1
creator Jung-hyun Seo
HyeongOk Lee
Moon-Suk Jang
Soon-Hee Han
description In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.
doi_str_mv 10.1109/NCM.2008.50
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4624066</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4624066</ieee_id><sourcerecordid>4624066</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-de2f68fe027f4e3f10541c9ab84ae30844e68b9e338935016251f5cd234fe33e3</originalsourceid><addsrcrecordid>eNotzEFLwzAYxvGADHRzJ49e8gVa3-RN0uTmKOqErXqY55Gub2Z1a0tSEb-9k3l64MfDn7EbAbkQ4O6qcp1LAJtruGBTKIzTiFKKCZv-sZMWC3fJ5il9AIBwpgAnr9h91TfE134Y2m7PF4d9H9vx_chrGr-JOr7p41fivmv4K40UE3XZmarToY-f6ZpNgj8kmv_vjL09PmzKZbZ6eXouF6usFYUes4ZkMDYQyCIowiBAK7FzvrbKE4JVioytHSFahxqEkVoEvWskqnBCwhm7PXdbItoOsT36-LNVRiowBn8BmXBH_A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Node Mapping Algorithm between Torus and Petersen-Torus Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Jung-hyun Seo ; HyeongOk Lee ; Moon-Suk Jang ; Soon-Hee Han</creator><creatorcontrib>Jung-hyun Seo ; HyeongOk Lee ; Moon-Suk Jang ; Soon-Hee Han</creatorcontrib><description>In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.</description><identifier>ISBN: 0769533221</identifier><identifier>ISBN: 9780769533223</identifier><identifier>DOI: 10.1109/NCM.2008.50</identifier><identifier>LCCN: 2008928379</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Computers ; Embedding ; Hypercubes ; Interconnection Network ; Joining processes ; Multiprocessor interconnection ; Parallel algorithms ; Petersen-Torus ; Routing ; Torus</subject><ispartof>2008 Fourth International Conference on Networked Computing and Advanced Information Management, 2008, Vol.1, p.540-544</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/4624066$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4624066$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jung-hyun Seo</creatorcontrib><creatorcontrib>HyeongOk Lee</creatorcontrib><creatorcontrib>Moon-Suk Jang</creatorcontrib><creatorcontrib>Soon-Hee Han</creatorcontrib><title>Node Mapping Algorithm between Torus and Petersen-Torus Networks</title><title>2008 Fourth International Conference on Networked Computing and Advanced Information Management</title><addtitle>NCM</addtitle><description>In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.</description><subject>Algorithm design and analysis</subject><subject>Computers</subject><subject>Embedding</subject><subject>Hypercubes</subject><subject>Interconnection Network</subject><subject>Joining processes</subject><subject>Multiprocessor interconnection</subject><subject>Parallel algorithms</subject><subject>Petersen-Torus</subject><subject>Routing</subject><subject>Torus</subject><isbn>0769533221</isbn><isbn>9780769533223</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzEFLwzAYxvGADHRzJ49e8gVa3-RN0uTmKOqErXqY55Gub2Z1a0tSEb-9k3l64MfDn7EbAbkQ4O6qcp1LAJtruGBTKIzTiFKKCZv-sZMWC3fJ5il9AIBwpgAnr9h91TfE134Y2m7PF4d9H9vx_chrGr-JOr7p41fivmv4K40UE3XZmarToY-f6ZpNgj8kmv_vjL09PmzKZbZ6eXouF6usFYUes4ZkMDYQyCIowiBAK7FzvrbKE4JVioytHSFahxqEkVoEvWskqnBCwhm7PXdbItoOsT36-LNVRiowBn8BmXBH_A</recordid><startdate>200809</startdate><enddate>200809</enddate><creator>Jung-hyun Seo</creator><creator>HyeongOk Lee</creator><creator>Moon-Suk Jang</creator><creator>Soon-Hee Han</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200809</creationdate><title>Node Mapping Algorithm between Torus and Petersen-Torus Networks</title><author>Jung-hyun Seo ; HyeongOk Lee ; Moon-Suk Jang ; Soon-Hee Han</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-de2f68fe027f4e3f10541c9ab84ae30844e68b9e338935016251f5cd234fe33e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithm design and analysis</topic><topic>Computers</topic><topic>Embedding</topic><topic>Hypercubes</topic><topic>Interconnection Network</topic><topic>Joining processes</topic><topic>Multiprocessor interconnection</topic><topic>Parallel algorithms</topic><topic>Petersen-Torus</topic><topic>Routing</topic><topic>Torus</topic><toplevel>online_resources</toplevel><creatorcontrib>Jung-hyun Seo</creatorcontrib><creatorcontrib>HyeongOk Lee</creatorcontrib><creatorcontrib>Moon-Suk Jang</creatorcontrib><creatorcontrib>Soon-Hee Han</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>Jung-hyun Seo</au><au>HyeongOk Lee</au><au>Moon-Suk Jang</au><au>Soon-Hee Han</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Node Mapping Algorithm between Torus and Petersen-Torus Networks</atitle><btitle>2008 Fourth International Conference on Networked Computing and Advanced Information Management</btitle><stitle>NCM</stitle><date>2008-09</date><risdate>2008</risdate><volume>1</volume><spage>540</spage><epage>544</epage><pages>540-544</pages><isbn>0769533221</isbn><isbn>9780769533223</isbn><abstract>In this paper, it was proven that Torus T(5m,2n) might be embedded into Petersen-Torus PT(m,n) at dilation 5, congestion 5, and expansion 1. It was also proven that Torus might be embedded in PT at 3 or less of average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus network in PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one embedding.</abstract><pub>IEEE</pub><doi>10.1109/NCM.2008.50</doi><tpages>5</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769533221
ispartof 2008 Fourth International Conference on Networked Computing and Advanced Information Management, 2008, Vol.1, p.540-544
issn
language eng
recordid cdi_ieee_primary_4624066
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Algorithm design and analysis
Computers
Embedding
Hypercubes
Interconnection Network
Joining processes
Multiprocessor interconnection
Parallel algorithms
Petersen-Torus
Routing
Torus
title Node Mapping Algorithm between Torus and Petersen-Torus Networks
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T20%3A17%3A25IST&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=Node%20Mapping%20Algorithm%20between%20Torus%20and%20Petersen-Torus%20Networks&rft.btitle=2008%20Fourth%20International%20Conference%20on%20Networked%20Computing%20and%20Advanced%20Information%20Management&rft.au=Jung-hyun%20Seo&rft.date=2008-09&rft.volume=1&rft.spage=540&rft.epage=544&rft.pages=540-544&rft.isbn=0769533221&rft.isbn_list=9780769533223&rft_id=info:doi/10.1109/NCM.2008.50&rft_dat=%3Cieee_6IE%3E4624066%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-de2f68fe027f4e3f10541c9ab84ae30844e68b9e338935016251f5cd234fe33e3%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=4624066&rfr_iscdi=true