Parallel Programming of Rule-Based Systems with Decomposition Abstraction

Abstract

Decomposition abstraction is the process of organizing and specifying decomposition strategies for the exploitation of parallelism available in an application. In a recent paper [14], we have developed and evaluated declarative primitives for rule-based programs that expand opportunities for parallel execution. In this paper, we discuss the programming of parallel rule-based systems using decomposition abstraction primitives. We propose methodologies for transforming sequential rule programs into parallel programs and for programming parallel systems from scratch. Preliminary implementation and experimentation results demonstrate scalable and broadly available parallelism.