HDTenEightyP/NetNews huggingface dataset:
From: robin@fractal.ireq-num (Robin Duquette )
Newsgroups: fj.mail-lists.parallel
Subject: looking for PVM
Date: 21 Jul 92 14:35:31 GMT
Distribution: fj

I know little bit about PVM (Processor Virtual Machine) and I would like to know 
exactly what is it.  Any explanation will be appreciated.

Thanks in advance,

Robin Duquette                              
Service Methodes numeriques                 
Institut de recherche d'Hydro-Quebec       
1800 montee Ste-Julie,
Varennes (Quebec) Canada J3X 1S1
E-mail: robin@ireq-num.hydro.qc.ca
From: Andrew.Stratton@cm.cf.ac.uk (Andrew F Stratton)
Newsgroups: fj.mail-lists.parallel
Subject: HELP - software needed to run MIMD like programs on an IBM PC
Date: 29 Jul 92 15:37:37 GMT
Distribution: fj


	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.

	Does anyone know how I can do this - I know that I can run PICL under
'mpsim' running under UNIX (probaly Linus if it works) - but this seems a
bit contorted when I don't want that level of 'realism'.

	Any ideas welcome - Thanks in advance,
	  Andy Stratton.
-- 
	Parallel Processing Support Officer
	University of Wales College of Cardiff

	email:stratton@uk.ac.cf.cm
From: steve@compsci.bristol.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Re: CSP to STRAND/Parlog
Date: 27 Jul 92 14:09:02 GMT
Distribution: fj

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
From: janowsky@math.rutgers.edu (Steven Janowsky)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 27 Jul 92 14:10:11 GMT
Distribution: fj

In article <1992Jul23.154028.11687@unocal.com> stgprao@xing.unocal.com (Richard Ottolini) writes:

> (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.

Current CM5 configurations DO NOT have these vector chips.  Or at least
none of the CM5's that I have access to have them yet.
Until they arrive...

> (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.

32 = low double digits.  For certain low-communication applications, the
network of SS's should be better.  For my applications, where I want to
get STATISTICS, I'd be better running 32 independent copies of the
program on each machine and then have ZERO communication.

> (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.

How much overhead do you think the compiler eats up ?  I.e. do you
really get 32 procs of power?   On the CM2/200 I am playing compiler
games in order to approach theoretical max speed.  Those more dedicated
than me make PARIS calls directly.

SJ
From: ciancarini-paolo@CS.YALE.EDU (paolo ciancarini)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Literature on prarallel LP
Date: 23 Jul 92 17:49:17 GMT
Distribution: fj

In article <1992Jul21.204058.1844@hubcap.clemson.edu> oliver@adt.uni-paderborn.de (Oliver Jack) writes:
>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
>

You might be interested in the following paper:

@article{Cia92a,
	author = {Paolo Ciancarini},
	title = {Parallel Programming with Logic Languages: a Survey},
	journal = {Computer Languages},
	volume = 17,
	number = 4,
	pages = {213-240},
	year = 1992,
	publisher = {Pergamon Press},
}

Best regards

Paolo Ciancarini
From: henrik@mpci.llnl.gov (Henrik Klagges)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Yellow Pages and PVM on a Silicon
Date: 31 Jul 92 03:22:23 GMT
Distribution: fj

I wonder if it is worth to install PVM (parallel virtual machine). It is 
supposed to have a lot of limitations (scalability over 10 machines, 
debugging, &others I can dig up if interest is there). At least this 
was the conclusion of a summer student that did a long evaluation/test
project with PVM here at LLNL.

Cheers, Henrik

massively parallel group at Lawrence Livermore
IBM Research physics group Munich
From: bri@black-coffee.ai.mit.edu (Brian Totty)
Newsgroups: fj.mail-lists.parallel
Subject: ??? Parallelizing Barnes-Hut N-Body Code ???
Date: 31 Jul 92 03:27:12 GMT
Distribution: fj


	What is the state-of-the-art in parallelizing the Barnes-Hut
	N-Body code?  This is the code that uses the center of mass
	approximations for multiple bodies in a recursive subdivision
	style.

	I coded up this algorithm several years ago, but did a naive
	tree construction which limited the gains of the parallelism.

	Could people send me some references to more recent attempts at
	parallelizing this code, especially dealing with the tree construction
	and update?

						Thanks Very Much!


						--- Bri

   /                       Brian Totty             o o
  /__  __  o     Department of Computer Science     o  
 /  / /   /          1304 W. Springfield Ave       \_/  "We have corn in
/__/ /   /               Urbana, IL 61801                Massachusetts too!"
                        totty@cs.uiuc.edu
From: esa@acpub.duke.edu (EMILY ANGERER)
Newsgroups: fj.mail-lists.parallel
Subject: Re: f2c on convex? and PVM
Date: 24 Jul 92 11:54:24 GMT
Distribution: fj

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
From: mccurley@cs.sandia.gov (Kevin S. McCurley)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Description of C*
Date: 27 Jul 92 14:09:02 GMT
Distribution: fj

In article <1992Jul23.134937.5098@hubcap.clemson.edu> peteh@cs.rhbnc.ac.uk (PeterR.Hoare) 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.

OH NOOOOOOO!

Perhaps I have not kept up with what is happening with data parallel
C, but this smells of a potential disaster.  For three years I have
been disgusted with the lack of any reasonably flexible model of
data-parallel C.  I am not an expert in computer languages, but I
write considerable amount of code for parallel machines.  For three
years I kept thinking that if I just waited until a reasonable
replacement came along for the CM-2, then maybe we would see some
reasonable data-parallel version of C come along to replace C*.
Numerous times I have thought about writing some application in C*,
only to realize that it would be severely limited by the lack of
parallel pointers.  In my opinion adopting C* as the base for
data-parallel C is ludicrous, since it is far too restrictive.  C* was
designed years ago for a machine whose processors were incapable of
doing indirect addressing, and required every processor to have an
identical memory map.  It has some nice features, but it has a long
way to go until it will be powerful and flexible enough to allow
people to parallelize existing serial code in a natural way. 

I would hope that any new standard would get us beyond this, and look
forward to what programmers will want to use in the future.  In my
opinion it is far too early to adopt such a standard, and the parallel
computing community (including TMC) would be better served by letting
data parallel C mature more before pushing for a standard.  In the
meantime there is a glaring need for more work to be done on this
subject.

I am simply a scientist who has longed for a data-parallel C language
that would allow me to express my algorithms in a straightforward and
efficient manner.  I am not a language expert, so it is possible that
I do not understand all of the issues involved.  On the other hand,
you don't have to be a racehorse breeder to recognize a horse with no
teeth and a potbelly.

Kevin McCurley
Sandia National Laboratories
From: cros@tls-cs.cert.fr (Patrice Cros)
Newsgroups: fj.mail-lists.parallel
Subject: About PCC2 (Ardent computer?)
Date: 31 Jul 92 03:26:39 GMT
Distribution: fj


	I know that exists some  C compiler  (called PCC2), which  has
been first developed by ATT, then  adapted to  take into  account some
parallelism, (maybe by Ardent Computer).

	How  to get (by ftp or other)  existing documentation (refs if
publications  have  been  done, etc...), and/or product itself for Sun
platform, if possible?

Thanks to answer by e-mail to:

Patrice Cros		E-mail: cros@tls-cs.cert.fr
CERT/DERI		Tel:	+33 61 55 70 61
	Department of Computer Science
2, av. Edouard Belin	Fax:	+33 61 55 71 72
B.P. 4025		Telex:	521596 F
31055 TOULOUSE Cedex	France
From: ggu@chpc.org (Gary G. Gu)
Newsgroups: fj.mail-lists.parallel
Subject: this->distributed.database.system
Date: 21 Jul 92 14:37:54 GMT
Distribution: fj

I need help. If you know of any research or commertial distributed database
systems (doesn't matter what platform), please kindly let me know or post
an answer on the net. 

If you are writing interesting distributed applications in POSYBL or Linda
or Presto or other parallel/distributed env.  please kindly send me some info.
From: manu@hplren2.hpl.hp.com
Newsgroups: fj.mail-lists.parallel
Subject: MASCOTS'93; Call for Tools
Date: 31 Jul 92 12:00:47 GMT
Distribution: fj

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

CALL FOR TOOLS  --  MASCOTS'93

International Workshop on Modeling, Analysis and Simulation
of Computer and Telecommunication Systems

Part of the 1993 SCS Western Multiconference on Computer Simulation

Jan. 17 - Jan. 20 1993, Hyatt Hotel, La Jolla
San Diego, California USA

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

The MASCOTS'93 workshop is expected to be a major event in the areas
of Modeling, Analysis, and Simulation of Computer and Communication
Systems. For the TOOLS FAIR that will be held during MASCOTS'93, we
are looking for interesting entries of modeling, analysis, or
simulation systems, both from academic and industrial backgrounds.

We are especially looking for TOOLS/SIMULATION SYSTEMS in the areas of
  - Multiple Processor Systems
  - Massively Parallel and Scalable Systems
  - Systolic Structures and Vector Machines
  - Real-Time Systems
  - Computer Architectures
  - VLSI Systems
  - Artificial Neural Networks
  - Fault Tolerant Systems
  - Visualization
  - Large, Distributed, Data Base Systems
  - AI Applications and Expert Systems
  - Vision and Image Processing
  - Robotics
  - Communication Systems / Telecommunication Systems
  - Intelligent Simulation Systems


TOOLS accepted for presentation will be demonstrated in a separate
session at MASCOTS'93. Also, a poster area will be available for
exhibition during the whole workshop. Thirty minute presentations of
each TOOL (including 5-10 min. for Q&A and equipment change) may be
given "live" on a computer system or prerecorded on video tape.

Equipment available:
   Sun SPARCstation 2 (8 Bit color) 
   IBM PC 386         (VGA color)
   Macintosh II       (8 Bit color)
   Video Cassette Recorder for VHS and S-VHS format (NTSC and PAL)
   Scan Converter and Beamer for large screen display


A brief DESCRIPTION of up to two pages (including figures) of each TOOL 
accepted will be included in the workshop proceedings.


Please send abstracts of proposed tools to:

Thomas Braunl
Univ. Stuttgart IPVR
Breitwiesenstr. 20-22
D-7000 Stuttgart 80
Germany
email: braunl@informatik.uni-stuttgart.de

  or

Manu Thapar
HP Research Labs
1501 Page Mill Road
Palo Alto, CA 94304
USA
email: thapar@hplabs.hp.com


SCHEDULE
September  1, 1992  Deadline for TOOLS submissions
September 21, 1992  Notification of acceptance
October   15, 1992  Deadline for camera-ready copy
From: reinhard@rice.edu (Reinhard von Hanxleden)
Newsgroups: fj.mail-lists.parallel
Subject: Request for Fortran kernels/codes solving irregular problems
Date: 21 Jul 92 14:37:43 GMT
Distribution: fj

We are looking for codes which solve IRREGULAR PROBLEMS, i.e.,
applications which typically involve INDIRECT ARRAY ACCESSES and have
non-trivial communication patterns when parallelized.  

"We" is a group from ICASE and Rice working on compiler support for
parallelizing irregular problems.  One major goal is to automatically
place calls to the PARTI primitives, developed by Saltz et al. for
efficiently communicating sets of indirectly accessed data.  We have
developed a data flow framework for aiding this process, and we would
like to evaluate its effectiveness and generality with an as diverse
set of problems as possible.  The applications we have been working
with so far include a multigrid code and molecular dynamics codes
(CHARMM, GROMOS).

Any contributions (per e-mail to reinhard@rice.edu) would be
appreciated: kernels and/or full codes, in sequential and/or
parallelized form, preferrably FORTRAN.  

Thank you very much,

Reinhard v. Hanxleden

Center for Research on Parallel Computation
Dept. of Computer Science, Rice University
P.O. Box 1892, Houston, TX 77251
(713) 527-8101x2391
reinhard@rice.edu

-- 


--Reinhard
From: ryanm@milton.u.washington.edu (Ryan Mcneilly)
Newsgroups: fj.mail-lists.parallel
Subject: What is the Difference between Parallel and Symetric?
Date: 31 Jul 92 03:26:54 GMT
Distribution: fj

I am new at understanding parallel systems so I have a couple of questions.

1) What is the most signifigand difference between Symetrical processing
system and a parallel processing system?

2) Give a simple explanation of how the memory, i/o bus and individual
processors are bound together.

3) How does the data and instruction flow differ between the two systems.

I think I have a general concept down.  Symetrical processing keeps the
processes seperated over each processor while in parallel systems all the  
processors are tightly bound to form one processor.  Please comment.

Please send all responses via email to me.  Thanks!

-- Ryan

ryanm@u.washington.edu
From: oliver@adt.uni-paderborn.de (Oliver Jack)
Newsgroups: fj.mail-lists.parallel
Subject: Literature on prarallel LP
Date: 21 Jul 92 20:40:39 GMT
Distribution: fj

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
From: F68D@UNB.CA
Newsgroups: fj.mail-lists.parallel
Subject: Which is the best hardware option for parallel processing?
Date: 28 Jul 92 12:01:30 GMT
Distribution: fj


   I need someone to help me to clarify the following basic questions
since I have not much knowledge on parallel processing.

  Background of the questions:
  The questions are from a project which requires us to use multi
transputers for parallel processing.  Also, both C and Prolog languages
will be used in this project.  Every transputer is supposed to run
a module developed using either C or Prolog.  The main program should
be able to run under a Window envirement.  My questions are about
selection of Hardware for this project.

1. May I use PC (386 or 486) to communicate with transputers so that
   the main program developed in C run under the MS windows 3.1 can
   communicate with other modules, developed in either C or Prolog,
   which are run in transputers?  If yes, what should I buy in order
   to perform the task (assuming MS windows, C, Prolog,and PC computers
   are available)?
2. The second question is same as the first one except that the
   operating system is UNIX runing in a PC machine.  Of course, the
   window should be either X-windows or Motif.

Can you suggest me some papers or books to read in terms of the above
questions?

Thanks in advance.

Heping

P.S.
returning email addresses:
   f68d@unb.ca
   thomposn@unb.ca
From: zhou@ifi.unizh.ch (Hongbo Zhou)
Newsgroups: fj.mail-lists.parallel
Subject: Prof. D. B. Skillicorn, J. G. Donnett, M. Starkey
Date: 28 Jul 92 12:01:20 GMT
Distribution: fj

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,
From: ah@dcs.ed.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Participants wanted..
Date: 21 Jul 92 14:37:51 GMT
Distribution: fj

Hello,

I am doing a research on parallel programs performance evaluation and
visualization tools. I am looking for programers preferably based in
Edinburgh that will be willing to talk to me about the tuning task or
allow me to observe them while they are trying to improve the performance
of their programs. This process will eventually end up in a user oriented
design specification for a future performance evaluation and visualization
tool. 

If you would like to participate please contact me at the following
email address:

ah@dcs.ed.ac.uk

Thanks in advance

Anna Hondroudakis
Department of Computer Science
University of Edinburgh


--

=============================================================================
                                                           Anna Hondroudakis
THE TEMPLES AND THE PALACES                                ah@dcs.ed.ac.uk
From: bradley@marley.think.com (Bradley Kuszmaul)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 27 Jul 92 14:11:12 GMT
Distribution: fj

In article <1992Jul23.204237.4492@hubcap.clemson.edu> henrik@mpci.llnl.gov (Henrik Klagges) writes:

>  Is it a fat tree network ?

Yes.  I'll take this opportunity to plug our paper describing the networks
of the Connection Machine CM-5:

Charles E. Leiserson, Zahi S. Abuhamdeh, David C. Douglas, Carl R. Feynman,
  Mahesh N. Ganmukhi, Jeffrey V. Hill, W. Daniel Hillis, Bradley C.
  Kuszmaul, Margaret A. St. Pierre, David S. Wells, Monica C. Wong,
  Shaw-Wen Yang, and Robert Zak.
The Network Architecture of the Connection Machine CM-5.
Symposium on Parallel and Distributed Algorithms '92, june 1992, San Diego.

 -Bradley
From: ravi@photonics.usc.edu (Ravi)
Newsgroups: fj.mail-lists.parallel
Subject: EXPRESS SOFTWARE
Date: 29 Jul 92 11:53:19 GMT
Distribution: fj

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
From: jns@castle.ed.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: dired mode for CM data-vault
Date: 23 Jul 92 13:50:40 GMT
Distribution: fj

Has anyone cobbled together an emacs dired mode that allows one to
manipulate files on a connection machine data vault? It would be
useful to be able to browse directories, copy/delete/rename
files.
From: stgprao@xing.unocal.com (Richard Ottolini)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 23 Jul 92 17:49:51 GMT
Distribution: fj

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.
From: rissel@iscp.bellcore.com (Ron Rissel)
Newsgroups: fj.mail-lists.parallel
Subject: OCCAM compiler
Date: 23 Jul 92 20:42:31 GMT
Distribution: fj

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
From: sivap-m@sybil.cs.buffalo.edu (Muhunthan Sivapragasam)
Newsgroups: fj.mail-lists.parallel
Subject: Request for reference info ( automatic partitioning )
Date: 29 Jul 92 11:53:28 GMT
Distribution: fj


	I would like to get some references about automatic partitioning
of programs for parallel execution. I will be thankful if someone can
give a list of references.

							--muhunthan
-- 
							S. Muhunthan