goldste%hub.toronto.edu@RELAY.CS.NET (Jack Goldstein) (07/12/88)
I am currently investigating various strategies for main-
taining cache consistency in medium and large-scale shared-memory
multiprocessors (with over 50 processors). Part of this research
involves determining the range of memory access patterns that
programs running on these machines exhibit. I have no experience
programming computers of this size, so I would like to get hold
of a lot of parallel programs which can run on them. If you can
send me source for a program or programs that meets most or all
of the following criteria, I will be eternally grateful:
1. Can effectively utilize more than 20 processors. Note
that the program need not have been written with that in
mind. I'm sure that there are many programs running on
small bus-based multiprocessors that could use additional
processors effectively if they were there.
2. Less than 2000 lines of source.
3. Written in a procedural language (eg. C, Pascal, Fortran,
Ada, etc.).
4. Reasonably well documented. This is less important in
smaller programs.
5. The programming paradigm doesn't really matter. In fact,
I'd welcome a variety of them.
I'm especially interested in getting programs that have ac-
tually been written for large multiprocessors such as the But-
terfly, Cedar, RP3, etc.
All copyrights will be respected.
If you have a whole archive of source that you think would
be relevant but don't want to e-mail the whole thing, please let
me know and I'll send you a tape.
Thanks,
Jack
Jack Goldstein
University of Toronto -- Toronto, Canada
UUCP: {decvax,linus,utzoo,uw-beaver}!utcsri!uthub!goldste
ARPA: goldste%hub.toronto.edu@relay.cs.net
CSNET: goldste@hub.toronto.edu
CDNNET: goldste@hub.toronto.cdn
BITNET: goldste@hub.utoronto (may not work from all sites)