dieter@Schopenhauer.gmd.first.de (Dieter Esswein) (02/11/91)
Thanks to all who responded. Here comes the summary of the responses to my question: >Are there any statistical data available on communication and/or memory >access patterns of parallel, non-numerical applications ? >Are there any benchmarks ? Perhaps written in Lisp ? ************************************************************************ hugo@griggs.dartmouth.edu (Peter Su) I'm writing some code for parallel point location that might generate from interesting data for this sort of study. iam@gang-of-four.stanford.edu (Ian Mason) i'm not sure if it fits your description but we did a bunch of stuff in "programming in qlisp" by i mason, j pehoushek, c talcott, and j weening stanford cs report no stan-cs-90-1340 and most of it (actually all) was non-numerical ht@cogsci.ed.ac.uk (Henry Thompson) Two papers of mine describe experience with parallel implementations of chart parsers: Thompson, H.S. 1989e. "Chart Parsing for Loosely Coupled Parallel Systems", in Proceedings of the International Workshop on Parsing Technologies, Carnegie Mellon University, also to appear in Tomita, M. ed. Current Issues in Parsing Technologies, MIT Press, in press. Thompson, H.S. 1991b. "Parallel Parsers for Context-Free Grammars - Two Actual Implementations Compared", in Adriaens, G. and Hahn, U. eds. Parallel Models of Natural Language Computation, Ablex Publishing Corp, Norwood NJ USA, in pres.