全文获取类型
收费全文 | 53篇 |
免费 | 0篇 |
专业分类
化学工业 | 8篇 |
能源动力 | 3篇 |
无线电 | 15篇 |
一般工业技术 | 4篇 |
冶金工业 | 5篇 |
自动化技术 | 18篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2018年 | 2篇 |
2017年 | 1篇 |
2015年 | 1篇 |
2013年 | 3篇 |
2012年 | 1篇 |
2010年 | 1篇 |
2009年 | 3篇 |
2008年 | 1篇 |
2007年 | 3篇 |
2006年 | 1篇 |
2005年 | 4篇 |
2004年 | 1篇 |
2001年 | 2篇 |
1999年 | 4篇 |
1998年 | 2篇 |
1997年 | 2篇 |
1996年 | 5篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有53条查询结果,搜索用时 93 毫秒
51.
52.
Parhami B. Ding-Ming Kwai 《Parallel and Distributed Systems, IEEE Transactions on》1999,10(6):658-672
Chordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are node-symmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In this paper, periodically regular chordal (PRC) ring networks are proposed as a compromise for combining low node degree with small diameter. By varying the PRC ring parameters, one can obtain architectures with significantly different characteristics (e.g., from linear to logarithmic diameter), while maintaining an elegant framework for computation and communication. In particular, a very simple and efficient routing algorithm works for the entire spectrum of PRC rings thus obtained. This flexibility has important implications for key system attributes such as architectural satiability, software portability, and fault tolerance. Our discussion is centered on unidirectional PRC rings with in/out-degree of 2. We explore the basic structure, topological properties, optimization of parameters, VLSI layout, and scalability of such networks, develop packet and wormhole routing algorithms for them, and briefly compare them to competing fixed-degree architectures such as symmetric chordal rings, meshes, tori, and cube-connected cycles 相似文献
53.
A unified formulation of honeycomb and diamond networks 总被引:1,自引:0,他引:1
Honeycomb and diamond networks have been proposed as alternatives to mesh and torus architectures for parallel processing. When wraparound links are included in honeycomb and diamond networks, the resulting structures can be viewed as having been derived via a systematic pruning scheme applied to the links of 2D and 3D tori, respectively. The removal of links, which is performed along a diagonal pruning direction, preserves the network's node-symmetry and diameter, while reducing its implementation complexity and VLSI layout area. In this paper, we prove that honeycomb and diamond networks are special subgraphs of complete 2D and 3D tori, respectively, and show this viewpoint to hold important implications for their physical layouts and routing schemes. Because pruning reduces the node degree without increasing the network diameter, the pruned networks have an advantage when the degree-diameter product is used as a figure of merit. Additionally, if the reduced node degree is used as an opportunity to increase the link bandwidths to equalize the costs of pruned and unpruned networks, a gain in communication performance may result 相似文献