University of Limerick Institutional Repository

A graph-based definition of distillation

DSpace Repository

Show simple item record

dc.contributor.author Hamilton, Geoff W.
dc.contributor.author Mendel-Gleason, Gavin E.
dc.date.accessioned 2011-01-26T16:06:14Z
dc.date.available 2011-01-26T16:06:14Z
dc.date.issued 2010
dc.identifier.uri http://hdl.handle.net/10344/665
dc.description peer-reviewed en_US
dc.description.abstract In this paper, we give a graph-based definition of the distillation transformation algorithm. This definition is made within a similar framework to the positive supercompilation algorithm, thus allowing for a more in-depth comparison of the two algorithms. We find that the main distinguishing characteristic between the two algorithms is that in positive supercompilation, generalization and folding are performed with respect to expressions, while in distillation they are performed with respect to graphs. We also find that while only linear improvements in performance are possible using positive supercompilation, super-linear improvements are possible using distillation. This is because computationally expensive terms can only be extracted from within loops when generalizing graphs rather than expressions. en_US
dc.language.iso eng en_US
dc.publisher Meta2010 en_US
dc.relation.ispartofseries Proceedings of Meta2010 Second International Workshop on Metacomputation in Russia;pp.47-63
dc.relation.uri http://meta2010.pereslavl.ru/accepted-papers/paper-info-2.html
dc.subject distillation transformation algorithm en_US
dc.subject positive supercompilation algorithm en_US
dc.title A graph-based definition of distillation en_US
dc.type Conference item en_US
dc.type.supercollection all_ul_research en_US
dc.type.supercollection ul_published_reviewed en_US
dc.type.restriction none en
dc.contributor.sponsor SFI
dc.relation.projectid 03/CE2/I303_1


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ULIR


Browse

My Account

Statistics