HDTenEightyP/NetNews huggingface dataset:
From: adriaan@dcs.qmw.ac.uk (Adriaan Joubert)
Newsgroups: fj.mail-lists.parallel
Subject: BLAS-1 and 2 for iPSC
Date: 7 Sep 92 12:19:38 GMT
Distribution: fj

Hi,

I have written a few linear system solvers for the iPSC/2 in which
I use a lot of BLAS routines. The BLAS-1 routines are all available
in the vector library, but I haven't been able to find BLAS-2 and 3
routines optimised for the sxvx (floating point co-processor & Weitek
vector unit) nodes. Do such routines exist?

Alternatively, are there versions of BLAS routines which would run more
efficiently with Weitek vector processors than the standard Fortran
versions from Netlib? I sent these routines through Vast, but that
still does not seem to make them very fast...

Thanks,

Adriaan

--
 
 ***************************************************************************
 * Adriaan Joubert                * Janet       : adriaan@uk.ac.qmw.dcs    *
 * Computer Science Dept          * Internet    : adriaan@dcs.qmw.ac.uk    *
 * QMW University of London       * Fax         : +44-81-980 6533	   *
 * Mile End Road                  * Telephone   : +44-71-975 5555 ext.3232 *
 * London E1 4NS                  *                                        *
 * United Kingdom                 *                                        *
 ***************************************************************************
From: bernardl@cs.Stanford.EDU (Bernard Lee)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Fujitsu Unvells Ultra High Speed Supercomputer
Date: 15 Sep 92 12:59:43 GMT
Distribution: fj

|> 
|> [The position of this moderator, and most of the other moderators of technical
|>  groups, is that news releases which indicate availablility of products is
|>  acceptable news for the group. I do not allow blatant advertising---indeed,
|>  I not too gently steer it offline. Fuijitsu is a major player, so the release
|>  is news.

Other netters have sent me mail in support of my position, although
I am not speaking for anyone else.  A lot of people in comp.parallel
know which company I work for.  I have been told VERY, VERY explicitly
that I cannot conduct any type of business activities on Internet.
Obviously, a lot of companies out there are in violation of this policy.

I understand that press release can be of interest but Fujitsu's
post really sounds more like a business promotion.  As someone has 
already pointed out, there are a lot of subjective opinions if 
not unscientific conclusions in the post.  I understand that press 
releases are often written by the marketing instead of the engineering
department and that's the way they are.  However, if companies are that 
eager to announce their products, I am certain that the
moderator can tactfully ask them to tone it down a little bit.  
No one I know was seriously offened by Intel's announcement of their
first shipment of the Paragon, which was basically a factual and 
objective piece despite the usual marketing hype, 
but Fujitsu's post was just a little bit uncalled for.  

[I have already answered the poster by e-mail. The crux of the response is
 this. The moderators have spent a great deal of bandwidth on the subject
 of commercialism. It has been left to our discretion as to what constitutes
 that commercialism.

 Over the past life of the group, I have posted news releases uneditted.
 The implied condition on these posts is, as with anything done by business
 people, {\em caveat emptor}.

 ---Steve
From: wheinri@informatik.tu-muenchen.de (Werner Heinrich)
Newsgroups: fj.mail-lists.parallel
Subject: Reference Manuals for Multiflow TRACE and IBM RS/6000
Date: 9 Sep 92 12:22:45 GMT
Distribution: fj

For a project on formal specification of computer architectures targeted to 
the exploitation of instruction level parallelism, I'm desperately seeking
Architecture and/or Instruction Set Reference Manuals for the following two
machines:

- Multiflow TRACE ( this seems to be very difficult to get, since Multiflow 
                    don't exist any more; anybody has one ? )

- IBM RS/6000     ( whom to contact at IBM in Germany or elsewhere ? )

Any pointer would be greatly appreciated.

============================================================================
Werner HEINRICH                    email:  wheinri@informatik.tu-muenchen.de
Department of Computer Scienece
Technical University Munich
From: dre@ember.Eng.Sun.COM (David R. Emberson)
Newsgroups: fj.mail-lists.parallel
Subject: Re: sgi/sun shared memory machines question
Date: 14 Sep 92 12:31:16 GMT
Distribution: fj

In article <1992Sep11.121830.17069@hubcap.clemson.edu>, zilla@nj.nec.com (John Lewis) writes:
> Someone told me that the SGI multiprocessor machines cannot run
> different unix processes on different processors; they can only
> run a single (but possibly parallelized) process at a given time.
> The reason was said to be that the machines do not implement
> any mechanism for simultaneous writes.
> 
> Is this correct?  If so, how are simultaneous writes from
> different threads of a parallelized process prevented?
> 
> Is the new sun multiprocessor (4/690?) similar?

This sounds bogus to me.  All Sun MP machines (4/6xx, SS10, and futures) can
run different processes simultaneously and also run parallelized codes.  I
think your friend is confusing "simultaneous writes" with synchronization.
I believe the SGI machines do something funky to implement barriers (like
put them in a special portion of memory with hardware support) because the
R3000 has no synchronization primitives.  This is not a problem on the Suns
since Sparc has the hooks in the architecture.  R4000 fixes this omission.

			Dave Emberson
			dre@Eng.Sun.COM
From: alf@theory.TC.Cornell.EDU (Alex Cheung)
Newsgroups: fj.mail-lists.parallel
Subject: PVM on iPSC ?
Date: 14 Sep 92 12:30:10 GMT
Distribution: fj

Has anyone ported PVM to iPSC ?

--
Alex Cheung                                 alf@theory.tc.cornell.edu
From: cyliao@iastate.edu (Chun-Yao Liao)
Newsgroups: fj.mail-lists.parallel
Subject: nCUBE biginner needs advice...
Date: 11 Sep 92 12:18:08 GMT
Distribution: fj

Hi, I am an undergrad senior majored in computer engineering field. My
senior design involving using the nCUBE, thus I need to learn how to
program it.  I'd appreciate any input on a few good books concerning:
	nCUBE programming
	basic concept of parallel programming, how to improve efficiency
	     of the code etc.

Many thanks!


-- 
Chun-Yao Liao              |\   |  __ \  /-----                 -------------
cyliao@iastate.edu         | \  | /  \ \/   | A Milano      ------------
Department of EE and CprE  |  \ ||---- /\   |  Dreamer  ---------
Iowa State University      |   \| \__ /  \  |Mail OK, I have MailService.
From: gvw@epcc.edinburgh.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Re: Biblio. on supercomputing & parallel processing
Date: 9 Sep 92 15:14:07 GMT
Distribution: fj

In article <1992Sep9.122145.870@hubcap.clemson.edu>, keivan@wuphys.wustl.edu (Keivan Esfarjani) writes:
> So this is the list of the books and journals that I got
> from some of you:
> [...]
> 	- Greg Wilson's "Past, Present, Parallel: A Survey Of Parallel
> 	  Computing". Springer Pub.

I'm only the 2nd name on the cover --- Arthur "Strange But" Trew gets
honours as first editor.

Cheers,

 ========================================================================
  Gregory V. Wilson                    ||  For in much wisdom is much
  Technical Coordinator                ||  grief; and he that increaseth
  Edinburgh Parallel Computing Centre  ||  knowledge, increaseth sorrow.
  gvw@epcc.edinburgh.ac.uk             ||               - Ecclesiastes
 ========================================================================
From: dougger@ERC.MsState.Edu (Douglas Meyer)
Newsgroups: fj.mail-lists.parallel
Subject: Looking for source and docs for MIDAS
Date: 10 Sep 92 15:14:46 GMT
Distribution: fj

Hi everybody:

I'm only a few days away from posting summary of all the feedback I
got regarding systems for simulating and evaluating parallel
algorithms/programs.  I appreciate all the info.   It has really
helped us make some informed decisions over here.

In the meantime, can any of you give me direction as to where I can
get MIDAS??  Also, what about ParaGraph??  I thought ParaGraph would
be available via anonymous ftp from ornl.gov, but it is not any
anonymous ftp site (or at least it doesn't recognize "anonymous" as a
valid login).  

Thanks everyone.

--
Douglas Brent Meyer
Research Assistant
Engineering Research Center for Computational Field Simulation
Box 6176
Mississippi State, MS  39759
                                    "In short, there are three things
Office: (601)-325-2477               that last:  faith, hope and love; 
FAX:    (601)-325-7692               and the greatest of these is love."

E-Mail Address:  dougger@erc.msstate.edu
From: parallel@netcom.com (B. Mitchell Loebel)
Newsgroups: fj.mail-lists.parallel
Subject: The PARALLEL Processing Connection
Date: 11 Sep 92 12:19:55 GMT
Distribution: fj

The PARALLEL Processing Connection is an entrepreneurial 
association; we mean to assist our members in spawning very 
successful new businesses involving parallel processing.

Our meetings take place on the second Monday of each month at 7:30 
PM at Sun Microsystems at 901 East San Antonio Road in Mountain 
View, California. This is just off the southbound San Antonio exit of 101; 
northbound travelers also exit at San Antonio and take the overpass to 
the other side of 101. There is an $8 visitor fee for non-members and 
members ($40 per year) are admitted free. Our phone number is (408) 
732-9869 for a recorded message about upcoming meetings.

Since the PPC was formed in late 1989 many people have sampled it,
found it to be very valuable, and even understand what we're up
to. Nonetheless, certain questions persist. Now, in our third
year of operation, perhaps we can and should clarify some of the
issues. For example:

Q.    What is PPC's raison d'etre?
A.    The PARALLEL Processing Connection is an entrepreneurial
organization intent on facilitating the emergence of new
businesses. PPC does not become an active member of any such new
entities, ie: is not itself a profit center.

Q.    The issue of 'why' is perhaps the most perplexing. After
all, a $40 annual membership fee is essentially free and how can
anything be free in 1992? What's the payoff? For whom?
A.    That's actually the easiest question of all. Those of us who
are active members hope to be a part of new companies that get
spun off; the payoff is for all of us -- this is an easy win-win!
Since nothing else exists to facilitate hands-on entrepreneurship,
we decided to put it together ourselves. 

Q.    How can PPC assist its members?
A.    PPC is a large technically credible organization. We have
close to 100 paid members and a large group of less regular
visitors; we mail to approximately 500 engineers and scientists
(primarily in Silicon Valley). Major companies need to maintain
visibility in the community and connection with it; that makes us
an important conduit. PPC's strategy is to trade on that value by
forming alliances with important companies for the benefit of its
members. Thus, as an organization, we have been able to obtain
donated hardware, software, and training and we've put together a
small development lab for hands-on use of members at our Sunnyvale
office. Further, we've been able to negotiate discounts on
seminars and hardware/software purchases by members. Most
important, alliances such as we described give us an inside
opportunity to JOINT VENTURE SITUATIONS.

Q.    As an attendee, what should I do to enhance my
opportunities?
A.    Participate, participate, participate. Many important
industry principals and capital people are in our audience looking
for the 'movers'!

For further information contact:


-- 
B. Mitchell Loebel                                      parallel@netcom.COM
PARALLEL Processing Connection                                 408-732-9869
From: sheffler@colt.cs.cmu.edu (Thomas Sheffler)
Newsgroups: fj.mail-lists.parallel
Subject: Journal Parallel Computing: Practice and Experience (??)
Date: 4 Sep 92 17:42:18 GMT
Distribution: fj

I belive a new journal with a name approaching the above was announced
earlier this year.  Is anyone familiar with it?  Could you send me the
publisher's address?

	Thanks,
	Tom

	sheffler@ece.cmu.edu
From: lan@cs.uh.edu (Lan Zhang )
Newsgroups: fj.mail-lists.parallel
Subject: Need CM Fortran programs
Date: 15 Sep 92 12:59:20 GMT
Distribution: fj

I am trying to transform CM fortran to run on hypercube
machine.  I need CM fortran programs, either working or
non-working, to analysis their data dependency. I
prefer that the purpose of those programs is to solve 
some problem, like linear system solver, etc.

Thank you for your kind help.

--
Lan Zhang

lan@cs.uh.edu
Dept. of Computer Science
Univ. of Houston, Tx
From: av2@ukc.ac.uk (A.Varshneya)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 7 Sep 92 12:19:24 GMT
Distribution: fj

In article <1992Sep4.174143.13747@hubcap.clemson.edu> mln@sunkj.larc.nasa.gov (Michael L Nelson) writes:
>A:
>1. says "Bong"
>2. waits, say N minutes (N > ABBA) 
>3. says "Bong" again
>
>B already knows what N is, and can then determine
>What AB is (Bong2 - Bong1 - N)

B will hear Bong2 and Bong1 with a gap of N minutes between them.
ie. Bong2 = Bong1 + N. So B can not find AB.

>Michael Nelson

Atul
From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Newsgroups: fj.mail-lists.parallel
Subject: Re: parallel search
Date: 14 Sep 92 12:31:43 GMT
Distribution: fj

> From:	UPSALA::"rodrigue-joe@CS.YALE.EDU" 13-SEP-1992 04:31:21.96
> To:	magnus@solaris.astro.uu.se (Magnus Selhammar)
> CC:	
> Subj:	Re: parallel search
>
>>> I am looking for references to Parallel search algorithms on
>>> ordered/partially ordered structures.
>
>> I am also looking for search algoritms, even though my interest is in almost
>> ordered structures.  What surprises me is that it's so difficult to find
>> such methods on searching. Yes, the field is new, but it's a very general
>> problem that should interest many persons.
>
> how do you define this problem?  thanks.


I hope you don't mind that I post your reply. I am very grateful for it since 
you are the only one who replied.

In a volume of N particles, find the n spatially nearest neighbours, 
to every particle. Assume that the nn's to a particle p are ordered 
around p in the computer memory according to, say, a Gaussian law. This
implies a higher probability to find a nn close to p in the memory than far
away in the memory. 
This is a problem in N-body methods where p interact with all other particles
in a finite volume around p, where this volume depends on the distances to
these nn's.
I am doing this on a Connection Machine. With almost ordered I mean that it's
possible to order the particles in the memory according to their spatial
coordinates, but that it is not possible to do it exact.

This is a description of my special problem. I am interested to hear or read
posts from others on searching in structures.

Magnus Selhammar


From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Newsgroups: comp.parallel
Distribution: world
Followup-To: 
Organization: 
Subject: 
Keywords: 

> From:	UPSALA::"rodrigue-joe@CS.YALE.EDU" 13-SEP-1992 04:31:21.96
> To:	magnus@solaris.astro.uu.se (Magnus Selhammar)
> CC:	
> Subj:	Re: parallel search
>
>>> I am looking for references to Parallel search algorithms on
>>> ordered/partially ordered structures.
>
>> I am also looking for search algoritms, even though my interest is in almost
>> ordered structures.  What surprises me is that it's so difficult to find
>> such methods on searching. Yes, the field is new, but it's a very general
>> problem that should interest many persons.
>
> how do you define this problem?  thanks.


I hope you don't mind that I post your reply. I am very grateful for it since 
you are the only one who replied.

In a volume of N particles, find the n spatially nearest neighbours, 
to every particle. Assume that the nn's to a particle p are ordered 
around p in the computer memory according to, say, a Gaussian law. This
implies a higher probability to find a nn close to p in the memory than far
away in the memory. 
This is a problem in N-body methods where p interact with all other particles
in a finite volume around p, where this volume depends on the distances to
these nn's.
I am doing this on a Connection Machine. With almost ordered I mean that it's
possible to order the particles in the memory according to their spatial
coordinates, but that it is not possible to do it exact.

This is a description of my special problem. I am interested to hear or read
posts from others on searching in structures.

Magnus Selhammar


From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Newsgroups: comp.parallel
Distribution: world
Followup-To: 
Organization: 
Subject: 
Keywords: 

> From:	UPSALA::"rodrigue-joe@CS.YALE.EDU" 13-SEP-1992 04:31:21.96
> To:	magnus@solaris.astro.uu.se (Magnus Selhammar)
> CC:	
> Subj:	Re: parallel search
>
>>> I am looking for references to Parallel search algorithms on
>>> ordered/partially ordered structures.
>
>> I am also looking for search algoritms, even though my interest is in almost
>> ordered structures.  What surprises me is that it's so difficult to find
>> such methods on searching. Yes, the field is new, but it's a very general
>> problem that should interest many persons.
>
> how do you define this problem?  thanks.


I hope you don't mind that I post your reply. I am very grateful for it since 
you are the only one who replied.

In a volume of N particles, find the n spatially nearest neighbours, 
to every particle. Assume that the nn's to a particle p are ordered 
around p in the computer memory according to, say, a Gaussian law. This
implies a higher probability to find a nn close to p in the memory than far
away in the memory. 
This is a problem in N-body methods where p interact with all other particles
in a finite volume around p, where this volume depends on the distances to
these nn's.
I am doing this on a Connection Machine. With almost ordered I mean that it's
possible to order the particles in the memory according to their spatial
coordinates, but that it is not possible to do it exact.

This is a description of my special problem. I am interested to hear or read
posts from others on searching in structures.

Magnus Selhammar
From: tony@iti.org (Anthony Skjellum)
Newsgroups: fj.mail-lists.parallel
Subject: new paper on Zipcode
Date: 7 Sep 92 12:19:38 GMT
Distribution: fj

Our latest paper on Zipcode, "The Zipcode Message-Passing System" by
Skjellum Smith, Still, Leung and Morari, is available as uuencoded,
compressed postscript.  Zipcode is an advanced message passing system
that supports multiple classes of messages, and multiple, independent
context of message passing.  It is very helpful to anyone who contemplates
building libraries for multicomputers or distributed computing.  It is
also helpful for those who want to mix "legacy" message passing codes
that use several different vendor notations.

The report will be of interest to those who are interested in both
multicomputers and distributed computing (including heterogeneity).
The latest version of the Zipcode software, as described in this
report, will be available approximately October 1 (hopefully by
netlib).  Additional documents including a user manual, to be
included.  

If you prefer hardcopy, please send your full postal address.
- Tony Skjellum


--
 	.	.	.	.	.	.	.	.	.      .
"They also serve who only stand and wait." - J. Milton

Anthony Skjellum, LLNL, (510)422-1161; FAX: (510)423-2993; tony@helios.llnl.gov
From: anik@crhc.uiuc.edu (Sadun Anik)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 4 Sep 92 17:46:21 GMT
Distribution: fj

In article <1992Sep3.172657.10929@hubcap.clemson.edu> anik@crhc.uiuc.edu (Sadun Anik) writes:

In my reply I said:
>   OK I'll bite. It is trivial for A and B to figure out AB+BA. It is
>   also trivial for them to synchronize their watches assuming AB=BA (or
>   any preset assumtion on AB/BA). At this point their watches are
>   actually synchronized. You can not refute this with any communication
>   between A and B using this communication channel. My wild guess :) and
>   please tell me if this is wrong.

Ed's comment.
   [I don't think that your assumptions are safe. Steve]
    ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Maybe it was
not clear in the previous paragraph but what I mean is A and B can
assume a value for AB/BA and solve the problem. Because of the nature
of the problem any assumtion is equally valid and would give you a
solution. There is no safety problem here because this is just a
choice for the value of a parameter. This is the case simply because
as far as A and B are concerned their watches will be synchronized,
and they are the only people which count. They can conduct time based
experiments and their results and all their related communication
(over the slow line) will verify this. Of course they are cutoff from
external world so their experiments will be very limited.

My understanding from the comment above is that when with an asumption
like AB/BA=1/3 A and B synchronize their watches, sometime in the
future they will realise that their their assumtion is not correct.
As I said, if this is the case I would really like to know the
algorithm. I don't have formal background in this topic so I
can't prove what I said is correct. 

>   If you are using a third person "C" to check if their watches are
>   actually synchronized using delays AC,CA,BC and CB, then the system you
>   are solving is perturbed so the previous solution doesn't need to be
>   valid. But this is irrelevant because this is not the system  in the
>   problem. The solution is not also valid if you have another means of
>   communication between A and B. 

Even if you observe A and B and see that their watches are not
"actualy" synchronized (A and B don't know anything about this
observer) for A and B their watches are still synchronized. If
the original question addressed the problem of synchronization as far
as the observer is concerned, there shouldn't be any solution. This
follows trivially from the solution above.



--
Sadun Anik, U of Illinois at Urbana-Champaign
Center for Reliable and High-performance Computing
e-mail: anik@crhc.uiuc.edu
From: ghosh-bhaskar@CS.YALE.EDU (Bhaskar Ghosh)
Newsgroups: fj.mail-lists.parallel
Subject: dynamic load balancing techniques : HELP !!
Date: 7 Sep 92 12:18:25 GMT
Distribution: fj

Warning, this is a strange message !!

A week or so ago, i had posted a request on the net for dynamic load
balancing references. Since then i have been deluged with requests *FOR*
the references i get (16 messages) but only 3 kind people have written
back with any new info. It so happens that the references i have found
haven't been at all relevant to our work. 

Please note that we am less interested in the (operating
systems-like) scenario where we have tasks coming into
processors following a distribution like in queueing systems.
Rather want to find out how to quickly redistribute excess work
on some (maybe a few) processors for specific
processor-connectivities (mesh, hypercube, butterfly, ...  name
your favourite architecture).

So if anybody reading this message has any references to share,
please post it or email me. I will post a summary of all
*informative* messages i receive.

- bhaskar.

-- 
===============================================================================
Bhaskar Ghosh   	    		"Tomar pujar chholey, 
ghosh@cs.yale.edu  @yalecs.bitnet        Tomay bhulei thaki"- Robithakur
===============================================================================