The Performance of a Highly Unstructured Parallel on the KSR1* Algorithm
Tom Nurkkala, Vipin Kumar · 1994
This paper examines the performance on the Kendall Square Research KSRl multicomputer of a highly unstructured algorithm for natural language parsing. It describes a nee Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high eficiency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architt ctures for algorithms that require shared data structures. Finally, the paper presents practical guidelines for the eficient use of the KSRl.