Two-level hybrid interpreter/native code execution for combined space-time program efficiency

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Two-level hybrid interpreter/native code execution for combined space-time program efficiency

Full text

Pdf (255 KB)

Source

Conference on Programming Language Design and Implementation archive
Papers of the Symposium on Interpreters and interpretive techniques table of contents

St. Paul, Minnesota, United States

Pages: 150 - 152

Year of Publication: 1987

ISBN:0-89791-235-7

Also published in ...

Author

T. Pittman

Kansas State University, Manhattan, KS

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 23, Citation Count: 7

Additional Information:

abstract references cited by index terms peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/29650.29666 What is a DOI?

ABSTRACT

A two-level programming model permits the applications programmer to write programs that benefit both from the code density of interpreted virtual machines and from the speed of native code execution. A well-defined boundary between the native code and the virtual machine facilitates the development of translators to be used at both levels.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Pradip Bose , Edward S. Davidson, Design of instruction set architectures for support of high-level languages, Proceedings of the 11th annual international symposium on Computer architecture, p.198-206, January 1984
	2	James Brakefield, Just what is an op-code?: or a universal computer design, ACM SIGARCH Computer Architecture News, v.10 n.4, p.31-34, June 1982 [doi>10.1145/641542.641547]
	3	[Ear82] Earle, W. "Compress ROM Programs With a Math-Function Interpreter", Electronic Design News, (March 31, 1982).
	4	[Hal77] Halstead, M. H. Elements of Software Science. Elsevier North-Holland (1977).
	5	[Hel83] Helliwell, A. M. "Implementation of a Highly Portable Pascal Interpreter Using Indirect Threaded Code Techniques", IUCC Bulletin, 5:3 (Winter 1983) 124-127.
	6	[INS85] IEEE Standard 695-1985. "Microprocessor Universal Format for Object Modules", New York (1985).
	7	[Kli81] Klint, P. "Interpretation Techniques", Software-Practice and Experience, 11:(1981) 963-973.
	8	[Knu71] Knuth D. E. "An Empirical Study of Fortran Programs" in Software Practice and Experience 1:2 (1971) 105-133.
	9	[Tur86] Turner, N. "The Right to Assemble. Code Compression With Mini-Interpreters", Dr. Dobbs Journal, (May 1986) 110-111.

CITED BY 7

	Todd A. Proebsting, Optimizing an ANSI C interpreter with superoperators, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.322-332, January 23-25, 1995, San Francisco, California, United States
	M. Anton Ertl, Stack caching for interpreters, ACM SIGPLAN Notices, v.30 n.6, p.315-327, June 1995
	Parag K. Jain , Norman C. Hutchinson , Samuel T. Chanson, A framework for the non-monolithic implementation of protocols in the x-kernel, Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium, p.2-2, August 01-03, 1994, Oakland, California
	M. Anton Ertl , David Gregg , Andreas Krall , Bernd Paysan, Vmgen: a generator of efficient virtual machine interpreters, Software—Practice & Experience, v.32 n.3, p.265-294, March 2002
	Philipp Hoschka, Compact and efficient presentation conversion code, IEEE/ACM Transactions on Networking (TON), v.6 n.4, p.389-396, Aug. 1998
	Bob Cmelik , David Keppel, Shade: a fast instruction-set simulator for execution profiling, ACM SIGMETRICS Performance Evaluation Review, v.22 n.1, p.128-137, May 1994
	John Aycock, A brief history of just-in-time, ACM Computing Surveys (CSUR), v.35 n.2, p.97-113, June 2003