Using processor affinity in loop scheduling on shared-memory multiprocessors
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Natural language multiprocessing: a case study
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Parallel Natural Language Processing
Parallel Natural Language Processing
A Parallel Parsing Algorithm for Natural Language using Tree Adjoining Grammar
Proceedings of the 8th International Symposium on Parallel Processing
Automatic Generation of Portable Parallel Natural Language Parsers
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Efficient feature structure operations without compilation
Natural Language Engineering
A compact architecture for dialogue management based on scripts and meta-outputs
ANLC '00 Proceedings of the sixth conference on Applied natural language processing
Quasi-destructive graph unification
ACL '91 Proceedings of the 29th annual meeting on Association for Computational Linguistics
Relating complexity to practical performance in parsing with wide-coverage unification grammars
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
Research on architectures for integrated speech/language systems in Verbmobil
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Memory-efficient and thread-safe quasi-destructive graph unification
ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics
Hi-index | 0.00 |
Multi-processor systems are becoming more commonplace and affordable. Based on analyses of actual parsings, we argue that to exploit the capabilities of such machines, unification-based grammar parsers should distribute work at the level of individual unification operations. We present a generic approach to parallel chart parsing that meets this requirement, and show that an implementation of this technique for LinGO achieves considerable speedups.