Compiling Parallel Lisp for a Shared Memory Multiprocessor
| dc.contributor.author | M D FENG | en_US |
| dc.contributor.author | W F WONG | en_US |
| dc.contributor.author | C K YUEN | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T07:00:34Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T07:00:34Z | |
| dc.date.issued | 1995-02-01T00:00:00Z | en_US |
| dc.description.abstract | There is a commonly held idea that although Lisp is a good language for prototyping and software development, it is often too inefficient to be useful in actual implementation. Advances in compiling Lisp have begun to change this notion. However, the situation is less clear in the case of parallel Lisp dialects. In this paper, we report on our experience in implementing a compiler for a parallel Lisp dialect we called {\em BaLinda Lisp} for a shared memory multiprocessor. For a class of problems, our compiler was able to achieve performances on Lisp programs that are near, if not equal to, their imperative (C) equivalents. However, on other problems, the situation is less than ideal. We investigate this phenomenum and outline the future challenges in realizing a production strength parallel Lisp compiler. | en_US |
| dc.format.extent | 180824 bytes | en_US |
| dc.format.extent | 170835 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1379 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRA2/95 | en_US |
| dc.title | Compiling Parallel Lisp for a Shared Memory Multiprocessor | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1