Programming expert systems in OPS5: an introduction to rule-based programming
Programming expert systems in OPS5: an introduction to rule-based programming
MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
The theory of database concurrency control
The theory of database concurrency control
Communications of the ACM - Special issue on parallelism
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A calculus for complex objects
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Computer
Software—Practice & Experience
TREAT: a new and efficient match algorithm for AI production systems
TREAT: a new and efficient match algorithm for AI production systems
A self-controlling interpreter for the relational production language
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
PRESTO: a system for object-oriented parallel programming
Software—Practice & Experience
Rule-based programming under OPS5
Rule-based programming under OPS5
High-speed implementations of rule-based systems
ACM Transactions on Computer Systems (TOCS)
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
Making deductive databases a practical technology: a step forward
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The concurrent language, Shared Prolog
ACM Transactions on Programming Languages and Systems (TOPLAS)
Set-oriented constructs: from Rete rule bases to database systems
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Match algorithms for generalized Rete networks
Artificial Intelligence
The state of the art in parallel production systems
Journal of Parallel and Distributed Computing
Task scheduling in parallel and distributed systems
Task scheduling in parallel and distributed systems
Scalable parallel and distributed expert database systems with predictive load balancing
Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Predictive dynamic load balancing of parallel and distributed rule and query processing
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Issues in the design and control of parallel rule-firing production systems
Journal of Parallel and Distributed Computing
Grain Size Determination for Parallel Processing
IEEE Software
The Organization and Performance of a TREAT-Based Production System Compiler
IEEE Transactions on Knowledge and Data Engineering
Object-Oriented Query Languages: The Notion and the Issues
IEEE Transactions on Knowledge and Data Engineering
Effects of Database Size on Rule System Performance: Five Case Studies
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
An Overview of the Fortran D Programming System
Proceedings of the Fourth International Workshop on Languages and Compilers for Parallel Computing
Parallelism in production systems
Parallelism in production systems
Theory of Relational Databases
Theory of Relational Databases
Rule-based intelligent adaptation in mobile information systems
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Decomposition abstraction is the process of organizing and specifying decomposition strategies for the exploitation of parallelism available in an application. In this paper we develop and evaluate declarative primitives for rule-based programs that expand opportunities for parallel execution. These primitives make explicit, implicit relations among the data and similarly among the rules. The semantics of the primitives are presented in a general object-based framework such that they may be applied to most rule-based programming languages.We show how the additional information provided by the decomposition primitives can be incorporated into a semantic-based dependency analysis technique. The resulting analysis reveals parallelism at compile time that is very difficult, if not impossible, to discover by traditional syntactic analysis techniques. Simulation results demonstrate scalable and broadly available parallelism.