NODE-TO-SET DISJOINT PATHS ROUTING IN METACUBE

机译：在METACUBE中进行节点到设置的分离路径路由

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

The metacube interconnection network targeting large par-rnallel computers has been introduced a few years ago. Keep-rning its diameter short, similar to that of the hypercube,rnthis network has a degree much lower than that of a hy-rnpercube of the same size. For example, with only 6 linksrnper node, the corresponding metacube is able to connectrnmore than one hundred of millions of nodes. We in-rntroduce in this paper a routing algorithm for finding inrna metacube MC(k;m) disjoint paths between one sourcernnode and a maximum of m + k destination nodes. Wernshow that for any source node s, and any destination nodesrnD = {d_1,…,d_n}; n ≤ m + k, we can find n dis-rnjoint paths from s to di (1 ≤ i ≤ n) of maximal lengthrn(m2~k + n)(k + 1) + k + 4 in O(nm2~k(log n + k)) timerncomplexity.

机译：面向大型并行计算机的metacube互连网络已于几年前引入。保持其直径短，类似于超立方体的直径，该网络的程度远低于相同大小的超立方体的程度。例如，在每个节点只有6个链接的情况下，相应的metacube可以连接超过一亿个节点。我们在本文中介绍了一种路由算法，用于查找一个源节点和最多m + k个目标节点之间的内部元立方体MC（k; m）不相交的路径。 Wernshow对于任何源节点s和任何目标节点rnD = {d_1，…，d_n}; n≤m + k，我们可以找到从s到最大长度的di（1≤i≤n）的n个不相交路径rn（m2〜k + n）（k +1）+ k + 4 in O（nm2〜k （log n + k））时间复杂度。

著录项

来源
《Proceedings of the IASTED international conferences on informatics 2010》|2010年|p.289-296|共8页
会议地点 Marina del Rey(US);Marina del Rey(US);Marina del Rey(US);Marina del Rey(US);Marina del Rey(US)
作者
Antoine Bossard; Keiichi Kaneko; Shietung Peng;
展开▼
作者单位

Graduate School of Engineering Tokyo University of Agriculture and Technology Koganei-shi, Tokyo, JAPAN 50008834706@st.tuat.ac.jp;

Graduate School of Engineering Tokyo University of Agriculture and Technology Koganei-shi, Tokyo, JAPAN klkaneko@cc.tuat.ac.jp;

Faculty of Computer and Information Sciences Hosei University Koganei-shi, Tokyo, JAPAN speng@hosei.ac.jp;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类信息处理技术;计算技术、计算机技术;
关键词
metacube; hierarchical hypercube; interconnection network; polynomial algorithm; disjoint-path routing;

机译：元多维数据集;层次超多维数据集;互连网络;多项式算法;不相交路径路由;

相似文献

外文文献
中文文献
专利

1. Node-to-set disjoint paths routing in a metacube [J] . Antoine Bossard, Keiichi Kaneko, Shietung Peng International Journal of High Performance Computing and Networking . 2015,第4期

机译：元多维数据集中的节点到集不相交路径路由
2. A Node-to-Set Disjoint Paths Routing Algorithm in Torus-Connected Cycles [J] . Antoine Bossard, Keiichi Kaneko International journal of computers and their applications . 2015,第1期

机译：环面连接环中的节点到集合不相交路径路由算法
3. Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes [J] . Antoine Bossard, Keiichi Kaneko Journal of Information Recording . 2014,第4期

机译：超立方体中时间最优的节点到集合不相交路径路由
4. Node-to-Set Disjoint-path Routing in Metacube [C] . Bossard A., Kaneko K., Shietung Peng Parallel and Distributed Computing, Applications and Technologies, 2009 . 2009

机译：Metacube中的节点到集不相交路径路由
5. Approximation Algorithms and Hardness of Routing on Disjoint Paths [D] . Kim, Hong Kyun. 2018

机译：不相交路径上的近似算法和路由难度
6. Energy-Efficient Multi-Disjoint Path Opportunistic Node Connection Routing Protocol in Wireless Sensor Networks for Smart Grids [O] . Junaid Anees, Hao-Chun Zhang, Sobia Baig, 2019

机译：智能电网无线传感器网络中的节能多不相交路径机会节点连接路由协议
7. Node-to-set disjoint-path routing in perfect hierarchical hypercubes [O] . Bossard Antoine, Kaneko Keiichi, Peng Shietung 2011

机译：完美的分层超立方体中的节点到集不相交路径路由
8. Routing, Disjoint Paths, and Classification [R] . Zhou, S. 2006

机译：路由，不相交路径和分类

NODE-TO-SET DISJOINT PATHS ROUTING IN METACUBE

摘要

著录项

相似文献

相关主题

期刊订阅