Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!wuarchive!emory!hubcap!gt4589b
From: gt4589b@prism.gatech.edu (Davis, Jr., Martin H.)
Newsgroups: comp.parallel
Subject: Re: simple coarse-grained parallel programs
Message-ID: <12205@hubcap.clemson.edu>
Date: 11 Dec 90 18:09:45 GMT
References: <12190@hubcap.clemson.edu>
Sender: fpst@hubcap.clemson.edu
Organization: Georgia Institute of Technology
Lines: 35
Approved: parallel@hubcap.clemson.edu

In article <12190@hubcap.clemson.edu> feldy@CS.UCLA.EDU (Bob Felderman) writes:
>
>I participated in a project at UCLA a few years ago which did this type
>of thing on a network of PC-ATs. One of the real challenges was dealing with
>DOS!
>The code was never released, but was used here at UCLA for several projects
>and a class. No one seems to be aware of out work, or maybe they aren't
>interested!
>
>Here's the reference, it includes some performance analysis of two algorithms,
>a merge sort and parallel search (IDA*):
>
>R.E. Felderman, E.M. Schooler, L. Kleinrock
>The Benevolent Bandit Laboratory: A Testbed for Distributed Algorithms
>IEEE Journal on Selected Areas in Communications
>Vol 7, No. 2
>February 1989
>

I don't wish to seem impertinent, but I think the reason "No one seems
to be aware of our work . . ." is because of the journal in which the
article was published.  Being in a Computer Science department myself,
I don't believe I would have thought of looking in JSAC for such an
article (though there are others types of articles I look in JSAC
for).  I'm sure you had a good reason for this subject's being pub-
lished in JSAC, but that reason is not immediately obvious to me.

--Martin Davis


-- 
DAVIS,MARTIN HENRY JR
Georgia Institute of Technology, Atlanta Georgia, 30332
uucp: ...!{allegra,amd,hplabs,seismo,ut-ngp}!gatech!prism!gt4589b
ARPA: gt4589b@prism.gatech.edu