An optimal parallel algorithm for arithmetic expression parsing

Proceedings Sixth International Parallel Processing Symposium Pub Date : 1992-03-01 DOI:10.1109/IPPS.1992.223044

W. Deng, S. Iyengar

引用次数: 2

Abstract

The paper discusses an optimal parallel algorithm for tree form generation of arithmetic expressions on an SIMD-SM EREW model. The main idea is how to avoid the read conflict posted by Bar-On and Vishkin's algorithm (1985) by modifying their parenthesis pairing algorithm.<>

查看原文本刊更多论文

算法表达式解析的一种最优并行算法

本文讨论了SIMD-SM EREW模型上树形算术表达式生成的最优并行算法。主要思想是如何通过修改括号配对算法来避免Bar-On和Vishkin算法(1985)提出的读冲突

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings Sixth International Parallel Processing Symposium

自引率

0.00%

发文量