Name
Abstract | ||
|---|---|---|
Abstract The combination of Or - Parallelism and Constraint Logic Programming (CLP) has proven to be very effective in tackling large combinatorial problems in real - life applications However, existing implementations have focused on shared - memory multiprocessors In this paper, we investigate how we can efficiently implement Or - Parallel CLP languages on heterogeneous networks, where communication bandwidth is much lower and heterogeneity requires all communication to be in a machine - independent format Since a recomputation - based system has the potential to solve these problems, we analyse the performance of a prototype using this approach On a representative set of CLP programs we show that close to optimal speedups can be obtained on networks for programs generating large search spaces and that the overhead of recomputation is surprisingly low We compare this approach with that of stack - copying and also discuss how side - effects can be dealt with during recomputation The main conclusion of the paper is that recomputation is a clean and efficient execution model for Or - Parallel CLP systems on heterogeneous networks Parallel Logic Programming, CLP, Heterogeneous computing, Recomputation, Or - Parallelism |
Year | Venue | Keywords |
|---|---|---|
1994 | ICLP | heterogeneous network,parallel clp,search space,side effect,heterogeneous computing |
Field | DocType | ISSN |
Computer science,Parallel computing,Implementation,Communication bandwidth,Concurrent constraint logic programming,Execution model,Heterogeneous network,Constraint logic programming,Distributed computing | Conference | 1061-0464 |
ISBN | Citations | PageRank |
0-262-72022-1 | 11 | 0.84 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shyam Mudambi | 1 | 69 | 6.20 |
| Joachim Schimpf | 2 | 112 | 11.60 |