An efficient Parallel Substrate for Typed Feature Structures on shared memory parallel machines
Pages 968 - 974
Abstract
This paper describes an efficient parallel system for processing Typed Feature Structures (TFSs) on shared-memory parallel machines. We call the system Parallel Substrate for TFS (PSTFS). PSTFS is designed for parallel computing environments where a large number of agents are working and communicating with each other. Such agents use PSTFS as their low-level module for solving constraints on TFSs and sending/receiving TFSs to/from other agents in an efficient manner. From a programmers' point of view, PSTFS provides a simple and unified mechanism for building high-level parallel NLP systems. The performance and the flexibility of our PSTFS are shown through the experiments on two different types of parallel HPSG parsers. The speed-up was more than 10 times on both parsers.
References
[1]
Adriaens and Hahn, editors. 1994. Parallel Natural Language Processing. Ablex Publishing Corporation, New Jersey.
[2]
Bob Carpenter and Gerald Penn. 1994. ALE 2.0 user's guide. Technical report, Carnegie Mellon University Laboratory for Computational Linguistics, Pittsburgh, PA.
[3]
Bob Carpenter. 1992. The Logic of Typed Feature Structures. Cambridge University Press, Cambridge, England.
[4]
K. Clark and S. Gregory. 1986. Parlog: Parallel programming in logic. Journal of the ACM Transaction on Programming Languages and Systems, 8(1): 1--49.
[5]
Ralph Grishman and Mehesh Chitrao. 1988. Evaluation of a parallel chart parser. In Proceedings of the second Conference on Applied Natural Language Processing, pages 71--76. Association for Computational Linguistics.
[6]
T. Kasami. 1965. An efficient recognition and syntax algorithm for context-free languages. Technical Report AFCRL-65-758, Air Force Cambrige Research Lab., Bedford, Mass.
[7]
Takaki Makino, Minoru Yoshida, Kentaro Torisawa, and Jun'ichi Tsujii. 1998. LiLFeS-towards a practical HPSG parser. In COLING-ACL'98 Proceedings, August.
[8]
Yuji Matsumoto. 1987. A parallel parsing system for natural language analysis. In Proceedings of 3rd International Conference on Logic Programming, pages 396--409.
[9]
Yutaka Mitsuishi, Kentaro Torisawa, and Jun'ichi Tsujii. 1998. HPSG-style underspecified Japanese grammar with wide coverage. In COLING-ACL'98 Proceedings, August.
[10]
Anton Nijholt, 1994. Parallel Natural Language Processing, chapter Parallel Approaches to Context-Free Language Parsing, pages 135--167. Ablex Publishing Corporation.
[11]
Takashi Ninomiya, Kentaro Torisawa, Kenjiro Taura, and Jun'ichi Tsujii. 1997. A parallel cky parsing algorithm on large-scale distributed-memory parallel machines. In PACLING '97, pages 223--231, September.
[12]
Kenjiro Taura. 1997. Efficient and Reusable Implementation of Fine-Grain Multithreading and Garbage Collection on Distributed Memory Parallel Computers. Ph.D. thesis, Department of Information Sciencethe, University of Tokyo.
[13]
Henry S. Thompson, 1994. Parallel Natural Language Processing, chapter Parallel Parsers for Context-Free Grammars-Two Actual Implementations Comparesd, pages 168--187. Ablex Publishing Corporation.
[14]
Kazunori Ueda. 1985. Guarded horn clauses. Technical Report TR-103, ICOT.
- An efficient Parallel Substrate for Typed Feature Structures on shared memory parallel machines
Recommendations
The NYU Ultracomputer Designing an MIMD Shared Memory Parallel Computer
We present the design for the NYU Ultracomputer, a shared-memory MIMD parallel machine composed of thousands of autonomous processing elements. This machine uses an enhanced message switching network with the geometry of an Omega-network to approximate ...
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs
Clusters of SMPs are hybrid-parallel architectures that combine the main concepts of distributed-memory and shared-memory parallel machines. Although SMP clusters are widely used in the high performance computing community, there exists no single ...
A Benchmark Parallel Sort for Shared Memory Multiprocessors
The first parallel sort algorithm for shared memory MIMD (multiple-instruction-multiple-data-stream) multiprocessors that has a theoretical and measured speedup near linear is exhibited. It is based on a novel asynchronous parallel merge that evenly ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Government of Canada
- Université de Montréal
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 10 August 1998
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 245Total Downloads
- Downloads (Last 12 months)31
- Downloads (Last 6 weeks)2
Reflects downloads up to 28 Dec 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