larus@PARIS.BERKELEY.EDU (James Larus) (09/16/88)
I am looking for some small-to-medium sized Scheme programs as test
cases for my dissertation research. These programs should have
side-effect producing operations and should do something "real" (i.e.,
fib, tak, etc. need not apply).
My research is studying how to restructure Lisp programs for
concurrent execution. For more details, see [1]. Your program
doesn't need to be inherently parallel, though if you have a copy in a
parallel dialect, I'd also be interested in it.
All I offer in exchange for your code is immortality in a footnote
(they do keep dissertations forever, don't they?).
/Jim
ARPA: larus@ginger.Berkeley.EDU
uucp: ucbvax!larus
larus@berkeley
[1] James R. Larus and Paul N. Hilfinger,
"Restructuring {Lisp} Programs for Concurrent Execution",
in "ACM SIGPLAN Symposium on Parallel Programming", July, 1988.mjk@JUPITER.RISC.COM (Morry Katz) (09/29/88)
From: larus%paris.Berkeley.EDU@ginger.Berkeley.EDU (James Larus) Reply-To: larus@ginger.Berkeley.EDU Date: Thu, 15 Sep 88 16:14:43 PDT I am looking for some small-to-medium sized Scheme programs as test cases for my dissertation research. These programs should have side-effect producing operations and should do something "real" (i.e., fib, tak, etc. need not apply). My research is studying how to restructure Lisp programs for concurrent execution. For more details, see [1]. Your program doesn't need to be inherently parallel, though if you have a copy in a parallel dialect, I'd also be interested in it. All I offer in exchange for your code is immortality in a footnote (they do keep dissertations forever, don't they?). I have been looking for the same sorts of programs to test my system, with little sucess. I would be most appreciative if you would forward any replies you get to me as well. Morry Katz
gjc@BUCSF.BU.EDU (George J. Carrette) (10/02/88)
The mit cscheme implementation comes with quite a bit of scheme code you can try to run in parallel. There must be a lot of dispatching and data conversion in the arithmetic/bignum code, there must be sorting code, syntax conversion routines etc. You could also look at using the compiler from the yale T system. It has all sorts of passes that do interesting things with list structure. -gjc