ACM Home Page
Please provide us with feedback. Feedback
A router architecture for real-time point-to-point networks
Full text PdfPdf (1.12 MB)
Source International Symposium on Computer Architecture archive
Proceedings of the 23rd annual international symposium on Computer architecture table of contents
Philadelphia, Pennsylvania, United States
Pages: 237 - 246  
Year of Publication: 1996
ISBN:0-89791-786-3
Also published in ...
Authors
Jennifer Rexford  Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
John Hall  Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Kang G. Shin  Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI
Sponsors
IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 36,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/232973.232998
What is a DOI?

ABSTRACT

Parallel machines have the potential to satisfy the large computational demands of emerging real-time applications. These applications require a predictable communication network, where time-constrained traffic requires bounds on latency or throughput while good average performance suffices for best-effort packets. This paper presents a router architecture that tailors low-level routing, switching, arbitration and flow-control policies to the conflicting demands of each traffic class. The router implements deadline-based scheduling, with packet switching and table-driven multicast routing, to bound end-to-end delay for time-constrained traffic, while allowing best-effort traffic to capitalize on the low-latency routing and switching schemes common in modern parallel machines. To limit the cost of servicing time-constrained traffic, the router shares packet buffers and link-scheduling logic between the multiple output ports. Verilog simulations demonstrate that the design meets the performance goals of both traffic classes in a single-chip solution.


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
L. R. Welch and K. Toda, "Architectural support for real-time systems: Issues and trade-offs," in Proc. International Workshop on Real-Time Computing Systems and Applications, December 1994.
 
2
M. W. Mutka, "Using rate monotonic scheduling technology for real-time communications in a wormhole network,ss in 1-'roc. Workshop on 1-'arallel and Dsstmbuted Real- Time Systems, April 1994.
 
3
 
4
 
5
K. Toda, K. Nishida, E. Takahashi, N. Michell, and Y. Yamaguchi, "Design and implementation of a priority forwarding router chip for real-time interconnection networks," International Journal of Mini and Microcomputers, vol. 17, no. 1, pp. 42-51, 1995.
 
6
 
7
 
8
C. M. Aras, J. F. Kurose, D. S. Reeves, and H. Schulzrinne, "Real-time communication in packetswitched networks," Proceedings of the IEEE, vol. 82, pp. 122-139, January 1994.
 
9
 
10
H. Zhang, "Providing end-to-end performance guarantees using non-work-conserving disciplines," Computer Communications, vol. 18, pp. 769-781, October 1995.
 
11
Y. Ofek and M. Yung, "The integrated MetaNet architecture: A switch-based multimedia LAN for parallel computing and real-time traffic," in Proc. 1EEE 1NFO- COM, pp. 802-811, 1994.
 
12
W. J. Dally and C. L. Seitz, "The torus routing chip," Journal of Distributed Computing, vol. 1, no. 3, pp. 187- 196, 1986.
 
13
R. L. Cruz, "A calculus for network delay, part I: Network elements in isolation," IEEE Trans. Information Theory, vol. 37, pp. 114-131, January 1991.
 
14
Q. Zheng and K. G. Shin, "On the ability of establishing real-time channels in point-to-point packet-switched networks," IEEE Trans. Communications, pp. 1096- 1105, February/March/April 1994.
15
 
16
 
17
 
18
 
19
 
20
K. Aoyama and A. Chien, "Cost of adaptivity and virtual lanes in a wormhole router," Journal of VLSI Design, vol. 2, no. 4, pp. 315-333, 1995.
 
21
F. A. Tobagi, "Fast packet switch architectures for broadband integrated services digital networks," Proceedings of the IEEE, vol. 78, pp. 133-167, January 1990.
 
22
Q. Zheng, K. G. Shin, and C. Chen, "Real-time communication in ATM," in Proc. Annual Conference on Local Computer Networks, pp. 156-164, October 1994.
 
23
D. Picker and It. D. Fellman, "Scaling and performance of a priority packet queue for real-time applications," in Proc. Real-Time Systems Symposium, pp. 56-62, December 1994.
 
24
H. J. Chao, "A novel architecture for queue management in the ATM network," IEEE Journal on Selected Areas in Communications, vol. 9, pp. 1110-1118, September 1991.
 
25
P. E. Boyer, F. M. Guillemin, M. J. Servel, and J.-P. Coudreuse, "Spacing cells protects and enhances utilization of ATM network links," IEEE Network Magazine, pp. 38-49, September 1992.
 
26
E. Wallmeier and T. Worster, "The Spacing Policer, an algorithm for efficient peak bit rate control in ATM networks," in Proc. International Switching Symposium, pp. 22-26, October 1992.
 
27
 
28
J. Rexford, A. Greenberg, and F. Bonomi, "Haxdwareefficient fair queueing architectures for high-speed networks," in Proc. IEEE INFOCOM, March 1996.
 
29
P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique," Computer Networks, vol. 3, pp. 267-286, September 1979.
 
30

CITED BY  12

Collaborative Colleagues:
Jennifer Rexford: colleagues
John Hall: colleagues
Kang G. Shin: colleagues