By Topic

Compact and efficient presentation conversion code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hoschka, P. ; World Wide Web Consortium, Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis, France

The inefficient presentation conversion code is a major difficulty for using a distributed-applications development environment (such as a CORBA-, Java-RMI-, DCE-, or ASN.1-based environment) to build high-speed network applications. The stub compilers included in these environments generate code that is either very slow or has a large code size. This paper presents a technique for automatically generating compact and efficient presentation conversion code. This is achieved by using a hybrid of two implementation alternatives for presentation conversion routines (interpreted and procedure-driven code). The optimization is modeled as a knapsack problem. A Markov model is used in combination with heuristic branch prediction rules for estimating execution frequencies. An optimization stage based on these ideas was implemented in the ASN.1 compiler Mavros. Experimental evaluation of this implementation shows that investing only 25% of the code size of fully optimized code results in a performance improvement of 55%-68%

Published in:

Networking, IEEE/ACM Transactions on  (Volume:6 ,  Issue: 4 )