We develop efficient unicast, broadcast and parallel routing algorithms on locally connected hypercube networks.
本文基于局部连通性网络容错模型设计了高效的单播、广播和并行容错路由算法。
Parallel fault tolerant routing algorithms in hypercube networks with a large number of faulty nodes are studied.
研究了具有大量错误结点的超立方体网络中的并行容错路由算法。
Parallel processing is one of the most challenging fields in computer science. Parallel computer interconnection networks and routing algorithms, however, are the basic techniques in this field.
并行处理是计算机科学中最富有挑战性的领域之一，而并行计算机互联网和寻径算法则是这个领域中研究力量很集中的基础技术。
Parallel processing is one of the most challenging fields in computer science. Parallel computer interconnection networks and routing algorithms, however, are the basic techniques in this field.
并行处理是计算机科学中最富有挑战性的领域之一，而并行计算机互联网和寻径算法则是这个领域中研究力量很集中的基础技术。
应用推荐