Declarative solutions to partitioned-grid problems

Share/Save/Bookmark

Etalle, Sandro and Hartel, Pieter H. and Vree, Willem G. (1999) Declarative solutions to partitioned-grid problems. Software: Practice and Experience, 29 (13). pp. 1173-1200. ISSN 0038-0644

[img]PDF
Restricted to UT campus only
: Request a copy
264Kb
Abstract:The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program. The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms
Item Type:Article
Copyright:© 1999 John Wiley & Sons
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/55692
Official URL:http://dx.doi.org/10.1002/(SICI)1097-024X(199911)29:13<1173::AID-SPE276>3.0.CO;2-X
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page