HDTenEightyP/NetNews huggingface dataset:
From: standers@femto.cs.umn.edu (Steve Anderson)
Subject: Re: Question on the CM5 CMfortran optimisation
Apparently-To: comp-parallel@uunet.uu.net
Keywords: CMfortran, CM5,MPP 
Organization: University of Minnesota, Minneapolis, CSci dept.
Date: Sun, 24 Jan 1993 19:41:13 GMT

In article <1993Jan20.124731.7725@hubcap.clemson.edu> owhadi@sirocco.rice.edu (Eric Owhadi) writes:
>
>Does anyone knows if the CMfortran optimisation is good enough to generate good data parallel code ? ie: Can one do better using a lower level programming model (and more sweat) (with the CMMD library and message passing routines).

Well, that is moot, since we have found CMF 2.0 beta2 to produce incorrect
code unless "-g" is included.  In other words, forget it until 2.1 is 
released sometime in March.  
There is currently no way to compile vectorized code for nodes.
Perhaps someday.





Newsgroups: comp.parallel
From: srikant@skorpio.usask.ca (Srikant Subramaniam)
Subject: Workload selection for evaluation of loop sched algos
Organization: University of Saskatchewan, Saskatoon, Canada
Date: 28 Jan 1993 01:09:21 GMT

Hello Netters:

I would like to know what are the various factors that have to be considered in
the selection of a workload mix to evaluate the performance of loop scheduling
algorithms. 

Shall summarise the replies if there is sufficient interest. So, watch this
space ... :-)

-- 
Srikant Subramaniam.
srikant@cs.usask.ca 

Newsgroups: comp.parallel
From: pnm@goanna.cs.rmit.oz.au (Paul Big-Ears Menon)
Subject: Re: World's most powerful computing
Organization: Comp Sci, RMIT, Melbourne, Australia
Date: 20 Jan 93 23:11:17 GMT


In article <1993Jan20.163842.1167@hubcap.clemson.edu>, solman@athena.mit.edu (Jason W Solinsky) writes:
[...]
    > That would make power inversely proportional to time used. Thus, imaginary
    > computers are MORE important than installed computers
    > 

I say, this reminds me of the relativistic rule that the faster the body
goes, the heavier it gets.  Therefore, the fastest "thing" would naturally have
no mass at all.  This supports the importance given to imaginary computers, as,
after all, they have no mass, thus can go as fast as theoretically possible.

The only computer which could go faster would be one with negative mass.  I 
suppose this would be possible in good economic times, but not when there's a 
credit squeeze on.  Then again, with imaginary computers, we could be wandering
into the complex plane - which could permit negative mass computers.  This would
be better than zero mass computers, as they could not operate at any speed
slower than c, only faster.  All those propagation time problems would be a
thing of the past (get it??).

I can't say much more, as I now have to return to my patenting of the 
improbability drive...

    Paul Menon,
    Dept of Computer Science,
    Royal Melbourne Institute of Technology, 
    124 Latrobe Street,
    Melbourne 3001, 
    Victoria, Australia.

email:	pnm@goanna.cs.rmit.oz.au
PH:	+61 3 660 3209
FAX:	+61 3 662 1617

Newsgroups: comp.parallel
From: benalia@lifl.lifl.fr (Akram Benalia)
Subject: need references about graphical environments
Organization: Laboratoire d'Informatique Fondamentale de Lille
Date: 22 Jan 1993 09:58:47 GMT

Greetings,
I'm performing a literature search for papers discussing: 
graphical environments for (parallel computing) developing, debugging, ... parallel programs.
Any references would be appreciated.
Thanks for your help.

-- 
Akram Benalia
_____________________________________________________________________
	LIFL --- Laboratoire d'Informatique Fondamentale de Lille 
	Universite de Lille 1
	Cite Scientifique --- Bat. M3
	59655 Villeneuve d'Ascq cedex
	France

 email: benalia@lifl.fr, Fax: +33-20 43 65 66, Tel: +33-20 43 47 30
_____________________________________________________________________
                                          


Newsgroups: comp.parallel
From: cnews@umr.edu (UMR Usenet News Post)
Subject: Suffix tree on a hypercube
Apparently-To: comp-parallel@cis.ohio-state.edu
Keywords: string, suffix tree, distributed memory
Reply-To: snayar@mcs213k.cs.umr.edu
Organization: University of Missouri-Rolla, Missouri's Technological University
Date: Mon, 25 Jan 1993 00:15:08 GMT


	I am working on a project and was wondering if anyone out there knows
of an algorithm for constructing a suffix tree (a trie) for a given string on 
a distributed memory machine like the ipsc/2.  I am aware of the algorithm
developed (parallel) by Apostolico et. al. (1988).  But that is for a shared
memory machine, and I do not think it is easy to convert it to work on a
distributed machine.  I am also aware of the serial algorithm developed by
McCreight (1976).
	Any help or pointers will be duly appreciated.  Reply by e-mail or
a post on the network is fine.  Thanks in advance!

--
Sanjay Nayar                |  The worth of a State, in the long run, 
University of Missouri-Rolla|  is the worth of the individuals  
snayar@cs.umr.edu           |  composing it.  --- J.S. Mill 


Newsgroups: comp.parallel
From: john@cs.wmich.edu (John Kapenga)
Subject: Re: World's most powerful computing
Summary: Me too : -)
Organization: Western Michigan Univ. Comp. Sci. Dept.
Date: Thu, 21 Jan 1993 01:31:16 GMT

My office should be on the list too! :-) Who would have guessed?

If there is a use for such a list it might be to allow those who
have no idea what's going on to find out where various non-conventional
computers are located.

Listing a site, brief information on access, uses and a list of hardware
(without the vendor hype) might help someone.



john

-- 
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
John A. Kapenga                   Department of Computer Science
Ma Bell:  (616)387-5657           Western Michigan University
Internet: john@cs.wmich.edu       Kalamazoo, MI 49008

Newsgroups: comp.parallel
From: ra@pangea.Stanford.EDU (Christoph Ramshorn)
Subject: Express at Stanford ?
Organization: Stanford Univ. Earth Sciences
Date: 21 Jan 1993 17:43:13 GMT


Has anybody at Stanford aquired a site license for Parasoft's Express? Or is
anybody interested and would be willing to share the cost ($2,000 per year
including updates and phone/fax/e-mail support)?


Christoph Ramshorn                      Applied Earth Sciences
ra@pangea.stanford.edu                  Stanford University
Ph. (415) 723-2782                      Stanford, CA 94305-2225

Newsgroups: comp.parallel
From: d@hd.org (Damon)
Subject: Re: KSR-1 Docs
Apparently-To: comp-parallel@uunet.uu.net
Keywords: Parallel computing, supercomputing
Organization: ExNet Systems Ltd Public Access News, London, UK
Date: Wed, 27 Jan 1993 21:00:36 GMT

In article <1993Jan26.160316.8498@hubcap.clemson.edu> esl_manager@Gimme.CC.UH.EDU () writes:
>Hi,
>
>I am trying to obtain information on the KSR-1 developed by the people
>at Kendall Square Research Lab(KSR). Does anyone know of any paper(s)
>written about it? Or, is there an ftp site repository of their paper(s).
>Of course, I will also be interested if someone can give me KSR's e-mail
>address. 

We devoted many pages to the KSR1 a few months ago and do small pieces
from time to time.  Please call our office and get Peter or Jan to send
you the two KSR issues.  (Tel +44 71 387 4296.)  Call me if there are
any problems.

Damon
-- 
Damon Hart-Davis        d@hd.org   London UK   Tel/Fax: +44 81 755 0077  [1.37]

Two separate jobs, two employers: (1) Editor of Parallelogram, (2) Consultant
and seller of uucp news/mail feeds (UK#5 pcm, FIRST MONTH FREE) and cheap Suns.

Newsgroups: comp.parallel
From: fca@geant.cern.ch (Federico Carminati)
Subject: Job opening at CERN
Apparently-To: comp-parallel
Organization: European Laboratory for Particle Physics, CERN, Geneva, Switzerland
Date: Thu, 28 Jan 1993 17:19:46 GMT

CERN,  the European  Laboratory  for Particle  Physics  based in  Geneva,
Switzerland, has  several positions  open in  the Computing  and Networks
Division  for  scientific  programmers  to  work  on  the  migration  and
development of High Energy Physics  applications in a parallel processing
environment.
 
 
For further information see the posting in misc.jobs.offered or contact
 
     Federico Carminati - fca@cernvm.cern.ch

Newsgroups: comp.parallel
From: ryer@inmet.camb.inmet.com (Mike Ryer)
Subject: Re: whereabouts of tools
Keywords: faust pat ptool parascope
Organization: Intermetrics Inc, Cambridge MA
Date: Thu, 21 Jan 1993 16:51:18 GMT

We attempted to obtain Faust, and were unsuccessfull.  Champaign-Urbana said
that the project was over.  They did give us some "as is" software, but
without any documentation to speak of.  We tried to build the system, and
found that some essential pieces were missing from the distribution.  C-U
said, sorry, that's all they have.

If you have any better luck, please post.

-- Mike Ryer
Intermetrics



Newsgroups: comp.parallel
From: harrison@adm.csc.ncsu.edu (Lou Harrison)
Subject: source of Hypercube boards
Organization: Adm.csc.ncsu.edu (Administration machine NCSU Dept. Computer Science)
Date: 27 Jan 93 11:42:13 GMT


Hi, 
	We have a 16node Hypercube with 386 nodes.  One of our nodes has
stopped working, and Intel wants $3900 to fix it (if it can be fixed).
Is there any other place to get these repaired or buy working, used
nodes?
	Thanx in advance,
	Lou Harrison
	harrison@csc.ncsu.edu

Newsgroups: comp.parallel
From: jrexford@adirondacks.eecs.umich.edu (Jennifer Lynn Rexford)
Subject: Non-uniform traffic in message-passing systems
Apparently-To: comp-parallel@archive.cis.ohio-state.edu
Organization: University of Michigan EECS Dept., Ann Arbor, MI
Date: Wed, 27 Jan 1993 15:55:56 GMT

   Does anyone know of any papers that characterize realistic
communication patterns in message-passing systems? In particular,
how often are various communication constructs (such as many-to-one,
one-to-many, and others) used over a wide range of applications?

   I am looking at non-uniform traffic patterns on point-to-point,
message-passing networks (such as k-ary n-cubes).  The shared-memory
community has models of non-uniform traffic in terms of a ``hot-spot''
memory, that can cause congestion trees in multistage interconnection
networks.  It seems that a ``hot'' node (or set of nodes) in a message
passing environment (or a distributed shared memory environment) would
be analogous.

   Any thoughts/references?

   I do have one reference ("Hot-Spot Contention in Binary Hypercube
Networks," by Dandamudi and Eager, IEEE TOC, Feb. 1992, pp. 239-244).

   Thanks.

-- Jennifer
   jrexford@eecs.umich.edu



Newsgroups: comp.parallel
From: standers@tera.cs.umn.edu (Steve Anderson)
Subject: Re: Question on the CM5 CMfortran optimisation
Apparently-To: comp-parallel@uunet.uu.net
Summary: CMF compiler optimization may be wrong
Keywords: CMfortran, CM5,MPP 
Organization: University of Minnesota, Minneapolis, CSci dept.
Date: Mon, 25 Jan 1993 21:40:48 GMT

I should amplify on my previous note.  While it is true that some CMF
codes fail without "-g", lots of codes run fine.  It is unfortunate
that one such code should be mine :) Such problems are to be expected
in a beta release of anything, even e-mail.  Actually, the compiler
is in a useful state right now, and the eagerly awaited 2.1 release
promises to increase performance in several more important ways than
by the instruction block size (The primary effect of -g at this
release.)

Also, to respond to the original question better: CMF "on  a node" will be
in the next release of CMMD.  Until then, there is no vectorizing non-data
parallel compiler.  

Steve Anderson




Newsgroups: comp.parallel
From: lka@lems17lems.brown.edu (Lalit K. Agarwal)
Subject: Control To Dependence
Apparently-To: comp-parallel@uunet.uu.net
Organization: Laboratory for Engineering Man/Machine Systems
Date: Sat, 23 Jan 1993 00:36:17 GMT

Has anyone played with converting CONTROL-DEPENDENCE to DATA-DEPENDENCE in
High-Level-Synthesis or come across any algorithm for doing it in the literature.?
All suggestions are highly welcome.

thanks,

Lalit K. Agarwal (lka@lems.brown.edu)
Dept. of Computer Engg.
Brown University,
Providence, RI-02912




Newsgroups: comp.parallel
From: Stefan Staas <sts@informatik.uni-kiel.dbp.de>
Subject:  Re: p4 req for info
To: comp-parallel@uunet.UU.NET
Organization: Clemson University
Date:  Thu, 21 Jan 1993 15:20:05 +0100

silly@eel.micro.umn.edu (Vijay) writes:

>Hi,

>	Is there an ftp site or FAQ or newsletter where I can get
>some ( r all) documentation on the system p4 ? Thanks

>-vijay
>[bandi@cs.umn.edu or silly@eel.micro.umn.edu]

I took the following from a recent summary about parallel programming
models for scientific computing.

... (stuff deleted)
-
-You can obtain the complete distribution of p4 by anonymous ftp from
-info.mcs.anl.gov.  Take the file p4t1.2.tar.Z from the directory pub/p4.  The
-distribution contains all source code, installation instructions, a User's
-Guide in both ascii text and latexinfo format, and a collection of examples in
-both C and Fortran.
-
-** info.mcs.anl.gov (anagram.mcs.anl.gov) = 140.221.10.1
-
-To ask questions about p4, report bugs, contribute examples, etc., send mail
-to p4@mcs.anl.gov.
-
-                                                   Rusty Lusk
-                                                   lusk@mcs.anl.gov
-

Regards,
Stefan

--
Stefan Staas
Christian-Albrechts-Universitaet Kiel, Institut fuer Informatik
Preusserstr. 1 - 9                   , 2300 Kiel 1
Telefon: +49-431-5604-67             , Telefax: +49-431-566143
EMail: sts@informatik.uni-kiel.dbp.de

Newsgroups: comp.parallel,fnet.seminaires
From: adwait@cs.tamu.edu (Adwait B Sathye)
Subject: Estimate of parallel machines installed worldwide
Organization: Computer Science Department, Texas A&M University
Date: 22 Jan 1993 23:16:09 GMT


	Is there any publication where I can get an estimate, better still the 
actual number, of parallel/vector machines installed worldwide. I am looking
for information which will have the machines catagorized, if not by the 
manufacturing company, but at least by type of architecture (MIMD, SIMD etc.
hypercube, etc. would be even better). 

	Email repsonses preferred. Will summarize if there is enough response
or if I get a lot of "me too" messages. Please mail your responses to 
adwait@cs.tamu.edu

	Thank you.

Adwait Sathye

Newsgroups: comp.parallel
From: tdbear@dvorak.amd.com (Thomas D. Barrett)
Subject: SMP: Read any good books lately?
Organization: Advanced Micro Devices, Inc.; Austin, Texas
Date: Sun, 24 Jan 93 19:32:35 GMT

Hi folks... I'm trying to update my SMP (Symmetric Multi-Processing)
reading list and I was wondering if anyone knows of any good books,
magazine/journal articles, or even seminars?

Please email and I will summarize.

-- 
|Tom Barrett (TDBear), Sr. Engineer|tom.barrett@amd.com|v:512-462-6856 |
|AMD PCD MS-520 | 5900 E. Ben White|Austin, TX  78741  |f:512-462-5155 |
|"No is yes, And we're all free" ---Tracy Chapman, "Why?"              |
|My views are my own and may not be the same as the company of origin  |

Newsgroups: comp.parallel
From: esl_manager@Gimme.CC.UH.EDU ()
Subject: KSR-1 Docs
Keywords: Parallel computing, supercomputing
Reply-To: esl_manager@Gimme.CC.UH.EDU ()
Organization: University of Houston
Date: 25 Jan 1993 19:05:05 GMT

Hi,

I am trying to obtain information on the KSR-1 developed by the people
at Kendall Square Research Lab(KSR). Does anyone know of any paper(s)
written about it? Or, is there an ftp site repository of their paper(s).
Of course, I will also be interested if someone can give me KSR's e-mail
address. 

--
Arthur K. S. Yeo
E-mail		: ESL_Manager@UH.Edu 	(Work)
		  akyeo@cs.uh.edu		(Research) 
		  AksYeo@UH.Edu		(Others)
U.S. Mail	: Attn: ESL Manager (Arthur Yeo)
		  Campus-wide Software Library Grant (CSLG)
		  University of Houston - University Park 
		  Houston, TX. 77204-1961 

Newsgroups: comp.parallel
From: W.Purvis@daresbury.ac.uk (Bill Purvis, ext 3357)
Subject: Re: Can a Hypercube programmer lend me a hand?
Apparently-To: comp-parallel@uk.ac.uknet
Reply-To: wh@gserv1.dl.ac.uk
Organization: Daresbury Laboratory, UK
Date: Tue, 26 Jan 1993 12:49:38 GMT

> Can someone help me understand just who gets the message in the
> following examples:
>
>	nodedim is 2, destination argument is -2, I am processor 2
>
>	nodedim is 3, destination argument is -2, I am processor 2
>
>	nodedim is 5, destination argument is -3, I am processor 2

On reading this I realised that I had never figured it out myself. I did a few
quick tests and here are the results:

nodedim=2, dest=-2, 	message goes to node 3 only
nodedim=3, dest=-2,	message goes to 0,1,3	4-7 don't see anything
nodedim=5, dest=-2,	message goes to 0,1,3..15, 16-31 don't see anything
nodedim=5, dest=-3,	message goes to 0,1,3..7   8..31 don't see anything
nodedim=5, dest=-4,	message goes to 0,1,3	   4..31 don't see anything.

I can't think of a better way of wording the description given in the manual
but I agree it needs improving. However, a few examples do give you the general
idea!
	Bill.
(Bill Purvis, Daresbury Lab, Warrington Cheshire, England)





Newsgroups: comp.parallel
From: knut@uni-paderborn.de (Knut Menzel)
Subject: Re: PVM and transputers
Reply-To: knut@uni-paderborn.de
Organization: University of Paderborn
Date: 26 Jan 1993 14:13:08 GMT

In article <1993Jan20.093013.11400@vax.oxford.ac.uk>, nagrwb@vax.oxford.ac.uk writes:
|> Out of interest, anybody know if PVM has been implemented with
|> transputers as the target hardware?
|> Richard.

I am not quite sure, but I think Parsytec Corp., Aachen, Germany, plans
to implement PVM on transputers...

-- Knut
--------------------------------------------------------------------------
 Knut Menzel                          University of Paderborn
 email:   knut@uni-paderborn.de       Department of Computer Science FB17
          ...!uunet!unido!pbinfo!knut Warburger Str. 100
 Tel:     +49 5251 603325             D-4790 Paderborn
 Telefax: +49 5251 603853
--------------------------------------------------------------------------



Newsgroups: comp.parallel
From: cnews@umr.edu (UMR Usenet News Post)
Subject: References Needed--massive data store
Apparently-To: comp-parallel@cis.ohio-state.edu
Organization: University of Missouri - Rolla, Rolla, MO
Date: Tue, 26 Jan 1993 22:42:16 GMT

I am in need of papers and/or books that deal with parallel hardware and
software techniques to store and retrieve massive volumes of data.
I only need references, no code or implementation, as I am working on a
state-of-the-art paper on the subject.

Any help at all would be greatly appreciated by yours truly. 

Dave
dmyers@cs.umr.edu


Newsgroups: comp.parallel
From: jet@nas.nasa.gov (J. Eric Townsend)
Subject: Announcement of cm5-managers list
Apparently-To: comp-parallel@ames.arc.nasa.gov
Organization: Numerical Aerodynamic Simulation, NASA Ames
Date: 23 Jan 93 10:56:41



Ok, I've decided to start one. 

To subscribe, send an email message to listserv@boxer.nas.nasa.gov
with a body of:

subscribe cm5-managers your_full_name

You will received information regarding how to use the list.

--
J. Eric Townsend --  jet@nas.nasa.gov -- 415.604.4311 (DoD# 0378)
"It is the cunning of form to veil itself continually in the evidence
of content.  It is the cunning of the code to veil itself and to produce
itself in the obviousness of value." -- Baudrillard

Newsgroups: comp.parallel
From: kgatlin@zeus.calpoly.edu (Kang Su Gatlin)
Subject: Parallel Architectures, Compilers, & Systems
Organization: California Polytechnic State University, San Luis Obispo
Date: Tue, 26 Jan 1993 01:05:18 GMT

How to Get Information from Parlib;

The parlib login on hubcap.clemson.edu is a mail server using the netlib
software. To get the instructions, send the following mail message:

        shell> mail parlib@hubcap.clemson.edu
               Subject:
               send index from readings
	       send reqreading from readings
               .
        shell> ....

Hello.  My name is Kang Su Gatlin and I am a student at Cal Poly SLO 
studying Computer Science.  At our school we don't have any parallel 
programming classes or anything and I would like to do my senior project
dealing with issues of parallel systems (I'd also like to go on to 
pursue my Ph.D. work in this field).  

I'm essentially a beginner at this topic and I would like to know where
to do research on this.  What ftp sites should I check out, any
publications?  

Thanks in advance.  Any help is appreciated, and if I make any breakthroughs
in the parallel field you will get due credit ( no guarantees though cause
I've never done research before).

Well thanks again,

Kang Su Gatlin

Newsgroups: comp.parallel
From: paco@cs.rice.edu (Paul Havlak)
Subject: Re: whereabouts of tools
Apparently-To: comp-parallel@ncar.ucar.edu
Reply-To: Paul Havlak <paco@cs.rice.edu>
Organization: Center for Research on Parallel Computation
Date: Thu, 21 Jan 1993 17:47:59 GMT

In article <1993Jan21.120605.23680@cm.cf.ac.uk> Simon.N.Smith@cm.cf.ac.uk (Simon N Smith) writes:
>I'm looking for the following software tools, preferably on an ftp site:
...
>- ptool     

	Not available.

>- parascope [3]

	Available (with source, if desired), but not via FTP.

PTOOL is a dependence analyzer/browser pair developed at Rice
University.  The PTOOL browser is no longer available, but mail access
to the dependence analyzer (based on the PFC vectorizer/parallelizer
for Fortran) is provided as part of the ParaScope distribution.

ParaScope is a programming environment for Fortran developed at Rice
University (this group is also part of the Center for Research on
Parallel Computation).  The ParaScope Editor (PED) provides 
browsing (locally or from an ASCII graph file) and automated
transformations.  ParaScope runs on Sun SparcStations (and sometimes
on other machines).  For information on obtaining a ParaScope
distribution, send mail to softlib@cs.rice.edu (works like netlib),
beginning with the line

send catalog

and another with the line

send license

This catalog entry describes the currently distributed version; a new
one is expected this spring.

  Name:  Parascope
  Developed by:  Keith Cooper, Bob Hood, Ken Kennedy, John Mellor-Crummey,
                 Linda Torczon, Scott Warren
  Version:  January 1991
  Catalogue #: IU90001
  Description:  The Parascope project is an integrated collection of tools
                to help scientific programmers develop correct and efficient
                parallel programs.
  Environment:  Sun 3's or Sparcstations running Sun OS 4.0 or
                greater.
  *NOTE*  A copy of your AT&T Unix license (AT&T source license for
          the source version of Parascope, AT&T binary license for the
          binary version of Parascope) must accompany your license
          agreement.  On the order form portion of the license
          agreement, please specify which workstation version that
          you require.  The current cost of the software is $150.00.

Regards,
Paul
--
Paul Havlak			Dept. of Computer Science
Graduate Student		Rice University, Houston TX 77251-1892
PFC/ParaScope projects		(713) 527-8101 x2738 	paco@cs.rice.edu

Newsgroups: comp.parallel,uva.cs.mentat