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 carrier-graphs. EARS provide scalable parallelism because efficient sequential evaluation techniques also exist.
展开▼
