Software Cache Techniques for Memory Nodes in Distributed Memory Parallel Production Systems
Summary :
Because the match phase in OPS5-type production systems requires most of the system's execution time and memory accesses, we proposed hash-based parallel production systems, CPPS (Clustered Parallel Production Systems), based on the RETE algorithm for distributed memory parallel computers, or multicomputers to reduce such a bottleneck. CPPS was effective in speeding up the match phase, but still left room for optimizations. In this paper, we introduce software cache techniques to memory nodes in the CPPS as one of the optimizations, and implement it on a multicomputer, nCUBE2. The benchmark results show that the CPPS with the software cache is about 2-fold faster than the original, and more than 7-fold faster than the simple hash method proposed by Acharya et al. for a large scale problem. The speed-up can be attributed to decreased communication costs.
- Publication
- IEICE TRANSACTIONS on Information Vol.E79-D No.8 pp.1046-1054
- Publication Date
- 1996/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Architectures, Algorithms and Networks for Massively Parallel Computing)
- Category
- Architectures
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jun MIYAZAKI, Haruo YOKOTA, "Software Cache Techniques for Memory Nodes in Distributed Memory Parallel Production Systems" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 8, pp. 1046-1054, August 1996, doi: .
Abstract: Because the match phase in OPS5-type production systems requires most of the system's execution time and memory accesses, we proposed hash-based parallel production systems, CPPS (Clustered Parallel Production Systems), based on the RETE algorithm for distributed memory parallel computers, or multicomputers to reduce such a bottleneck. CPPS was effective in speeding up the match phase, but still left room for optimizations. In this paper, we introduce software cache techniques to memory nodes in the CPPS as one of the optimizations, and implement it on a multicomputer, nCUBE2. The benchmark results show that the CPPS with the software cache is about 2-fold faster than the original, and more than 7-fold faster than the simple hash method proposed by Acharya et al. for a large scale problem. The speed-up can be attributed to decreased communication costs.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_8_1046/_p
Copy
@ARTICLE{e79-d_8_1046,
author={Jun MIYAZAKI, Haruo YOKOTA, },
journal={IEICE TRANSACTIONS on Information},
title={Software Cache Techniques for Memory Nodes in Distributed Memory Parallel Production Systems},
year={1996},
volume={E79-D},
number={8},
pages={1046-1054},
abstract={Because the match phase in OPS5-type production systems requires most of the system's execution time and memory accesses, we proposed hash-based parallel production systems, CPPS (Clustered Parallel Production Systems), based on the RETE algorithm for distributed memory parallel computers, or multicomputers to reduce such a bottleneck. CPPS was effective in speeding up the match phase, but still left room for optimizations. In this paper, we introduce software cache techniques to memory nodes in the CPPS as one of the optimizations, and implement it on a multicomputer, nCUBE2. The benchmark results show that the CPPS with the software cache is about 2-fold faster than the original, and more than 7-fold faster than the simple hash method proposed by Acharya et al. for a large scale problem. The speed-up can be attributed to decreased communication costs.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Software Cache Techniques for Memory Nodes in Distributed Memory Parallel Production Systems
T2 - IEICE TRANSACTIONS on Information
SP - 1046
EP - 1054
AU - Jun MIYAZAKI
AU - Haruo YOKOTA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1996
AB - Because the match phase in OPS5-type production systems requires most of the system's execution time and memory accesses, we proposed hash-based parallel production systems, CPPS (Clustered Parallel Production Systems), based on the RETE algorithm for distributed memory parallel computers, or multicomputers to reduce such a bottleneck. CPPS was effective in speeding up the match phase, but still left room for optimizations. In this paper, we introduce software cache techniques to memory nodes in the CPPS as one of the optimizations, and implement it on a multicomputer, nCUBE2. The benchmark results show that the CPPS with the software cache is about 2-fold faster than the original, and more than 7-fold faster than the simple hash method proposed by Acharya et al. for a large scale problem. The speed-up can be attributed to decreased communication costs.
ER -
English
