ACM Home Page
Please provide us with feedback. Feedback
Efficient incremental run-time specialization for free
Full text PdfPdf (1.36 MB)
Source Conference on Programming Language Design and Implementation archive
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation table of contents
Atlanta, Georgia, United States
Pages: 281 - 292  
Year of Publication: 1999
ISBN:1-58113-094-5
Also published in ...
Authors
Renaud Marlet  IRISA/INRIA, Université de Rennes 1, Compose project, Campus universitaire de Beaulieu, 35042 Rennes cedex, France
Charles Consel  IRISA/INRIA, Université de Rennes 1, Compose project, Campus universitaire de Beaulieu, 35042 Rennes cedex, France
Philippe Boinot  IRISA/INRIA, Université de Rennes 1, Compose project, Campus universitaire de Beaulieu, 35042 Rennes cedex, France
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 19
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   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/301618.301681
What is a DOI?

ABSTRACT

Availability of data in a program determines computation stages. Incremental partial evaluation exploit these stages for optimization: it allows further specialization to be performed as data become available at later stages. The fundamental advantage of incremental specialization is to factorize the specialization process. As a result, specializing a program at a given stage costs considerably less than specializing it once all the data are available.We present a realistic and flexible approach to achieve efficient incremental run-time specialization. Rather than developing specific techniques, as previously proposed, we are able to re-use existing technology by iterating a specialization process. Moreover, in doing so, we do not lose any specialization opportunities. This approach makes it possible to exploit nested quasi-invariants and to speed up the run-time specialization process.This approach has been implemented in Tempo, a specializer for C programs that is publicly available. A preliminary experiment confirm that incremental that incremental specialization can greatly speed up the specialization process.


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
 
2
3
 
4
5
 
6
7
8
9
10
11
 
12
 
13
14
 
15
 
16
 
17
 
18
J.L. Lawall. Faster Fourier transforms via automatic program specialization. Publication interne 1192, IRISA, Rennes, France, May 1998.
19
 
20
 
21
 
22
 
23
F. NoiS1. Sp~cialisation dynamique de code par ~valuation partielle. PhD thesis, Universit~ de Rennes I, October 1996. In French.
 
24
 
25
Proceedings of the A CM $IGPLAN '96 Conference on Programming Language Design and Implementation, Philadelphia, PA, May 1996. ACM SIG- PLAN Notices, 31 (5).
 
26
Proceedings of the A CM SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, Nevada, June 15-18, 1997.
27
 
28
Conference Record of the 23rd Annual A CM $IGPLAN-$IGACT Symposium on Principles Of Programming Languages, St. Petersburg Beach, FL, USA, January 1996. ACM Press.
29
30
 
31
 
32
S. Thibault, R. Marlet, and C. ConseI. A domainspecific language for video device drivers: from design to implementation. In Conference on Domain Specific Languages, pages 11-26, Santa Barbara, CA, October 1997. Usenix.
33
 
34
E. N. Volanschi. Une approche automatique d la sp~cialisation de composants syst~me. Th~se de doctorat, Universit~ de Rennes I, February 1998.
35
36

CITED BY  19
 
 
 
 
 
 
 

Collaborative Colleagues:
Renaud Marlet: colleagues
Charles Consel: colleagues
Philippe Boinot: colleagues

Peer to Peer - Readers of this Article have also read: