(MPPM)00- Parallel EARS
Download:
|
|
by Uwe Amann
http://www.ida.liu.se/~uweas/reports/ears-parallel.ps.gz
Add To MetaCart
Abstract:
In this paper we show how edge addition rewrite systems (Ears) can be evaluated in parallel. Ears are a simple variant of graph rewrite systems, which only add edges to graphs. Because Ears are equivalent to a subset of Datalog, they provide a programming model for rule-based applications. Ears terminate and are strongly confluent, which makes them perfectly apt for parallel execution. In this paper we present two parallel evaluation methods, order-domain partitioning and evaluation on carriergraphs. Because also efficient sequential evaluation techniques exist, Ears provide scalable parallelism.
Citations
| 640 | Depth-First Search and Linear Graph Algorithms – Tarjan - 1972 |
| 266 | Flow Analysis of Computer Programs – Hecht - 1977 |
| 260 | Logic Programming and Databases – Ceri, Gottlob, et al. - 1990 |
| 46 | An efficient hybrid algorithm for incremental data flow analysis – MARLOWE, G - 1990 |
| 14 | An Improved Transitive Closure Algorithm – Schmitz - 1983 |
| 11 | On Edge Addition Rewrite Systems and Their Relevance to Program Analysis – Amann - 1994 |
| 11 | Generierung von Programmoptimierungen mit Graphersetzungssystemen – Amann - 1995 |
| 2 | Performing Data Flow Analysis – Lee - 1992 |
| 2 | and Raghu Ramakrishnan. Efficient Transitive Closure Algorithms – Ioannidis - 1988 |
| 2 | Wavefront techniques for recursive logic programs – Seipel, Argenton - 1992 |
