.png){kind=icon}
返回
A distributed memory algorithm for lexicon building
.png){kind=icon}
PRE
AI
DOI：10.1006/jpdc.1997.1344.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A parallel algorithm for preparing word frequency concordances over two specified sets of documents from a collection is presented. Good parallel efficiency is demonstrated on a 128-node distributed memory machine using sets whose combined size exceeds one gigabyte. It is demonstrated that efficiency is heavily influenced by hashing and communication strategies. A two-stage hashing algorithm is proposed to reduce communication overhead. Ways of increasing capacity are considered, and the applicability of the algorithm to other text-processing functions such as index and symbol-table building is outlined. (C) 1997 Academic Press.
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
.png){kind=icon}
