ACM Home Page
Please provide us with feedback. Feedback
FM-QoS: real-time communication using self-synchronizing schedules
Full text PdfPdf (145 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) table of contents
San Jose, CA
Pages: 1 - 18  
Year of Publication: 1997
ISBN:0-89791-985-8
Authors
Kay Connelly  University of Illinois, Urbana, IL
Andrew A. Chien  University of Illinois, Urbana, IL
Sponsors
IEEE-CS\DATC : IEEE Computer Society
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 22,   Citation Count: 5
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/509593.509595
What is a DOI?

ABSTRACT

FM-QoS employs a novel communication architecture based on network feedback to provide predictable communication performance (e.g. deterministic latencies and guaranteed bandwidths) for high speed cluster interconnects. Network feedback is combined with self-synchronizing communication schedules to achieve synchrony in the network interfaces (NIs). Based on this synchrony, the network can be scheduled to provide predictable performance without special network QoS hardware. We describe the key element of the FM-QoS approach, feedback-based synchronization (FBS), which exploits network feedback to synchronize senders. We use Petri nets to characterize the set of self-synchronizing communication schedules for which FBS is effective and to describe the resulting synchronization overhead as a function of the clock drift across the network nodes. Analytic modeling suggests that for clocks of quality 300 ppm (such as found in the Myrinet NI), a synchronization overhead less than 1% of the total communication traffic is achievable --- significantly better than previous software-based schemes and comparable to hardware-intensive approaches such as virtual circuits (e.g. ATM).We have built a prototype of FBS for Myricom s Myrinet network (a 1.28 Gbps cluster network) which demonstrates the viability of the approach by sharing network resources with predictable performance. The prototype, which implements the local node schedule in software, achieves predictable latencies of 23 µs for a single-switch, 8-node network and 2 KB packets. In comparison, the best-effort scheme achieves 104 µs for the same network without FBS. While this ratio of over four to one already demonstrates the viability of the approach, it includes nearly 10 µs of overhead due to the software implementation. For hardware implementations of local node scheduling, and for networks with cascaded switches, these ratios should be much larger factors.


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
 
2
 
3
 
4
Concurrent Systems Architecture Group, High Performance Virtual Machines (HPVM), Department of Computer Science, University of Illinois, http://www-csag.cs.uiuc.edu/projects/hpvm.html
 
5
D. E. Culler, et. al. The generic Active Messages interface specification. http://now.cs.berkeley.edu/Papers/Papers/gam_spec.ps
 
6
7
 
8
End to end Performance vIa Quality of Service, http://pertsserver.cs.uiuc.edu/epiq/
9
 
10
 
11
S. J. Golestani. Congestion-free communication in high-speed packet networks. In IEEE Transactions on Communications, Vol. 39, No. 12, pages 1802-1812, December 1991.
 
12
S. Hauck. Asynchronous design methodologies: An overview. In Proceedings of the IEEE, Vol.83, No. 1, pages 69-93, January 1995.
 
13
 
14
 
15
C. Kalmanek, H. Kanakia and S. Keshav. Rate controlled servers for very high-speed networks. In Proceedings of IEEE Global Telecommunications Conference, 1990.
 
16
17
 
18
19
20
 
21
 
22
 
23
J-P. Li and M. Mutka. Real-time virtual channel flow control. In Proceedings of IEEE 13th Annual International Phoenix Conference on Computers and Communications, pages 97-103, April 1994.
 
24
P. Newman. ATM local area networks. IEEE Communications Magazine, pages 86-98, March 1994.
 
25
S. Pakin, V. Karamcheti and A. A. Chien. Fast Messages (FM): Efficient, portable communication for workstation clusters and massively-parallel processors. IEEE Concurrency, 1997.
 
26
 
27
D. Verma, H. Zhang and D. Ferrari. Delay jitter control for real-time communication in packet switching networks. In Proceedings of TriComm 91 pages 47-55, 1991.
28
 
29
L. Zhang, S. Deering, D. Estrin, S. Shenker and D. Zappala. RSVP: A new resource ReSerVation Protocol. In IEEE Network, September 1993.


Collaborative Colleagues:
Kay Connelly: colleagues
Andrew A. Chien: colleagues