HDTenEightyP/NetNews huggingface dataset:
From: dirk@rummelplatz.uni-mannheim.de (Wenzel)
Subject: Literature: Virtual Shared Memory
Apparently-To: comp-parallel@news.Germany.EU.net
Organization: Rechenzentrum Uni Mannheim (RUM)
Date: Wed, 22 Jul 92 14:33:15 GMT


I'm interested in literature about Virtual Shared Memory.
Could someone give me some hints on actual papers, books on this field.

Thanks in advance,

	Dirk.


Newsgroups: comp.parallel
From: ajay@hadar.cs.buffalo.edu (Ajay Shekhawat)
Subject: "Deskside" MP ?
Apparently-To: comp-parallel@cis.ohio-state.edu
Originator: ajay@hadar.cs.buffalo.edu
Reply-To: ajay@cs.buffalo.edu (Ajay Shekhawat)
Organization: University at Buffalo, Dept. of Computer Science
Posting-Software: pnews (version 1.4)
Distribution: na
Date: Wed, 22 Jul 1992 01:56:22 GMT

Has anyone heard of a "Deskside MP", called ZEPHYR, by a company called
WaveTracer ? (I may have the names wrong...)
Any info would be appreciated.

Ajay S.

ajay@cs.Buffalo.EDU


Newsgroups: comp.parallel
From: zaphiri@watson.ibm.com (Zaphiris Christidis)
Subject: Missing subject header
Reply-To: zaphiri@watson.ibm.com  (Zaphiris Christidis)
Organization: Clemson University
Date: Tue, 28 Jul 1992 21:11:14 GMT

Greetings.

Does anybody know of any review documentation or report on Maspar
available through anonymous ftp or through internet?

Any tips will be greately appreciated.  Please reply by e-mail.

--
Zaphiris Christidis
zaphiri(@watson.ibm.com @yktvmh.bitnet)

Newsgroups: comp.parallel
From: ravi@photonics.usc.edu (Ravi)
Subject: EXPRESS on SUN-SPARC 2
Organization: University of Southern California, Los Angeles, CA
Distribution: usa
Date: 24 Jul 1992 20:16:47 -0700

Hello,
I would like to receive the user's experience in using EXPRESS 
(from PARASOFT) software for Sun Workstations connected to Transputers.
Since the cost is quite high (compared to compilers etc.), I am curious
to receive some inputs from the actual users before bying them.
Please help.
I would appreciate if you could send me the mail to the following
address. 
                   ravi@photonics.usc.edu
Thanks in advance.
RAVI


Newsgroups: comp.parallel
From: ian@MasPar.COM (Ian L. Kaplan)
Subject: Re: Description of C*
Apparently-To: uunet!comp-parallel
Reply-To: ian@MasPar.COM (Ian L. Kaplan)
Organization: MasPar Computer Corporation, Sunnyvale, CA
Date: Fri, 24 Jul 1992 17:38:53 GMT

>Peter "R.Hoare" <peteh@cs.rhbnc.ac.uk> writes:
>Could anybody tell me where I can get a good reference to the new
>version of C* which is being proposed as a ANSI standard parallel C.

  To avoid any misunderstanding I would like to emphasize that C* is
just one input to the ANSI parallel C standardization process.  A
number of companies and individuals, including Thinking Machines and
MasPar, are involved in the process.  C* will be an important
influence, but it is by no means a "defacto standard".

                           Ian Kaplan
			   ian@maspar.com

Newsgroups: comp.parallel
From: steve@compsci.bristol.ac.uk
Subject: Re: CSP to STRAND/Parlog
Organization: Clemson University
Date: Mon, 27 Jul 1992 14:08:57 GMT

In article <1992Jul23.134920.4944@hubcap.clemson.edu> zenith@kai.com (Steven Zenith) writes:
>In article <1992Jul20.075511.17628@dcs.qmw.ac.uk>, mmh@cs.qmw.ac.uk
>Matthew Huntbach writes:
>
>> If you think that Strand or Parlog are basically
>> "parallel Prologs", you are completely wrong. Many people who
>> program in them, such as myself, think of them more in CSP-like
>> terms than in Prolog-like terms.
>
>I'm pleased to hear it, I don't dispute that a parallel between CSP and
>Strand or Parlog can be drawn - but you don't answer my question: why is the
>parallel between committed choice concurrent logic languages closer than any
>other (say, CSP and functional or concurrent imperative languages)?
>

The "parallel" between CSP and concurrent logic programming languages is
no coincidence: the design of Parlog began in 1979/80 as a deliberate
attempt to recast CSP (Hoare, 1978) in a logic programming framework.  
As it turned out, the differences between CSP and CLP proved to be more
interesting than their obvious similarities.  There are plenty of other
languages around (including logic-based and imperative ones) that have 
more in common with CSP.  (Not functional languages, of course: they
don't have non-determinism.)

steve gregory

Newsgroups: comp.parallel
From: steele@vlsi.cs.caltech.edu (Craig Steele)
Subject: Re: Literature: Virtual Shared Memory
Apparently-To: comp-parallel@ucsd.edu
Reply-To: steele@vlsi.cs.caltech.edu (Craig Steele)
Organization: California Institute of Technology
Date: Wed, 22 Jul 1992 18:02:08 GMT

A survey article is Nitzberg and Lo, IEEE Computer, August 1991.


Craig Steele, steele@vlsi.caltech.edu

Newsgroups: comp.parallel
From: rzthlb@tuhhco.rz.tu-harburg.de (Lutz Behnke)
Subject: Yellow Pages and PVM on a Silicon
Originator: rzthlb@tuhhco.rz.tu-harburg.de
Keywords: PVM, Yellow Pages, Silicon
Reply-To: behnke@tu-harburg.dbp.de
Organization: Techn. Uni. Hamburg-Harburg, Germany
Date: 29 Jul 92 11:26:20 GMT



To all wiz Programmers out there:

has anybody done a adaption of PVM in order to use Yellow Pages-password Handling
instead of the original Unix getpwent(uid) used in main.c

I am currently trying to install PVM on a subnet of Silicons and one of hp/ux's
both of them use YP to make SysAd easier

I would apreceate a C-Source Interface to the Yellow Pages greately, but
would also be happy with a trick to get by YP without a code change.

Thanks for any upcoming mail.

PS If you thing this doesn't belong here flame me (privately)
PSS please excuse any spelling a/o grammar mistakes

----
lutz 


-- 
| Lutz Behnke | behnke@tu-harburg.dbp.de | (Germany) 040 / 630 39 38 |
|  TU Hamburg Harburg, Hamburg, Germany, Europe, Earth, Sol-System   |
|----------When the Evil Spirit armed the Tiger with claws,----------|
|----------------Brahma gave wings to the Dove-----------------------|

Newsgroups: comp.parallel
From: stgprao@xing.unocal.com (Richard Ottolini)
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Originator: stgprao@xing
Organization: Unocal Corporation
Date: Thu, 23 Jul 1992 15:40:28 GMT

In article <1992Jul23.134928.5014@hubcap.clemson.edu> lycmit@x1sun6.ccl.itri.org.tw (Yin-Chih Lin) writes:
>Greetings:
>
>We have many Sun's SPARCstations (from 1, 1+, IPC, to 2, 670MP and 
>SPARCstation 10 in the near future), and the new-version multi-thread
>OS (SunOS 5.0) will be installed on these computers.
>
>I find that the Think Machines Corp.'s latest MPP machine CM-5 is also
>adopted the SPARC processors (22 MIPS per processor) as its nodes.
>According the "Parallel Processing" Oct. 1991 issue, the price of 32-node
>CM5 model will sell at about $1.4 million.
>
>I am curious, if I connect 32 SPARCstation 10 model 30 (33MHz, SuperSPARC
>module with 86.1 MIPS - Sun Micro adverted!?) computers (loosely-coupled
>MIMD multicomputers?) either by Ethernet, ISDN or FDDI with the multi-
>thread OS and might use facilities from Linda-like distributed data
>structures. Is it possible for me to obtain the reasonable performance
>when compared with the 32-node TMC CM5 (SIMD machine)?

I doubt it.  Three important differences:
(1) Each node of CM-5 contains a 128 megaflop array processor (actually four
32 MF vector chips if you buy the full configuration.)  This an order of
magnitude faster than the fastest SPARC chip.
(2) The communication channels between the nodes scales with the number of
processors on a CM-5 in contrast to a workstation network that subdivides
traffic on a single network.  We do distributed number crunching at our
site on a workstation network.  Network saturation often occurs when the
number of nodes are in the low double digits.
(3) SOFTWARE, SOFTWARE, SOFTWARE!  to paraphrase a real estate maxim.
TM is attempting to implement their data-parallel programming languages-
TM-FORTRAN-90/HPF and others- that hide need to worry a lot about how to
distribute data and communications.  This would increase program development
speed over conventional MIMD methodologies IMHO if TM succeeds with this
compiler.  I haven't tested it yet, but hope to soon.

Newsgroups: comp.parallel
From: hardy@convex.com (Chris Hardy)
Subject: f2c on convex? and PVM
Apparently-To: hypercube@hubcap.clemson.edu
X-Disclaimer: This message was written by a user at CONVEX Computer
              Corp. The opinions expressed are those of the user and
              not necessarily those of CONVEX.
Organization: CONVEX Computer Corporation, Richardson, Tx., USA
Date: Thu, 23 Jul 1992 17:46:49 GMT

Has anyone out there got the f2c interface working on convex ?
The c interface is ok but the fortran to c causes some weird
problems.  I am only testing with the fhost and node programs
that are included in the distribution.  I think the problem lies
in string handling between c and fortran.

I do not have a lot of time to play with PVM but I am interested
if anyone has any experiences to share.

Thanks,
Chris Hardy

Newsgroups: comp.parallel
From: vu0208@bingsuns.cc.binghamton.edu (!)
Subject: need these papers
Apparently-To: uunet!comp-parallel
Organization: State University of New York at Binghamton
Date: Mon, 20 Jul 1992 21:16:37 GMT


Hi, I need the following papers which were presented in SPAA'92. Since
the proceeding is not yet available to the library I thought i might
ask the authors to send me these papers.

Title: "The Network Architecture of the Connection Machine CM-5"
Authors: C. Leiserson, Z.S. Abuhamdeh, D. Douglas, C.R. Feynmann, M.
Ganmukhi, J. Hill, W.D. Hillis, B. Kuszmaul, M. St. Pierre, D. Wells,
M. Wong, S-W Yang, R. Zak, TMC.

Title: "Design and Performance of Multipath MIN Architectures"
Authors: F. Chong, T. Knight, Jr., MIT


I will appreceiate if some one can send me a copy. 

thanks






Newsgroups: comp.parallel
From: rissel@iscp.bellcore.com (Ron Rissel)
Subject: OCCAM compiler
Apparently-To: comp-parallel@uunet.uu.net
Reply-To: user@machine.domain
Organization: UC Berkeley XRN Design Team
Distribution: usa
Date: Thu, 23 Jul 92 18:44:37 GMT

Anyone know where to obtain an OCCAM compiler and what operating system it
runs under?
What other OCCAM compilers are out in the world?

Ron

Newsgroups: comp.parallel
From: dirk@rummelplatz.uni-mannheim.de (Wenzel)
Subject: Literature: Clusters of Workstations
Apparently-To: comp-parallel@news.Germany.EU.net
Organization: Rechenzentrum Uni Mannheim (RUM)
Date: Wed, 22 Jul 92 14:34:38 GMT


I'm interested in literature about Clusters of Workstations.
Could someone give me some hints on actual papers, books on this field.

Thanks in advance,

	Dirk.


Newsgroups: comp.parallel
From: rvdg@cs.utexas.edu (Robert van de Geijn)
Subject: Broadcasting on Hypercubes
Keywords: iPSC Hypercubes Broadcast
Organization: CS Dept, University of Texas at Austin
Date: 16 Jul 1992 15:34:11 -0500

I recently developed a broadcast routine for the iPSC/860
that is considerable faster than the library call to
csend with destination -1, at least for very large vectors.

While I am still working on the report, and I am not willing
to disclose the algorithm at this time, I am willing to
make the object code available to whoever needs it in a
hurry.

A time complexity shows that the algorithm is faster that
a minimum spanning tree broadcast (which is used by csend)
by a factor   (p log p) / (2 (p-1) ) (asymptotically).

Here are some timings on the ORNL iPSC/860:
(n= # of bytes, p= # of nodes, times in seconds)

p=64
     n    new      csend-1
     =    ===      =======
     0  0.00020    0.00022
     1  0.00021    0.00022
    10  0.00022    0.00024
   100  0.00041    0.00041
   500  0.00210    0.00188
  1000  0.00263    0.00295
  5000  0.00645    0.01163
 10000  0.01021    0.02250
 50000  0.04000    0.10796
100000  0.07391    0.21513

p=32
     0  0.00017    0.00018
     1  0.00018    0.00018
    10  0.00019    0.00020
   100  0.00034    0.00034
   500  0.00163    0.00155
  1000  0.00239    0.00245
  5000  0.00622    0.00960
 10000  0.00926    0.01854
 50000  0.03779    0.08996
100000  0.07202    0.17925

The object file can be obtained via anonymous ftp
from cs.utexas.edu, directory pub/rvdg/gcast.
In this directory, there is a README file that
explains the calling sequence.

===========================
ftp cs.utexas.edu
Name: anonymous
Password: anything
cd pub/rvdg/gcast
bin
get rvdg_gcast.o
get README
===========================

you may want to look at some of the postscript files
in pub/rvdg as well.

Those who send a message to rvdg@cs.utexas.edu will
be kept up to date on further developments wrt this
and other communication algorithms.

We are working on a broadcast for the Intel Touchstone
Delta as well, based on the same principles.

PLEASE, don't send messages asking for further details.

Robert van de Geijn
Assistant Professor
The University of Texas at Austin
rvdg@cs.utexas.edu


Newsgroups: comp.parallel
From: Peter "R.Hoare" <peteh@cs.rhbnc.ac.uk>
Subject: Description of C*
Organization: Clemson University
Date: Wed, 22 Jul 92 18:26:04 +0100

Could anybody tell me where I can get a good reference to the new
version of C* which is being proposed as a ANSI standard parallel C.
It is mentioned in the Technical correspondance section of
Communications of the ACM June 92. Also has anyone managed to obtain
the response to this article by James Frankel @ Thinking machines
mentioned in the same place. I have tried emailing him but with no
success.

Thank you 


Pete Hoare


Royal Holloway and Bedford New College  |  mail: peteh@cs.rhbnc.ac.uk
Computer Science Department             |  uucp: ....!ukc!rhbnc!peteh
University of London                    |  talk: +44 784 443432 (direct)
Egham, Surrey TW20 0EX, England   

Newsgroups: comp.parallel,comp.theory
From: esa@acpub.duke.edu (EMILY ANGERER)
Subject: Re: f2c on convex? and PVM
Keywords: PVM f2c convex
Organization: Duke University; Durham, N.C.
Date: 24 Jul 92 02:25:30 GMT



I have successfully run a matrix multiplication routine in PVM using 
fortran.  The format of my program was similar to that of the sample
provided in the PVM literature.  However, on the Convex, I found that
it was unnecessary to use the null character ("\0") at the ends of
strings, and in order to define a null architecture (i.e., use any
available machine) one must use a pair of double quotes.  Therefore, the
initiate statement would be:

      call finitiate("nodeprogram", "", inst)

Hope this helps.

Emily S. Angerer


Newsgroups: comp.parallel
From: oliver@adt.uni-paderborn.de (Oliver Jack)
Subject: Literature on prarallel LP
Apparently-To: comp-parallel@uunet.uu.net
Organization: Universitaet Paderborn, Angewandte Datentechnik
Date: Tue, 21 Jul 1992 14:49:42 GMT

Could someone point me at a survey of prarallel Logic Programming,
or could someone give me some hints on actual papers, books on this field.
I'm also interested in literature about *testing* parallel Logic Programs,
regardless of the model used (AND, OR parallelism, GHC etc.).

Thanks in advance,

	Oliver Jack

Newsgroups: comp.parallel
From: zhou@ifi.unizh.ch (Hongbo Zhou)
Subject: Prof. D. B. Skillicorn, J. G. Donnett, M. Starkey
Keywords: Partitioning Algorithm 
Organization: University of Zurich, Department of Computer Science
Date: Mon, 27 Jul 92 17:02:53 GMT


Hi, there,

I would like to contact Prof. D. B. Skillicorn, J. G. Donnett, M. Starkey at 

Dept. of Comput. and Info. Sci. 
Queen's University, Kingston, Canada 

for a technical problem.

It would be greatly appreciated if some kind souls who know
them could give me their e-address.


Thanks a lot in advance.

Best, 


Newsgroups: comp.parallel
From: raina@compsci.bristol.ac.uk
Subject: Job ad posting
Organization: Clemson University
Original-Sender: raina@compsci.bristol.ac.uk
Date: Sun, 19 Jul 92 18:46:45 GMT

Dear Steve,
	In case it isn't inappropriate to post job ads to comp.parallel, can you post the following ad for us.

Thankyou.

Sanjay Raina
Dept of Computer Science 
University of Bristol, UK

=============================================================================


               UNIVERSITY OF BRISTOL

            Advanced Computing Research Centre

              PARALLEL COMPUTER ARCHITECTURE

                 2 Research Posts


Applications are invited for two research posts associated  with the ESPRIT
project OMI/HORN.  The  appointees will join  the Logic Programming Systems
and Computer Architecture Group, led by Professor David Warren, which forms
part  of  the  Advanced  Computing  Research   Centre  in  the   Faculty of
Engineering.

The OMI/HORN project is coordinated  by Inmos and  forms part of the ESPRIT
Open Microprocessor  Systems Initiative.   The  project aims to develop the
building  blocks for the  next  generation  of high performance  (parallel)
computers.  University of Bristol will  work on cache  coherency aspects of
the project, contributing  its previous work   on the  DDM (Data  Diffusion
Machine), a scalable memory  organisation supporting virtual shared memory.
The research will  involve emulating  the DDM   on the  new  architectures,
evaluating the  performance   of  large  shared-memory  applications,  and
designing a combination of hardware and  software that can best support the
concept of virtual shared memory  efficiently on a  scalable multiprocessor
with point-to-point communication.

The work will involve close collaboration with Inmos, and interactions with
other European partners  in the   OMI/HORN project.  Computing   facilities
available for this work include a 20-transputer  Meiko Computing Surface, a
12-processor Sequent Symmetry, and a network of Sun and HP workstations and
servers.  The main implementation language will be C.

Applicants  should have a  good honours degree, a  strong  interest in  the
subject of the  research, and relevant  postgraduate experience,  including
experience with  one  or more of:  computer  architecture, multiprocessors,
transputers, or C.  The posts are available  from  1 September 1992 and are
tenable  for  seventeen  months in  the first   instance  with an  expected
extension of a further twenty-one months subject to approval of funding for
the second  phase of   the  OMI/HORN project.    Appointments will  be made
according to age  and experience on  the  RA1A, RA2, or RA3  salary  scales
(12,129-19,328, 17,827-23,739, or 22,487-28,165 pounds, all under review).

Letters of application, including a CV, a statement of  research interests,
and  the names  and addresses  of    two referees,  should  be  sent to the
Personnel Office, Senate  House, Bristol BS8 1TH,  preferably  by 15 August
1992.  Informal enquiries  can be  made by  telephone (0272-303322)  or  by
electronic mail (hornjobs@uk.ac.bristol.acrc).

---------------------------------------------------------------------------
From: neal@grover.stat.washington.edu (Phil Neal)
Subject: Re: looking for PVM
Apparently-To: comp-parallel@ames.arc.nasa.gov
Originator: neal@grover.stat.washington.edu
Organization: Helping Hand Acceptance Corporation
Date: Tue, 21 Jul 1992 17:08:09 GMT

ROBIN !! YOUR MAIL BOUNCED SO HERE IS THE MESSAGE OVER THE NET

To: robin@fractal.ireq-num
Subject: Re: looking for PVM
Newsgroups: comp.parallel
Organization: Helping Hand Acceptance Corporation
Cc: 

Robin,
PVM stands for Parallel Virtual Machine and it 
is available by:

        ftp research.att.com

and is found in directory /netlib/pvm

Bonne chance,
Phil


Phil Neal, Systems Programmer, Statistics Department GN-22
University of Washington, Seattle, Wa. 98195 USA  | 206-685-1627
----------------------------------------------------------------
"I won't play second fiddle to the beat of your honky tonk
heart"


-- 
Phil Neal, Systems Programmer, Statistics Department GN-22
University of Washington, Seattle, Wa. 98195 USA  | 206-685-1627
----------------------------------------------------------------
"I won't play second fiddle to the beat of your honky tonk heart"

Newsgroups: comp.parallel
From: peter@palin.cc.monash.edu.au (Peter Hawkins)
Subject: Re: HELP - software needed to run MIMD like programs on an IBM PC
Apparently-To: comp-parallel@uunet.uu.net
Keywords: MIMD, IBM PC
Organization: Monash University, Melb., Australia.
Date: Thu, 30 Jul 1992 22:54:00 GMT

Andrew.Stratton@cm.cf.ac.uk (Andrew F Stratton) writes:

>	I have recently purchased a 486/33, and would like to run a MIMD
>simulator to allow me to develop some code for Meiko and nCUBE 2.  I am
>not worried about timings - just the ability to somehow communicate between
>different virtual processors.  This would allow me to work on algorithms at
>home.



You could use parallaxis (freeware @ ftp.informatik.uni-stuttgart.de
in /pub/parallaxis) - you will need to buy a manual for ($20???) )

Peter



Newsgroups: comp.parallel
From: alleyne@MasPar.COM (Brian D. Alleyne)
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Apparently-To: uunet!comp-parallel
Reply-To: alleyne@MasPar.COM (Brian D. Alleyne)
Organization: MasPar Computer Corporation, Sunnyvale, CA
Date: Wed, 29 Jul 1992 17:00:25 GMT

In article <1992Jul23.204237.4492@hubcap.clemson.edu> henrik@mpci.llnl.gov (Henrik Klagges) writes:
>
>grendel@fen.arc.nasa.gov (Raymond E. Suorsa) writes:
>>The price of a TMC CM5 is in its fat tree network... which is very
>>fast compared to ethernet, or FDDI.
>
>Is it a fat tree network ?

Depends what YOU call a fat tree. And what you call a node. 

Brian

Newsgroups: comp.parallel
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Subject: Re: Literature on prarallel LP
Organization: Computer Science Dept, QMW, University of London, UK.
Date: Wed, 22 Jul 1992 08:22:57 GMT

From: oliver@adt.uni-paderborn.de (Oliver Jack)
>Could someone point me at a survey of prarallel Logic Programming,
>or could someone give me some hints on actual papers, books on this field.
>I'm also interested in literature about *testing* parallel Logic Programs,
>regardless of the model used (AND, OR parallelism, GHC etc.).

E.Shapiro "The Family of Concurrent Logic Programming Languages"
in ACM Computing Surveys 21,3, Sep. 1989.

The only problem with this paper and others I could suggest is
that they tend to make parallel logic programming look a lot
more complex than it actually is since they concentrate on
pointing out the differences between the various suggested
parallel logic languages which in many cases are fairly trivial
when it comes to actually programming in them.

Matthew Huntbach


Newsgroups: comp.parallel
From: narad@nonsequitur.Eng.Sun.COM ([Doing 6 Impossible Things before breakfast])
Subject: Sun job contacts
Reply-To: narad@nonsequitur.Eng.Sun.COM
Organization: Sun Microsystems
Date: 15 Jul 1992 20:56:58 GMT

In an earlier message (which I thought I was posting directly to a sender, not to the
whole news group) I accidentally broadcast the names of some hardware managers
at Sun as job contacts.  This was inadvertent (hey, I've only been using Unix systems for
10 years!).  If you are interested in employment at Sun, *please* contact Sun's HR department
through the usual channels.  The phone number for the switchboard is 415-960-1300.

Abject apologies to the managers involved :-)

chuck/


Newsgroups: comp.parallel