Compact and efficient presentation conversion code

IEEE/ACM Transactions on Networking

Volumn 6, Issue 4, 1998, Pages 389-396

  Hoschka, Philipp ^a,b  

^a INRIA   (France)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data communication; Data conversion; Markov processes; Optimization methods; Optimizing compilers

Indexed keywords

DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; HIGH LEVEL LANGUAGES; MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM COMPILERS;

CONVERSION CODES; STUB COMPILERS;

COMPUTER NETWORKS;

EID: 0032141632     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.720872     Document Type: Article

References (31)

1. D. Bacon, S. Graham, and O. Sharp, "Compiler transformations for high-performance computing," ACM Comput. Surveys, vol. 26, no. 4, pp. 345-420, 1994.
2. T. Ball and J. Larus, "Branch prediction for free," in ACM SIGPLAN'93 Conf. Programming Language Design and Implementation, Albuquerque, NM, 1993, pp. 300-313.
3. C. Castelluccia and P. Hoschka, "A compiler-based approach to protocol optimization," in Proc. Third IEEE Workshop Architecture and Implementation of High Performance Communication Subsystems, Mystic, CT, 1995.
4. C. Castelluccia, W. Dabbous, and S. O'Malley, "Generating efficient protocol code from an abstract specification," in IEEE/ACM Trans. Networking, vol. 5, pp. 514-525, 1997.
5. S. Chung, E. Lazowska, D. Notkin, and J. Zahorjan, "Performance implications of design alternatives for remote procedure call stubs," in 9th Int. Conf. Distributed Computing Systems, Newport Beach, CA, 1989, pp. 36-41.
6. D. Clark, V. Jacobson, J. Romkey, and H. Salwen, "An analysis of TCP processing overhead," IEEE Commun. Mag., vol. 27, pp. 23-29, 1989.
7. D. Clark and D. Tennenhouse, "Architectural considerations for a new generation of protocols," in ACM SIGCOMM'90, Philadelphia, PA, 1990. pp. 200-208.
8. J. Corbin, The Art of Distributed Applications. New York: Springer, 1990.
9. S. Graham, P. Kessler, and M. McKusick, "An execution profiler for modular programs," Softw. - Pract. Exp., vol. 13, pp. 671-685, 1983.
10. P. Hoschka and C. Huitema, "Control flow analysis for automatic fast path implementation," in Second Workshop High Performance Communication Subsystems, A. Tantawy, Ed., Williamsburg, VA, 1993, pp. 29-33.
11. _, "Automatic generation of optimized code for marshaling routines," in IFIP TC6/WG6.5 Int. Working Conf. Upper Layer Protocols, Architectures and Applications, M. Medina and N. Borenstein, Eds., Barcelona, Spain, 1994, pp. 131-146.
12. P. Hoschka, "Automatic code optimization in a stub compiler," Ph.D. dissertation, Univ. Nice/Sophia-Antipolis, France, 1995.
13. C. Huitema, "MAVROS: Highlights on an ASN.1 compiler," INRIA, Sophia-Antipolis, France, Internal Working Paper, 1991.
14. C. Huitema and A. Doghri, "Defining faster transfer syntaxes for the OSI presentation protocol," ACM Comput. Commun. Rev., vol. 19 no. 5, pp. 44-55, 1989.
15. M. Jones, R. Rashid, and M. Thompson, "Matchmaker: An interface specification language for distributed processing," in 11th ACM Symp. Principles of Programming Languages, N. Meyrowitz Ed., New Orleans, LA, 1985, pp. 225-235.
16. P. Kessler, "A client-side stub interpreter," ACM SIGPLAN Notices, vol. 29, no. 8, pp. 94-100, 1994.
17. S. Martello and P. Toth, Knapsack Problems, Chichester: Wiley, 1990.
18. S. McFarling and J. Hennessy, "Reducing the cost of branches," in 13th Annu. Symp. Computer Architecture, 1986, pp. 396-403.
19. S. O'Malley, T. Proebsting, and A. Montz, "USC: A universal stub compiler," in ACM SIGCOMM'94, London, U.K., 1994, pp. 295-307.
20. F. Pagan, "Converting interpreters into compilers," Softw. - Pract. Exp., vol. 18, no. 6, pp. 509-524, 1988.
21. C. Partridge, Gigabit Networking, Reading, MA: Addison-Wesley, 1993.
22. L. Peterson and B. Davie, Computer Networks: A Systems Approach. San Francisco, CA: Morgan-Kaufman, 1996.
23. K. Pettis and R. Hansen, "Profile guided code positioning," in ACM SIGPLAN'90 Conf. Programming Language Design and Implementation, White Plains, NY, 1990, pp. 16-27.
24. T. Pittman, "Two-level hybrid interpreter/native code execution for combined space-time program efficiency," ACM SIGPLAN Notices, vol. 22, pp. 150-152, 1987.
25. C. V. Ramamoorthy, "Discrete Markov analysis of computer programs," in 20th ACM Nat. Conf., Waltham, MA, 1965, pp. 386-392.
26. M. Sample and G. Neufeld, "Implementing efficient encoders and decoders for network data representations," in IEEE INFOCOM'93, San Francisco, CA, pp. 1144-1153, 1993.
27. Snacc 1.1: A High Performance ASN.1 to C/C++ Compiler, Univ. British Columbia, Vancouver, B.C., Canada, 1993.
28. R. Scheifler, "An analysis of inline substitution for a structured programming language," Commun. ACM, vol. 20, pp. 647-654, 1977.
29. D. Steedman, Abstract Syntax Notation One (ASN.1) The Tutorial and Reference. London: Twickenham Appraisals, 1990.
30. C. Thekkath and H. Levy, "Limits to low latency communication on high-speed networks," ACM Trans. Comput. Syst., vol. 11, no. 2, pp. 179-203, 1993.
31. L. Zahn, T. Dineen, P. Leach, E. Martin, N. Mishkin, J. Pato, and G. Wyant, Network Computing Architecture. Englewood Cliffs, NJ: Prentice-Hall, 1990.