排序方式: 共有83条查询结果,搜索用时 15 毫秒
1.
2.
3.
IIntroduct1OllThe star graph【1]proposed as a particular case ofC叫ley graphs[ZJ Is vertex-and edge-symmetric.strongly hlerarchlcal,maximally tault-tolerant,strongly resilient and has diameter and node degreethat are superior to those of a slmll。-slied hypercube(which Is also a Cnyley graph)IOr parallelcomputers[3].MNor references can be found In studying the star graph regarding its propertiesllJ,e毗edding cwabllity[4],communication c叩劝ility[5-71,andfanfaut-toierm尬 cap劝ility… 相似文献
4.
The star networks,which were originally proposed by Akers and Harel,have suffered from a rigorous restriction on the number of nodes.The general incomplete star networks(GISN) are proposed in this paper to relieve this restriction.An efficient labeling scheme for GISN is given,and routing and broadcasting algorithms are also presented for GIS.The communication diameter of GISN is shown to be bounded by 4n-7.The proposed single node broadcasting algorithm is optimal with respect to time complexity O(nlog2n). 相似文献
5.
6.
7.
This paper presents an efficient algorithm that implements one-to-many,or multicast,communication in one-port wormhole-routed cube-connected cycles(CCCs) in the absence of hardware multicast support.By exploiting the propoeries of the switching technology and the use of virtual channels,a minimumtime multicast algorithm is presented for n-dimensional CCCs that use deterministic routing of unicast messages.The algorithm can deliver a multicast message to m-1 destinations in [log2m] message-passing steps,while avoiding contention among the constitutent unicast messages,Performance results of a simulation study on CCCs with up to 10,240 nodes are also given. 相似文献
8.
9.
10.
该文介绍了基于目标代码(二进制编译文件)为Linux运行时系统内核内存映像打补丁以修改内核的原理和方法,并给出了一个示例场景和程序以说明其应用。掌握该方法对于内核开发、系统调试和系统安全都具有重要的实用价值。 相似文献