On mapping production systems onto multiprocessors

https://doi.org/10.1016/0169-023X(96)00032-8Get rights and content

Abstract

In this paper, we consider the problem of mapping rules in a production system onto nodes in a multiprocessor system. Since this problem is NP-hard, we present an efficient heuristic algorithm based on simulated annealing to solve this mapping problem. Compared to conventional simulated annealing algorithms to solve this problem, where moves or exchanges are used exclusively as perturbation functions, we use a combination of moves and exchanges to achieve consistently better solutions in a reasonable amount of computation time. Further, by restricting the random acceptance of configurations (mappings) during the annealing process, we achieve a faster convergence. We demonstrate the effectiveness of our algorithm by comparing its performance with that of another recently proposed algorithm for mapping rule based systems onto multiprocessors.

References (15)

  • V.V. Dixit et al.

    The allocation problem in parallel production systems

    J. Parallel and Distributed Computing

    (1990)
  • J. Xu et al.

    Mapping rule-based systems onto multicomputers using simulated annealing

    J. Parallel Distributed Computing

    (1991)
  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
  • A. Gupta

    Parallelism in production systems: The sources and the expected speed-up

  • A. Gupta et al.

    Parallel algorithms and architectures for rule-based systems

  • A. Gupta et al.

    Suitability of message passing computers for implementing production systems

  • T. Ishida et al.

    Towards the parallel execution of rules in production system programs

There are more references available in the full text version of this article.

Cited by (0)

View full text