将互连网络映射到VEDIC网络

[1993] Proceedings Seventh International Parallel Processing Symposium Pub Date : 1993-04-13 DOI:10.1109/IPPS.1993.262821

V. Chaudhary, B. Sabata, J. Aggarwal

{"title":"将互连网络映射到VEDIC网络","authors":"V. Chaudhary, B. Sabata, J. Aggarwal","doi":"10.1109/IPPS.1993.262821","DOIUrl":null,"url":null,"abstract":"The authors show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDIC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, k-ary n-cubes, and Cayley graphs-star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool for generating currently known and new interconnection networks.<<ETX>>","PeriodicalId":248927,"journal":{"name":"[1993] Proceedings Seventh International Parallel Processing Symposium","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Mapping interconnection networks into VEDIC networks\",\"authors\":\"V. Chaudhary, B. Sabata, J. Aggarwal\",\"doi\":\"10.1109/IPPS.1993.262821\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDIC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, k-ary n-cubes, and Cayley graphs-star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool for generating currently known and new interconnection networks.<<ETX>>\",\"PeriodicalId\":248927,\"journal\":{\"name\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Seventh International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1993.262821\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Seventh International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1993.262821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

通过自动生成VEDIC网络的参数，证明了VEDIC网络在模拟其他已知互联网络时的通用性。给出了将弦环、环面网格、二元超立方体、k-ary n-立方体和Cayley图(星图和煎饼图)表示为VEDIC网络的算法。使用这些参数，VEDIC网络可以用作生成当前已知的和新的互连网络的工具。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Mapping interconnection networks into VEDIC networks

The authors show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDIC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, k-ary n-cubes, and Cayley graphs-star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool for generating currently known and new interconnection networks.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1993] Proceedings Seventh International Parallel Processing Symposium

自引率

0.00%

发文量

期刊最新文献

Mapping realistic data sets on parallel computers A cluster-M based mapping methodology Supporting insertions and deletions in striped parallel filesystems An efficient atomic multicast protocol for client-server models Implementation of distributed asynchronous algorithms with stochastic delays for solving time drifting optimization problems