Compact and Efficient Presentation Conversion Routines

Abstract : Presentation conversion is a key operation in any development environment for distributed applications, such as Corba, Java-RMI, DCE or ASN.1-based environments. It is also well-known performance bottleneck in high-speed network communication. Presentation conversion code is usually generated by an automatic code generation tool referred to as stub compiler. The quality of the code generated by a stub compiler is often very low. The code is either very slow, or has a large code size, or both. This paper describes the design and experimental evaluation of an optimization stage for a stub compiler. The optimization stage automates the trade-off between code size and execution speed of the code generated by the compiler. This is achieved by using a hybrid of two implementation alternatives for presentation conversion routines (interpreted and procedure-driven code). The optimization problem is modeled as a Knapsack problem. A Markov model in combination with a heuristic branch predictor is used for estimating execution frequencies. The optimization stage is added to the ASN.1 compiler Mavros. Experimental evaluation of this implementation shows that by investing only 25% of the code size of fully optimized code, a performance improvement of 55% to 68% can be achieved.
Type de document :
RR-3291, INRIA. 1997
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:41:56
Dernière modification le : samedi 27 janvier 2018 - 01:31:36
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:45:13



  • HAL Id : inria-00073397, version 1



Philipp Hoschka. Compact and Efficient Presentation Conversion Routines. RR-3291, INRIA. 1997. 〈inria-00073397〉



Consultations de la notice


Téléchargements de fichiers