A Compilation Strategy for Numerical Programs Based on Partial Evaluation

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6981

Full metadata record

DC Field	Value	Language
dc.creator	Berlin, Andrew A.	-
dc.date	2004-10-20T20:12:09Z	-
dc.date	2004-10-20T20:12:09Z	-
dc.date	1989-02-01	-
dc.date.accessioned	2013-10-09T02:48:01Z	-
dc.date.available	2013-10-09T02:48:01Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AITR-1144	-
dc.identifier	http://hdl.handle.net/1721.1/6981	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	This work demonstrates how partial evaluation can be put to practical use in the domain of high-performance numerical computation. I have developed a technique for performing partial evaluation by using placeholders to propagate intermediate results. For an important class of numerical programs, a compiler based on this technique improves performance by an order of magnitude over conventional compilation techniques. I show that by eliminating inherently sequential data-structure references, partial evaluation exposes the low-level parallelism inherent in a computation. I have implemented several parallel scheduling and analysis programs that study the tradeoffs involved in the design of an architecture that can effectively utilize this parallelism. I present these results using the 9- body gravitational attraction problem as an example.	-
dc.format	7397665 bytes	-
dc.format	2736044 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AITR-1144	-
dc.title	A Compilation Strategy for Numerical Programs Based on Partial Evaluation	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI