| V.V. Dixit and D.I. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990. |
....production systems. In [22] Srivastava has discussed two different scheduling mechanism, namely, pre analysis and post analysis for parallel executions of productions in database production systems. The problem of partitioning productions in a production system for parallel execution is shown in [7] as a 0 1 integer programming with a quadratic objective function which is NP complete [9] We have, perhaps for the first time, studied the problem of clustering and distributing rules of a given global knowledge base across a set of interconnected relational database systems in order to convert ....
....mapping involves some overheads at execution time and is not guaranteed to be cost effective. The problem of clustering can be formulated as a 0 1 quadratic assignment problem, and therefore it is similar to other assignment problems such as allocation problem in parallel production systems [7], scheduling and routing [14] etc. We will also show that this problem can be reduced to 0 1 linear programming problem. 3.1 Formulation of the Problem As stated earlier, our objective is to find an allocation of rules to sites which gives minimum communication cost among the sites. The ....
V.V. Dixit and D.I. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990.
....developers and users is advocated by many reference and text books on expert systems. For instance, the use of metarules (rules containing knowledge about the organization of the knowledge base) as a means of navigating among the various rule groups is mentioned in [11, 17] Several papers [8, 22, 26] address explicitly the issue of the knowledge base partitioning in production systems from the perspective of facilitating their verification, validation and maintenance. In [1] the authors have discussed a method for clustering Prolog rules and facts for distributed computations. The clustering ....
V.V. Dixit and D.I. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990.
....95 4.1 78 97 [7] amd 196 8.2 197 1610 [7] abacab 107 8.0 171 1028 [7] Table 1: Static measures for some existing benchmarks. The benchmarks included in Tables 1 and 2 are found in the works of Acharya et al. 2, 1] Amaral [3, 4] Bouaud [7] Brant et al. 9] Dixit and Moldovan [8], Gupta [10] Kuo et al. 14] Kuo and Moldovan [15] Miranker and Lofaso [17, 18] Neiman [19] Oflazer [20] Schmolze [21] and Ishida [13] We now briefly state what each benchmark program does. Bench. # Prod Ant. prod # WMEs Pub. MAB 13 2.6 11 [17, 18] Mud 884 2.4 241 [17] Waltz 33 3.9 42 ....
V. V. Dixit and D. L. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990.
....WMEs we report the number available in the publication. This number gives an idea for the size of the database manipulated by each benchmark. The benchmarks included in Tables 1 and 2 are found in the works of Acharya et al. 2, 1] Amaral [3, 5] Bouaud [7] Brant et al. 9] Dixit an Moldovan [8], Gupta [10] Kuo et al. 11] Kuo and Moldovan [12] Miranker and Lofaso [13, 14] Neiman [15] Oflazer [16] Schmolze [17] Bench. # Prod Ant. prod Cons. prod # WME types # WMEs Pub. life 40 6.1 1.3 5 104 [3, 11] hotel 80 4.1 2.0 62 484 [3] patents 86 5.2 1.2 4 136 [3] waltz2 10 2.7 8.0 7 ....
V. V. Dixit and D. L. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990.
....the problem of allocation of relations, the relationship between relations is not given in the beginning but is taken into account by determining during query execution strategy. In rule allocation problem, the relationship between rules is given before hand for consideration. Several papers [17, 9, 19] address explicitly the issue of the knowledge base partitioning. The problem of partitioning productions in a production systems for parallel execution is shown in [17, 9, 19] as a 0 1 integer programming problem with a quadratic objective function which is NP complete [11] In [12] this problem ....
....In rule allocation problem, the relationship between rules is given before hand for consideration. Several papers [17, 9, 19] address explicitly the issue of the knowledge base partitioning. The problem of partitioning productions in a production systems for parallel execution is shown in [17, 9, 19] as a 0 1 integer programming problem with a quadratic objective function which is NP complete [11] In [12] this problem has been addressed from the perspective of facilitating maintenance of the knowledge base. Their clustering algorithm is based on a measure of closeness between rules. In [9] ....
[Article contains additional citation context not shown here]
V.V. Dixit and D.I. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20--29, 1990.
....to special purpose hardware such as neural net simulators, to internet linked massively parallel computers. Thus a heterogeneous, distributed environment is a collection of modular, autonomous, and not necessarily homogeneous, processors that communicate with one another via message passing [12, 13, 14]. Distributed simulation schemes in the literature[15] typically require that each processor be able to execute autonomously with relatively infrequent messagepassing. Because of this, almost all implementations of such algorithms have been on coarse grained, MIMD machines. In designing a ....
V. V. Dixit and D. I. Moldova, "The allocation problem in parallel production systems", Journal of Parallel Distributed Computing, vol. 8, no. 1, pp. 20-29, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC