Difference between revisions of "Publications/verna.06.imecs"
From LRDE
Line 10: | Line 10: | ||
| urllrde = 200606-IMECS |
| urllrde = 200606-IMECS |
||
| abstract = Contrary to popular belief, Lisp code can be very efficient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how efficiency is achieved by the compilers. These techniques are applied to simple image processing algorithms in order to demonstrate the announced performance on pixel access and arithmetic operations in both languages. |
| abstract = Contrary to popular belief, Lisp code can be very efficient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how efficiency is achieved by the compilers. These techniques are applied to simple image processing algorithms in order to demonstrate the announced performance on pixel access and arithmetic operations in both languages. |
||
− | | lrdepaper = http://www.lrde.epita.fr/dload/papers/verna.06.imecs.pdf |
||
| lrdekeywords = Software engineering |
| lrdekeywords = Software engineering |
||
| lrdenewsdate = 2007-06-11 |
| lrdenewsdate = 2007-06-11 |
Revision as of 01:03, 10 March 2015
- Authors
- Didier Verna
- Where
- Proceedings of the International MultiConference of Engineers and Computer Scientists
- Place
- Hong Kong
- Type
- inproceedings
- Keywords
- Software engineering
- Date
- 2007-06-11
Abstract
Contrary to popular belief, Lisp code can be very efficient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how efficiency is achieved by the compilers. These techniques are applied to simple image processing algorithms in order to demonstrate the announced performance on pixel access and arithmetic operations in both languages.
Bibtex (lrde.bib)
@InProceedings{ verna.06.imecs, author = {Didier Verna}, title = {How to make Lisp go faster than {C}}, booktitle = {Proceedings of the International MultiConference of Engineers and Computer Scientists}, year = 2006, address = {Hong Kong}, month = jun, organization = {International Association of Engineers}, isbn = {988-98671-3-3}, project = {Software}, abstract = {Contrary to popular belief, Lisp code can be very efficient today: it can run as fast as equivalent C code or even faster in some cases. In this paper, we explain how to tune Lisp code for performance by introducing the proper type declarations, using the appropriate data structures and compiler information. We also explain how efficiency is achieved by the compilers. These techniques are applied to simple image processing algorithms in order to demonstrate the announced performance on pixel access and arithmetic operations in both languages.} }