| A hierarchical three-way interconnect architecture for hexagonal processors |
| Full text |
Pdf
(157 KB)
|
| Source
|
International Workshop on System-Level Interconnect Prediction
archive
Proceedings of the 2003 international workshop on System-level interconnect prediction
table of contents
Monterey, CA, USA
SESSION: Session 5: Interconnect and Architecture Planning
table of contents
Pages: 133 - 139
Year of Publication: 2003
ISBN:1-58113-627-7
|
|
Authors
|
|
Feng Zhou
|
University of California, San Diego, La Jolla, CA
|
|
Esther Y. Cheng
|
University of California, San Diego, La Jolla, CA
|
|
Bo Yao
|
University of California, San Diego, La Jolla, CA
|
|
Chung-Kuan Cheng
|
University of California, San Diego, La Jolla, CA
|
|
Ronald Graham
|
University of California, San Diego, La Jolla, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 8, Citation Count: 1
|
|
|
ABSTRACT
The problem of interconnect architecture arises when an array of processors needs to be integrated on one chip. With the deep sub-micron technology, devices become cheap while wires are expensive. On the other hand, high performance systems require the shortest communication routes among the processors. Non-blocking hierarchical interconnect architectures have been found to be a feasible solution. First, they can be expanded recursively and so can be applied in large-scale arrays. Second, if well designed, they have the best trade-off between the cost of wire resources and the communication performance. In this paper, a new type of non-blocking hierarchical three-way interconnect architecture, Y tree architecture, is put forward. We find that the arrays of hexagonal cells also have the property of hierarchical expansion, and we put an algorithm to build up a Y tree. We compare the Y architecture with an X hierarchical non-blocking architecture.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
E.Y. Cheng, F. Zhou, B. Yao, CK Cheng, R. Graham, Balancing the Interconnect Topology for Arrays of Processors between Cost and Power, International Conference on Computer Design, Freiburg, Germany, Sept., 2002.
|
 |
2
|
|
| |
3
|
|
| |
4
|
|
| |
5
|
V.E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic, Academic Press, 1965.
|
| |
6
|
|
| |
7
|
|
| |
8
|
C. Clos, A Study of Non-Blocking Switching Networks, Bell System Tech. vol. 32, pp. 406--424, 1953.
|
| |
9
|
M. Igarashi, T. Mitsuhash, et al., A diagonal-interconnect architecture and its applications to RISC core design, ISSCC Digest of Technical Papers, pp.210--211, San Francisco, 2002.
|
 |
10
|
Robert C. Carden, IV , Chung-Kuan Cheng, A global router using an efficient approximate multicommodity multiterminal flow algorithm, Proceedings of the 28th conference on ACM/IEEE design automation, p.316-321, June 17-22, 1991, San Francisco, California, United States
[doi> 10.1145/127601.127687]
|
 |
11
|
Ken Mai , Tim Paaske , Nuwan Jayasena , Ron Ho , William J. Dally , Mark Horowitz, Smart Memories: a modular reconfigurable architecture, Proceedings of the 27th annual international symposium on Computer architecture, p.161-171, June 2000, Vancouver, British Columbia, Canada
|
| |
12
|
|
 |
13
|
|
| |
14
|
|
CITED BY
|
|
Jing Li , Tan Yan , Bo Yang , Juebang Yu , Chunhui Li, A packing algorithm for non-manhattan hexagon/triangle placement design by using an adaptive o-tree representation, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
|
|