[pypy-svn] r65689 - pypy/extradoc/talk/icooolps2009

cfbolz at codespeak.net cfbolz at codespeak.net
Tue Jun 9 14:32:33 CEST 2009


Author: cfbolz
Date: Tue Jun  9 14:32:32 2009
New Revision: 65689

Modified:
   pypy/extradoc/talk/icooolps2009/paper.bib
Log:
two papers the reviewers felt we should mention


Modified: pypy/extradoc/talk/icooolps2009/paper.bib
==============================================================================
--- pypy/extradoc/talk/icooolps2009/paper.bib	(original)
+++ pypy/extradoc/talk/icooolps2009/paper.bib	Tue Jun  9 14:32:32 2009
@@ -259,7 +259,7 @@
 
 @inproceedings{rigo_representation-based_2004,
 	address = {Verona, Italy},
-	title = {Representation-Based Just-in-Time Specialization and the Psyco Prototype for Python},
+	title = {Representation-Based Just-in-Time Specialization and the {Psyco} Prototype for {Python}},
 	isbn = {1-58113-835-0},
 	url = {http://portal.acm.org/citation.cfm?id=1014010},
 	doi = {10.1145/1014007.1014010},
@@ -314,3 +314,29 @@
 	year = {1996},
 	pages = {145--156}
 }
+
+ at inproceedings{ertl_retargeting_2004,
+	title = {Retargeting {JIT} Compilers by using {C-Compiler} Generated Executable Code},
+	isbn = {0-7695-2229-7},
+	url = {http://portal.acm.org/citation.cfm?id=1025995},
+	abstract = {{JIT} compilers produce fast code, whereas interpreters are easy to port between architectures. We propose to combine the advantages of these language implementation techniques as follows: we generate native code by concatenating and patching machine code fragments taken from interpreter-derived code (generated by a C compiler); we completely eliminate the interpreter dispatch overhead and accesses to the interpreted code by patching jump target addresses and other constants into the fragments. In this paper we present the basic idea, discuss some issues in more detail, and present results from a proof-of-concept implementation, providing speedups of up to 1.87 over the fastest previous interpreter-based technique, and performance comparable to simple native-code compilers. The effort required for retargeting our implementation from the 386 to the {PPC} architecture was less than a person-day.},
+	booktitle = {Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques},
+	publisher = {{IEEE} Computer Society},
+	author = {M. Anton Ertl and David Gregg},
+	year = {2004},
+	pages = {41--50}
+},
+
+ at article{piumarta_optimizing_1998,
+	title = {Optimizing direct threaded code by selective inlining},
+	volume = {33},
+	url = {http://portal.acm.org/citation.cfm?id=277743},
+	doi = {10.1145/277652.277743},
+	abstract = {Achieving good performance in bytecoded language interpreters is difficult without sacrificing both simplicity and portability. This is due to the complexity of dynamic translation ("just-in-time compilation") of bytecodes into native code, which is the mechanism employed universally by high-performance {interpreters.We} demonstrate that a few simple techniques make it possible to create highly-portable dynamic translators that can attain as much as 70\% the performance of optimized C for certain numerical computations. Translators based on such techniques can offer respectable performance without sacrificing either the simplicity or portability of much slower "pure" bytecode interpreters.},
+	number = {5},
+	journal = {{SIGPLAN} Not.},
+	author = {Ian Piumarta and Fabio Riccardi},
+	year = {1998},
+	pages = {291--300}
+}
+



More information about the Pypy-commit mailing list