P. Hoschka and C. Huitema. "Control flow graph analysis for automatic fast path implementation". In Second IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, Williamsburg, Virginia, September 1993.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....an abstract execution trace of a call to rmin. 1 Performance of RPC Communication using the RPC paradigm is at the root of many distributed systems. As such, the performance of this component is critical. As a result, a lot of research has been carried out on the optimization of this paradigm [32, 6, 17, 36, 15, 26]. Many studies have been carried out, but they often result in using new protocols that are incompatible with an existing standard such as the Sun RPC. The problem in reimplementing a protocol that is specified only by its implementation is that features (and even bugs) may be lost, resulting in ....

....as an important bottleneck in protocol software. They attribute it to up to 97 of the total protocol stack overhead, in some practical applications. Rather than optimizing an existing implementation, they propose some design principles to build new efficient implementations. Hoschka and Huitema [15] convert marshaling code from a table driven implementation to a procedure driven implementation. In the table driven implementation, a generic interpreter selects among several elementary decoding procedures, organized as a function table. The procedure driven implementation is a straight ....

P. Hoschka and C. Huitema. Control flow graph analysis for automatic fast path implementation. In Second IEEE workshop on the architecture and Implementation of high performance communication subsystems, Williamsburg, VA, September 1993.

....a remote procedure look like a local one. A call to this procedure is done transparently on the local machine but the actual computation takes place on a distant machine. Performance is a key point in RPC. A lot of research has been carried out on the optimization of the layers of the protocol [23, 5, 16, 24, 14, 18]. Many studies have been proposed, but they necessitate the use of new protocols, incompatible with existing standard such as Sun RPC. The high genericity of the RPC implementation is an invitation to specialization. Our group is currently developing a partial evaluator for C, named Tempo [7] It ....

....the arguments in a user level buffer, which is then copied by the kernel into the network buffer. Another difference from our study is that they generate this specialized code only on the send path. For the receive path, a generic, user level marshaling code is executed. Hoschka and Huitema [14] convert marshaling code from a table driven implementation to a procedure driven implementation. In the former, a generic interpreter is selecting among several elementary decoding procedures, organized as a function table, while the latter is a straight sequence of code specialized for a given ....

P. Hoschka and C. Huitema. Control flow graph analysis for automatic fast path implementation. In Second IEEE workshop on the architecture and Implementation of high performance communication subsystems, Williamsburg, VA, September 1993.

....real time , while a multimedia application can tolerate some loss and out of order delivery of data packets and may need to adapt to the dynamic network state. Recent research calls this transparency into question, pointing out how communication needs may depend on the application [Hutchinson91, Hoschka93, Zhang89] and how such black box communication systems do not enable the specification of those requirements. We have therefore studied the possibility of automatically generating a Remote Operation System Tailored to Applications Requirements (ROSTAR) Chrisment 94] by taking into account ....

P. Hoschka and C. Huitema. "Control flow graph analysis for automatic fast path implementation". In Second IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, Williamsburg, Virginia, September 1993.

....an application such as the file transfer, further measurement is required with more representative applications. We expect to optimize the resulting code by automatically predicting from specification the most frequently executed path in order to achieve an automatic fast path implementation [ HH93] The reactivity of the ROSTAR model is a way for the distributed applications to make better use of network characteristics. The communication within the system is effectively simplified. When a signal like Network is ready to send or Timer elapsed is emitted, all system components ....

Philipp Hoschka and Christian Huitema. Control flow graph analysis for automatic fast path implementation. In Second IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems, Williamsburg, Virginia, September 1993.

No context found.

Hoschka, Philipp and Christian Huitema. "Control Flow Graph Analysis for Automatic Fast Path Implementation." Proceedings "Second IEEE Workshop on the Architecture and Implementation fo High Performance Communication Subsystems", Williamsburg, Virginia, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC