Performance of a highly unstructured parallel algorithm on the KSR1

Tom Nurkkala, Vipin Kumar

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high efficiency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architectures for algorithms that require shared data structures. Finally, the paper presents practical guidelines for the efficient use of the KSR1.

Original languageEnglish (US)
Pages215-220
Number of pages6
StatePublished - Dec 1 1994
EventProceedings of the Scalable High-Performance Computing Conference - Knoxville, TN, USA
Duration: May 23 1994May 25 1994

Other

OtherProceedings of the Scalable High-Performance Computing Conference
CityKnoxville, TN, USA
Period5/23/945/25/94

Fingerprint Dive into the research topics of 'Performance of a highly unstructured parallel algorithm on the KSR1'. Together they form a unique fingerprint.

Cite this