Proceedings of 16th International Conference on Distributed Computing Systems (1996)
May 27, 1996 to May 30, 1996
N. Islam , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
A. Dave , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
R.H. Campbell , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Parallel programs running on top of generic protocols (e.g. TCP) in a cluster of workstations often do not perform or scale as well as one would expect. One reason for this is that both the performance and scalability of parallel applications are highly dependent on the speed of communication, yet the generic protocols used to guarantee reliable message delivery add unnecessary overhead which degrades the performance of the parallel application. The main thesis we explore in this paper is that it is possible to use knowledge of application behavior to design protocols that are more efficient. In particular, we investigate automatic techniques for generating optimized application-specific network protocols for parallel applications running on unreliable networks. Our algorithms assume that the application communication can be represented by a context free grammar. Such algorithms form the basis for a communication compiler.
protocols; fault tolerant computing; performance evaluation; context-free grammars; parallel programming; unreliable networks; scalability; performance; communication; reliable message; protocols; network protocols; parallel applications; context free grammar; communication compiler
R. Campbell, A. Dave and N. Islam, "Communication compilation for unreliable networks," Proceedings of 16th International Conference on Distributed Computing Systems(ICDCS), Hong Kong, 1996, pp. 188.