Bulk processing of text on a massively parallel computer
Pages 128 - 135
Abstract
Dictionary lookup is a computational activity that can be greatly accelerated when performed on large amounts of text by a parallel computer such as the Connection MachineTM Computer (CM). Several alogrithms for parallel dictionary lookup are discussed, including one that allows the CM to lookup words at a rate 450 times that of lookup on a Symbolics 3600 Lisp Machine.
References
[1]
Akl, Selim G. Parallel Sorting Algorithms, 1985, Academic Press, Inc.
[2]
Feynman, Carl Richard, and Guy L. Steele Jr. Connection Machine Macroinstruction Set, REL 2.3., Thinking Machines Corporation. (to appear)
[3]
Hillis, W. Daniel. The Connection Machine, 1985, The MIT Press, Cambridge, MA.
[4]
Lasser, Clifford A., and Stephen M. Omohundro. The Essential *Lisp Manual, Thinking Machines Corporation. (to appear)
[5]
Leiserson, Charles, and Bruce Maggs. "Communication-Efficient Parallel Graph Algorithms," Laboratory for Computer Science, Massachusetts Institute of Technology. (to appear) (Note: scan is a special case of the treefix algorithm described in this paper.)
[6]
Omohundro, Steven M. "A Connection Machine Algorithms Primer," Thinking Machines Corporation. (to appear)
[7]
Resnikoff, Howard. The Illusion of Reality, 1985, in preparation.
[8]
Waltz, David L. and Jordan B. Pollack. "Massively Parallel Parsing: A Strongly Interactive Model of Natural Language Interpretation," Cognitive Science, Volume 9, Number 1, pp. 51--74, January-March, 1985.
- Bulk processing of text on a massively parallel computer
Recommendations
Implementation of GAMMA on a massively parallel computer
AbstractThe GAMMA paradigm is recently proposed by Banâtre and Métayer to describe the systematic construction of parallel programs without introducing artificial sequentially. This paper presents two synchronous execution models for GAMMA and discusses ...
Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing
IPPS '95: Proceedings of the 9th International Symposium on Parallel ProcessingWe describe our implementation, with virtual processing, of several parallel graph algorithms on a 16,384-processor MasPar MP-1. We present extensive test data on our code.
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 10 July 1986
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 263Total Downloads
- Downloads (Last 12 months)66
- Downloads (Last 6 weeks)10
Reflects downloads up to 23 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in