| |
|
|
|
Research on Efficient, Parallel
Protocol Implementation
Monographs and Theses:
Articles:
Monographs and Theses
-
Methods and Semantics
for Telecommunications Systems Engineering, PhD thesis
S. Leue
Where:
Department of Computer Science and Applied Mathematics, University
of Berne, Switzerland, December 1994.
Note:
Part IV of my PhD thesis contains a the algorithms and
theoretical background on our efficient protocol implementation approach.
Download:
Postcript
version
-
Opparim - A Method
and Tool for Optimized Parallel Protocol Implementation
S. Leue, Ph. Oechslin
Appeared in:
Journal of High Speed Networks, Vol. 5, p. 125-143, 1996.
Abstract:
We are introducing and discussing a method for the {\em
op}timized and {\em par}allel {\em imp}lementation of protocols as
well as a tool \opparim to apply the method automatically to the specification
of a protocol. We present a study case representing an IP/TCP/FTP
protocol stack specified in SDL. We show how \opparim generates dependence
graphs from the specification and how it manipulates these graphs
to allow for an optimised and possibly parallelised implementation.
We then present a hardware architecture on which the protocol stack
could be implemented and show the effects of our optimizations on
the processing time of an incoming packet. Using two processing elements
the optimised implementation executes in less than half the time of
what we call a `faithful' implementation.
Download:
PostScript-File
-
On Parallelising
and Optimising the Implementation of Communication Protocols
S. Leue, Ph. Oechslin
Appeared in:
IEEE/ACM Transactions on Networking, 4(1), p. 55-70, February
1996.
Abstract:
We present a method for the automatic derivation of efficient
protocol implementations from a formal specification. Optimised efficient
protocol implementation has become an important issue in telecommunications
systems engineering as recently network throughput has increased much
faster than computer processing power. Efficiency will be attained
by two measures. First, the inherent parallelism in protocol specifications
will be exploited. Second, the order of execution of the operations
involved in the processing of the protocol data will be allowed to
differ from the order prescribed in the specification, thus allowing
operations to be executed jointly and more efficiently. The method
will be defined formally which is useful when implementing it as a
tool.
Download:
PostScript-File
-
Enhancing
Integrated Layer Processing using Common Case Anticipation and Data
Dependence Analysis
Ph. Oechslin, S. Leue
Extended Abstract, in:
Proceedings of the First Internation Workshop on High Performance
Protocol Architectures HIPPARCH '94, INRIA Sophia Antipolis, December
1994.
Download:
PostScript-File
-
Formalizations
and Algorithms for Optimized Parallel Protocol Implementation
S. Leue, Ph. Oechslin
Appeared in:
Proceedings of the IEEE International Conference on Network
Protocols ICNP-94, Oct. 25-28, 1994., IEEE Computer Scociety Press,
Boston, Massachusetts, October 1994.
Download:
PostScript-File
-
From SDL Specification
to Optimized Parallel Protocol Implementations
S. Leue, Ph. Oechslin
Extended Abstract, in:
M. Ito and G. Neufeld (eds.), Proceedings of the Fourth International
IFIP Workshop on Protocols for High Speed Networks, Aug. 10-12, 1994,
Chapman & Hall, 1994., to appear. Full paper with the same title
in: M. Ito and G. Neufeld (eds.), Workshop Proceedings of the Fourth
International IFIP Workshop on Protocols for High Speed Networks,
Aug. 10-12, 1994, pp. 308-328, 1994.
Abstract:
We propose a formalized
method that allows to automatically derive an optimized implementation
from the formal specification of a protocol. Our method starts with
the SDL specification of a protocol stack. We first derive a data
and control flow dependence graph from each SDL process. Then, in
order to perform cross-layer optimizations we combine the dependence
graphs of different SDL processes. Next, we determine the common path
through the multi-layer dependence graph. We then parallelize this
graph wherever possible which yields a relaxed dependence graph. Based
on this relaxed dependence graph we interpret different optimization
concepts that have been suggested in the literature, in particular
lazy messages and combination of data manipulation operations. Together
with these interpretations the relaxed dependence graph can be be
used as a foundation for a compile-time schedule on a sequential or
parallel machine architecture. The formalization we provide allows
our method to be embedded in a more comprehensive protocol engineering
methodology.
Download:
PostScript-File
-
Optimization
Techniques for Parallel Protocol Implementation
S. Leue, Ph. Oechslin
Appeared in:
Proceedings of the Fourth Workshop on Future Trends of Distributed
Computing Systems, IEEE Computer Society Press, September 1993.
Download:
PostScript-File
|