[pypy-svn] r65720 - in pypy/extradoc/talk/icooolps2009: . code

[cfbolz at codespeak.net]

Author: cfbolz
Date: Wed Jun 10 14:20:53 2009
New Revision: 65720

Modified:
   pypy/extradoc/talk/icooolps2009/code/full.txt
   pypy/extradoc/talk/icooolps2009/code/no-green-folding.txt
   pypy/extradoc/talk/icooolps2009/code/normal-tracing.txt
   pypy/extradoc/talk/icooolps2009/code/tlr-paper-full.py
   pypy/extradoc/talk/icooolps2009/code/tlr-paper.py
   pypy/extradoc/talk/icooolps2009/paper.bib
   pypy/extradoc/talk/icooolps2009/paper.tex
Log:
Now that we need 9 pages anyway, make the font non-small again. Add another
reference.


Modified: pypy/extradoc/talk/icooolps2009/code/full.txt
==============================================================================
--- pypy/extradoc/talk/icooolps2009/code/full.txt	(original)
+++ pypy/extradoc/talk/icooolps2009/code/full.txt	Wed Jun 10 14:20:53 2009
@@ -1,4 +1,4 @@
-{\small
+{
 \begin{verbatim}
 loop_start(a0, regs0)
 # MOV_R_A 0

Modified: pypy/extradoc/talk/icooolps2009/code/no-green-folding.txt
==============================================================================
--- pypy/extradoc/talk/icooolps2009/code/no-green-folding.txt	(original)
+++ pypy/extradoc/talk/icooolps2009/code/no-green-folding.txt	Wed Jun 10 14:20:53 2009
@@ -1,4 +1,4 @@
-{\small
+{
 \begin{verbatim}
 loop_start(a0, regs0, bytecode0, pc0)
 # MOV_R_A 0

Modified: pypy/extradoc/talk/icooolps2009/code/normal-tracing.txt
==============================================================================
--- pypy/extradoc/talk/icooolps2009/code/normal-tracing.txt	(original)
+++ pypy/extradoc/talk/icooolps2009/code/normal-tracing.txt	Wed Jun 10 14:20:53 2009
@@ -1,4 +1,4 @@
-{\small
+{
 \begin{verbatim}
 loop_start(a0, regs0, bytecode0, pc0)
 opcode0 = strgetitem(bytecode0, pc0)

Modified: pypy/extradoc/talk/icooolps2009/code/tlr-paper-full.py
==============================================================================
--- pypy/extradoc/talk/icooolps2009/code/tlr-paper-full.py	(original)
+++ pypy/extradoc/talk/icooolps2009/code/tlr-paper-full.py	Wed Jun 10 14:20:53 2009
@@ -1,4 +1,4 @@
-{\small
+{
 \begin{verbatim}
 tlrjitdriver = JitDriver(greens = ['pc', 'bytecode'],
                          reds   = ['a', 'regs'])

Modified: pypy/extradoc/talk/icooolps2009/code/tlr-paper.py
==============================================================================
--- pypy/extradoc/talk/icooolps2009/code/tlr-paper.py	(original)
+++ pypy/extradoc/talk/icooolps2009/code/tlr-paper.py	Wed Jun 10 14:20:53 2009
@@ -1,4 +1,4 @@
-{\small
+{
 \begin{verbatim}
 def interpret(bytecode, a):
     regs = [0] * 256

Modified: pypy/extradoc/talk/icooolps2009/paper.bib
==============================================================================
--- pypy/extradoc/talk/icooolps2009/paper.bib	(original)
+++ pypy/extradoc/talk/icooolps2009/paper.bib	Wed Jun 10 14:20:53 2009
@@ -122,7 +122,7 @@
 @Article{antocuni_2009,
  author = {Antonio Cuni and Davide Ancona and Armin Rigo},
  title = {Faster than {C}\#: Efficient Implementation of Dynamic Languages on {.NET}},
- journal = {\emph{Submitted to} ICOOOLPS'09},
+ journal = {\emph{Accepted at} ICOOOLPS'09},
  }
 
 @techreport{hlzle_adaptive_1994,
@@ -340,3 +340,12 @@
 	pages = {291--300}
 }
 
+ at inproceedings{stefan_brunthaler_virtual-machine_2009,
+	title = {{Virtual-Machine} Abstraction and Optimization Techniques},
+	abstract = {Many users and companies alike feel uncomfortable with execution performance of interpreters, often also dismissing their use for specific projects. Specifically virtual machines whose abstraction level is higher than that of the native machine they run on, have performance issues. Several common existing optimization techniques fail to deliver their full potential on such machines. This paper presents an explanation for this situation and provides hints on possible alternative optimization techniques, which could very well provide substantially higher speedups.},
+	booktitle = {Proceedings of the 4th International Workshop on Bytecode Semantics, Verification, Analysis and Transformation},
+	author = {Stefan Brunthaler},
+	year = {2009},
+	note = {to appear}
+}
+

Modified: pypy/extradoc/talk/icooolps2009/paper.tex
==============================================================================
--- pypy/extradoc/talk/icooolps2009/paper.tex	(original)
+++ pypy/extradoc/talk/icooolps2009/paper.tex	Wed Jun 10 14:20:53 2009
@@ -296,7 +296,7 @@
 they are the place where the check for a closed loop is performed.
 
 \begin{figure}
-{\small
+{
 \begin{verbatim}
 def f(a, b):
     if b % 46 == 41:
@@ -388,7 +388,7 @@
 \label{fig:tlr-basic}
 \end{figure}
 \begin{figure}
-{\small
+{
 \begin{verbatim}
     MOV_A_R     0   # i = a
     MOV_A_R     1   # copy of 'a'
@@ -732,7 +732,7 @@
 
 \begin{figure}[h]
 \label{fig:bench-example}
-{\small
+{
 \begin{verbatim}
 def f(a):
     t = (1, 2, 3)
@@ -804,7 +804,8 @@
 sequences by patching the copied machine code. Thus they get rid of all dispatch
 overhead. Both techniques can speed up interpreters which large dispatch
 overhead a lot. However they will help less if the bytecodes themselves do a
-lot of work (as is the case with Python) and the dispatch overhead is lower. On
+lot of work (as is the case with Python
+\cite{stefan_brunthaler_virtual-machine_2009}) and the dispatch overhead is lower. On
 the other hand, our technique can do a better job by tracing inside the
 implementation of those bytecode and inlining common paths.