HDTenEightyP/NetNews huggingface dataset:
From: forge@netcom.com (FORGE Customer Support)
Subject: APR FORGE90 Mailing List
Apparently-To: comp-parallel@ames.arc.nasa.gov
Followup-To: comp.parallel
Organization: Applied Parallel Research, Inc. 
Date: Mon, 11 Jan 1993 22:53:09 GMT

To join our emailing list to receive announcements regarding APR's
FORGE 90 and HPF77 Fortran browsers and parallelizers, send us email
with your name,address,company or affiliation, and, most important,
accurate email address.  Information regarding new products is
forthcoming.

send it to forge@netcom.com
-- 
 ///  Applied  ///     FORGE 90 Customer Support Group
  ///  Parallel ///     550 Main St., Placerville, CA 95667
   ///  Research, Inc.   (916) 621-1600  621-0593fax     forge@netcom.com

Newsgroups: comp.parallel
From: vwulpen@cs.kuleuven.ac.be (Henk Van Wulpen)
Subject: 3rd part of load-balancing references
Apparently-To: comp-parallel@belgium.eu.net
Organization: Dept. Computerwetenschappen
Date: Tue, 5 Jan 1993 15:26:08 GMT

[The complete listing should be available from parlib. Try
   shell> mail parlib@hubcap.clemson.edu
          Subject:
          send load-balance from bibliographies
          .
   shell>

Hello,

	a week or two ago, someone posted a rather big list of
references on load-balancing. For some reason, I never got to
see the 3rd of the 3 parts. I would be very glad if someone
could send it to me or repost it.

Thanks,

Henk.
	
 
-----------------------------------------------------------------------------
Henk Van Wulpen                           |    Going on means going far,
Eng. & C.S. senior, K.U.Leuven, Belgium   |    Going far means returning.
vwulpen@cs.kuleuven.ac.be                 |             (Tao Te Ching)
-----------------------------------------------------------------------------

Newsgroups: comp.parallel
From: Stephen Vavasis <vavasis@cs.cornell.EDU>
Subject: definition of parallel efficiency
Apparently-To: comp-parallel@eddie.mit.edu
Organization: Cornell Univ. CS Dept, Ithaca NY 14853
Date: Sat, 9 Jan 1993 19:03:54 GMT


I have seen two definitions of "parallel efficiency" in the literature,
and I am wondering whether one definition or the other has prevailed.
They are:

(1) par eff = (seq. time of the par. algorithm) / (p * parallel time)

(2) par eff = (seq. time of the best possible sequential algorithm
               for the problem) / (p * parallel time)

If you had a parallel cyclic reduction algorithm, would you rate it
against a sequential cyclic reduction algorithm or against tridiagonal
Cholesky factorization?

How about when the underlying problem is more complicated, for example
solving a boundary value problem?  In this case it's not clear how to
identify the best possible sequential algorithm.

I would like to get this definition straight because I am teaching a
class on parallelism.

Thanks,
Steve Vavasis
vavasis@cs.cornell.edu

Newsgroups: comp.parallel
From: rg@tu-graz.ac.at (Robert Greimel)
Subject: Re: putstring() in PVM
Apparently-To: comp-parallel@uunet.uu.net
Organization: Technical University of Graz, Austria
X-Newsreader: TIN [version 1.1 PL6]
Date: Tue, 12 Jan 93 18:12:58 GMT

Till Bubeck (bubeck@peanuts.informatik.uni-tuebingen.de) wrote:
: In article <1993Jan8.162353.12739@draper.com>, hct4708@ccfds2.draper.com (Hung-Chou Tai) writes:
: |> I'm just starting to program using PVM.  I would like to pass a
: |> string from the host machine to a slave using putstring().
: |> 
: |> However, I do not know what to put for the second argument of
: |> putstring.  Is it the length of the string, or is it the number of
: |> strings I want to pass?
: 
: Which second argument? I included the prototype for putstring():
: 
:      int putstring(cp)
:           char *cp;

Might he be using the FORTRAN interface to PVM. In this case, the
prototype is

       CALL FPUTSTRING(CP,INFO)

       CHARACTER*(*) CP
       INTEGER       INFO
       
where INFO holds the error code when returning from the subroutine.
There also exists a second subroutine in the FORTRAN interface for 
passing strings

       CALL FPUTSTRINGL(CP,LEN,INFO)

       CHARACTER*(*) CP
       INTEGER       INFO,LEN


Robert Greimel

------------------------------------------------------------------------
Robert Greimel                   Tel.  : +43 316 987-746
Dep. TSS                         Fax   : +43 316 987-777
AVL List Gmbh.                   e-mail: rg@fmechsg01.tu-graz.ac.at
Kleiststrasse 48
A-8020 Graz
AUSTRIA                          C= AMIGA is best, forget the rest
------------------------------------------------------------------------

Newsgroups: comp.parallel
From: lustig@eplrx7.es.duPont.com (Steve Lustig)
Subject: parallel linear programming algorithms
Apparently-To: <comp-parallel@uunet.uu.net>
Keywords: parallel linear programming
Organization: DuPont Central Research & Development
Date: Fri, 8 Jan 1993 22:05:26 GMT


There is a strong interest here at Du Pont to solve optimization 
problems using linear programming algorithms and mixed integer
linear programming algorithms. Are there folks out there who
have parallelized these algorithms? Information identifying 
this application on any type of parallel processor would be of 
great interest. If there is sufficient response, I would be happy 
to post a summary of replies.

Please send your email reply to me via LUSTIGSR@ESVAX.DNET.DUPONT.COM

--------------------------------------------------
Steve Lustig
Central Research
Du Pont Company
Experimental Station, Route 141
Wilmington, DE 19880-0356
(302) 695 - 3899

Newsgroups: comp.parallel
From: mccurley@cs.sandia.gov (Kevin McCurley)
Subject: Re: List of world's most powerful computing sites
Apparently-To: comp-parallel@ucbvax.berkeley.edu
Organization: Sandia National Laboratories, Albuquerque, NM
Date: Tue, 12 Jan 93 04:15:50 GMT

This list is so full of errors as to render it completely useless
(personally I don't see the use even if it was accurate).  I looked
first at the national labs (about which I know something), and the
entries for LLNL, ORNL, SNL, and LANL all have errors.  Rather than
try to correct the entries (I could not supply a completely accurate
inventory for my own lab, much less somewhere else), I think it would
be better to caution readers of this news group that the information
is unreliable, and probably impossible to maintain accurately.

Kevin McCurley
Sandia National Laboratories

Newsgroups: comp.parallel
From: thia@sce.carleton.ca (Yong Thia)
Subject: TMS320C40
Apparently-To: comp-parallel@math.waterloo.edu
Organization: Carleton University
Date: Tue, 12 Jan 1993 15:46:42 GMT

Hi! I recently read a brouchure that talks about a parallel C40
configuration that is attached to the SUN Sbus. Is was wondering
how is the interface configured? I understand that for transputers,
it is via one of the links in the root transputer. For the C40,
is it via one of the comm ports or via one of its 2 external buses?
Any pointers will be greatly appreciated.

Regards

Jimmy


Newsgroups: comp.parallel,comp.theory,comp.ai,comp.edu
From: dfk@wildcat.dartmouth.edu (David Kotz)
Subject: Dartmouth Computer Science Faculty Position
Followup-To: Donald.Johnson@dartmouth.edu
Summary: posted to misc.jobs.offered
Originator: dfk@wildcat.dartmouth.edu
Keywords: computer science, dartmouth, faculty, PhD, position, job
Organization: Dartmouth College, Hanover, NH
Date: Tue, 12 Jan 1993 19:19:09 GMT

I have posted an announcement of a computer science faculty position
to misc.jobs.offered. Please write to Donald.Johnson@dartmouth.edu if
you need further information.

David Kotz
-- 
-----------------
Mathematics and Computer Science
Dartmouth College, 6188 Bradley Hall, Hanover NH 03755-3551
email: David.Kotz@Dartmouth.edu    or   dfk@cs.dartmouth.edu

Newsgroups: comp.parallel
From: dbg@SLAC.STANFORD.EDU (David B. Gustavson)
Subject: Re: memory/communication models
Apparently-To: <comp-parallel@uunet.uu.net>
Followup-To: comp.parallel,comp.arch,comp.sys.sequent
Organization: SLAC Computation Research Group
Date: Sat, 9 Jan 1993 02:43:40 GMT

In article <1993Jan7.141758.8462@hubcap.clemson.edu>, lee@aero.org (Craig
A. Lee) wrote:
> 
> I'm starting a project where I need publicly available
> models/simulators of shared-memory subsystems and
> distributed-memory communication systems.
> 
> Any pointers appreciated.
> 
Since Scalable Coherent Interface systems fit this description, some of the
simulation and modeling that people have done for SCI may be useful and
available. As a start, you might contact gjessing@ifi.uio.no,
hans@sunshine.cern.ch and goodman@cs.wisc.edu -- perhaps they can vector
you on to other relevant projects that might have models etc. Gjessing and
Goodman may be unresponsive next week, due to attending the SCI meetings at
LSI Logic in California.

--------------------------------------------------------------
-- David B. Gustavson, Computation Research Group, SLAC, POB 4349 MS 88,
    Stanford, CA 94309   tel (415)961-3539  fax (415)961-3530
-- What the world needs next is a Scalable Coherent Interface!
-- Any opinions expressed are mine and not necessarily those
   of the Stanford Linear Accelerator Center, the University, or the DOE.

Newsgroups: comp.parallel
From: kitchel@manta.dpsi.com (Sidney W. Kitchel)
Subject: Re: definition of parallel efficiency
Organization: Data Parallel Systems, Inc
Date: Mon, 11 Jan 1993 15:28:55 GMT

Stephen Vavasis <vavasis@cs.cornell.EDU> writes:


>I have seen two definitions of "parallel efficiency" in the literature,
>and I am wondering whether one definition or the other has prevailed.
>They are:

>(1) par eff = (seq. time of the par. algorithm) / (p * parallel time)

>(2) par eff = (seq. time of the best possible sequential algorithm
>               for the problem) / (p * parallel time)

>If you had a parallel cyclic reduction algorithm, would you rate it
>against a sequential cyclic reduction algorithm or against tridiagonal
>Cholesky factorization?

>How about when the underlying problem is more complicated, for example
>solving a boundary value problem?  In this case it's not clear how to
>identify the best possible sequential algorithm.

>I would like to get this definition straight because I am teaching a
>class on parallelism.

	Since Frontiers '92, it also depends on whether you did the
programming or God did.
							--Sid


--
Sidney W. Kitchel  	    kitchel@cs.indiana.edu, kitchel@dpsi.com
Data Parallel Systems, Inc.  ============||  DPSI  ||===============
4617 E. Morningside Drive	                      (812) 334-8100
Bloomington, Indiana,  47408  USA		FAX:  (812) 334-8121

Newsgroups: comp.parallel
From: owhadi@gale.rice.edu (Eric Owhadi)
Subject: need some info on Cray and TMC machines 
Apparently-To: comp-parallel@ncar.ucar.edu
Keywords: Cray CM5
Organization: Rice University
Date: Thu, 7 Jan 1993 20:46:13 GMT

I am a new researcher in the field of parallel computation so I apologize for my
basic questions.

I was sent by elf aquitaine to write a report on 3D Migration (a seismic problem
that needs tera flops machines) and I am trying now to find out what is today's 
state of the art.

So does anyone knows:

What is the most powerful Cray's Machine ? is it the Y-MP 16 processors?
What is the power (in flops and mips) of each processor.
What is the price of this machine?

What is the most Powerful TMC's Machine ? CM5 with how many processors?
What is the power (in flops and mips) of each processor (the vectoriel one).
What is the price of this machine?

I will be interested in any benchmark involving these super computers.

Thanks, and Happy new year.


-----------------------------------------
Eric Owhadi
Computer Science and Geophysics researcher
Rice University
PO Box 1892
Houston, Texas 77251-1892
Email: owhadi@geophysics.rice.edu
 

Newsgroups: comp.parallel
From: wellsj@orph14.phy.ornl.gov (Jack C. Wells)
Subject: Parallel Poisson Solver
Followup-To: comp.parallel
Organization: Oak Ridge National Lab
Date: Thu, 7 Jan 1993 16:26:29 GMT

Hello,

I'm interested in hearing about efficient
algorithms to solve the Poisson equation
on hypercube and 2d-grid multicomputers.
Most algorithms I'm familiar with for the
Poisson equation are iterative in nature,
and thus require alot of communication overhead
each time step.

Thanks in advance for the help,  Jack Wells


Oak Ridge National Lab
wellsj@orph14.phy.ornl.gov
Voice: (615) 576-5229
    __o              
 _`\<,_           
(_)/   (_)       
* * * * * * * * * * * * * * * * * *

Newsgroups: comp.parallel
From: Steven Ericsson Zenith <zenith@kai.com>
Subject: Re: Linda/PARFORM
Organization: 	Kuck and Associates, Inc.
Date: Thu, 31 Dec 92 18:37:43 -0600


Just a brief addendum to my earlier mail. Nick (Carriero) reminded me
that the Yale/SCA Linda compiler does still generate C, so can indeed
use any C compiler.  Thanks for the reminder Nick, you're right - it has
been *that* long.

Steven
--
Steven Ericsson Zenith
Disclaimer: Opinions expressed are my own and not necessarily those of KAI.



Newsgroups: comp.parallel
From: alsalqan@bert.uic.edu
Subject: CFP: Lesson Learned and Observed in Software Development
Apparently-To: comp-parallel@ux1.cso.uiuc.edu
Reply-To: ckchang@bert.eecs.uic.edu
Organization: TheNews 
Date: Tue, 12 Jan 1993 00:23:22 GMT

 >>>>>>>>>>>>>>  IEEE Software  <<<<<<<<<<<<<<<<<<<<<<<<<<<<<

CALL FOR ARTICLES ON LESSONS LEARNED AND OBSERVED IN SOFTWARE
DEVELOPMENT

"Admitting mistakes is a sign of great strength and wisdom."

IEEE Software seeks articles for a special issue that will highlight
the lessons learned and observed in the development of large software
systems in the last 10 years. This unique issue will appear in
September 1993.

A programmer passed over for promotion complains: "But I have 15 years
experience and you promoted someone with only 10 years experience."
The manager answers, "No, you havefive years experience -- repeated
three times."

Is the software profession like this programmer? A prerequisite to
learning is the ability to admit mistakes. We mustshare with each
other not only our successes but also our failures. In doing so, we
will help the software-engineering profession mature.
Fred Brooks' Mythical Man-Month, the classic lessons learned/observed
publication, is the model for this special issue. Many of the lessons
related by Brooks are derived from what we call failures. Yet it is
through this kind of honest admission that others learn to avoid the
same mistakes.
The purpose of this special issue is to aid technology transfer. We do
not seek untested ideas or tools. Wewill focus on the practical
experiences observed or learned on real projects. Positive and
negative reports are welcome. Case studies and experience reports are
particularly welcome.

Since the term "software engineering" was coined in 1968, some
overlapping categories have evolved to emcompass the profession. We
seek reports from these areas:

-- Management: project planning, cost estimation, scheduling,
monitoring and control.

-- Techniques: specific ways, like structured programming, to
accomplish a task.

-- Methodologies: including structured analysis and design and object
orientation.

-- Process: development, definition, automation, evaluation, and
modification.

-- Configuration management: systematic ways to keep all the artifacts
in order for easy and safe access and change.

-- Maintenance: including reverse engineering and reengineering.

Submission deadline is December 31, 1992

Pei Hsia
Computer Science Engineering Dept.
University of Texas
PO Box 19015
Arlington, TX  76019-0015
Internet hsia@cse.uta.edu
Fax (817) 273-2548

For Federal Express, please use the following address:

		CSE Department
		College of Engineering
		416 Yates Street
		Arlington, Texas 76019
                (817) 273-3785
*******************************************************


Newsgroups: comp.parallel
From: Tommy Kelly <tk@dcs.ed.ac.uk>
Subject: k-ary n-cube interesees
Apparently-To: comp-parallel@uknet.ac.uk
Reply-To: Tommy Kelly <tk@dcs.ed.ac.uk>
Organization: Laboratory for the Foundations of Computer Science, Edinburgh U
Date: Mon, 11 Jan 1993 16:33:23 GMT

Hello,

I recently had a bunch of emails from folks concerning the k-ary n-cube
analysis done by Dally at MIT, and some followup results that I had done.
Sorry chaps, but I've lost your email addresses.  Could you
resend them (adresses for hardcopy if you still want it).

Sorry, and thanks,
tommy


Newsgroups: comp.parallel
From: stgprao@st.unocal.COM (Richard Ottolini)
Subject: Re: List of world's most powerful computing sites
Organization: Unocal Corporation
Date: Tue, 12 Jan 1993 15:31:38 GMT

I'd probably not even put sites with less than about 10,000 MFLOPS on this list.
Most new scientific computers like *any* CM-5 vector configuration or a Convex-3 or even an IBM
ES9000 break a gigaflop.  Many of these companies will have a partial list of customers available.

Newsgroups: comp.parallel
From: hsong@asylum.cs.utah.edu (Hwal Song)
Subject: pvm info needed
Organization: University of Utah CS Dept
Date: Tue, 5 Jan 93 18:01:42 -0700

Hi!
I am relatively new to pvm.
Can any one send me where I can get a manual?
What's merit of pvm compared to other parallism/other distributed parallelism?
Any journals where pvm-related papers appear frequently?
Is there any mailing list for pvm users?
Any ftp site where documentations and FAQs or bug reports/fix 
can be found?

Thank you in advance.

regards,
song

Newsgroups: comp.parallel,comp.arch,comp.hypercube,comp.sys.sequent
From: lee@aero.org (Craig A. Lee)
Subject: memory/communication models
Organization: The Aerospace Corporation
Date: 7 Jan 1993 00:56:58 GMT

[ check out parlib:

        shell> mail parlib@hubcap.clemson.edu
               Subject:
               send index from faq
               .
        shell> ....
]

I'm starting a project where I need publicly available
models/simulators of shared-memory subsystems and
distributed-memory communication systems.

Any pointers appreciated.

-- 

Thanks,  Craig Lee

Newsgroups: comp.parallel
From: seamang@westminster.ac.uk (Graham Seaman)
Subject: Parallel performance tools for SPARC?
Apparently-To: comp-parallel@uk.ac.uknet
Organization: University of Westminster
Date: Thu, 7 Jan 1993 10:54:49 GMT

Does anyone know of any (copyleft or similar) tools similar
to Proteus or Tango which will run on SPARC based systems
(rather than MIPs ones), and which I could use with an
introductory parallel architectures class?

(Please email any replies - our Usenet feed is erratic. I
will summarize any responses!)

Thanks
Graham Seaman

-- 
--------------------------------------------------------------------
Graham Seaman, School of Computer Science, 
University of Westminster, 115 New Cavendish St.  London W1M 8JS 
email:  seamang@wmin.ac.uk

Newsgroups: comp.parallel
From: henrikh@cyklop.nada.kth.se dv (Henrik H\dggstr\vm)
Subject: REQUEST FOR PARALLEL APPLICATIONS
Apparently-To: comp-parallel@sunet.se
Organization: Royal Institute of Technology, Stockholm, Sweden
Date: Thu, 7 Jan 1993 09:41:11 GMT



          REQUEST FOR PARALLEL APPLICATIONS

In the search for partners in the area of applied parallel
computing we would like to create a list, as complete as
possible, of software packages available on ( or suitable for )
parallel machines.

If this list becomes interesting I will post it to this news group.

Please post to: bergman@nada.kth.se

Dr. C.M. Bergman
Center for Computational Mathematics and Mechanics
Department of Numerical Analysis and Computing Science
Royal Institute of Technology
S-100 44 Stockholm

Tel: +46 8 790 6267 * Fax: +46 8 790 0930 * Mobile: +46 10 228 02 91


Newsgroups: comp.parallel
From: joe@montebello.soest.hawaii.edu (Joe Dellinger)
Subject: Maui Supercomputer Project
Apparently-To: comp-parallel@ames.arc.nasa.gov
Keywords: Senator Inouye
Reply-To: joe@montebello.soest.hawaii.edu
Organization: School of Ocean and Earth Science Technology
Date: Mon, 11 Jan 1993 12:05:22 GMT

	Last year the federal government told the Air Force that it needed
to spend $21 million dollars for a massively parallel supercomputer center
on Maui, "to do star wars research". In practice it is expected that most
of the CPU cycles will be available for academic and corporate research.

	The University of Hawaii is going to bid to run the center. In their
bid they must specify the supercomputer _vendor_ and the _machine type_.
Unfortunately, the people making the decision don't have much time to do
serious benchmarking. So... I'm trying to collect opinions from people who
have personally used massively parallel supercomputers as part of their
research, especially in fields of particular interest to the University of
Hawaii: Geophysics, Astrophysics, Meteorology, Oceanography, and Chemistry.

(Also fields of interest to the Air Force: Image Processing and... Education?!)

	Note that I'm NOT soliciting opinions from computer scientists
interested in researching massively parallel algorithm design. We want a
machine physical scientists will be able use without having to go back
to school for another PhD in computer science.

	So... would you have any experiences to report? In particular, which
machine would YOU as a researcher like to be able to use on Maui? An Intel
Paragon, a CM-5, or a Kendall Square Research machine? Something else? Why?
(Note "Cray" is not a possible answer... not massively parallel, as stipulated
in the contract.) I'd also like to hear about your memory, disk, and on-site
tape-storage requirements, especially if you are a corporate user who might
actually be willing to pay something for the privilege.

	Thanks very very much! (and Aloha Nui Loa!) Please reply within the
next few days if you are going to reply at all, we're in the home stretch!

PS:	We expect some funds will also be allocated to put in a T3 link
Maui - Oahu - California, so the machine should actually be usable from
the mainland. And please, no wise cracks about tropical boondoggles...
we get enuff of dose already. :-)

     /\    /\    /\/\/\/\/\/\/\.-.-.-.-.......___________
    /  \  /  \  /Hawaii Institute of Geophysics, Honolulu\/\/\.-.-....__
___/    \/    \/Joe Dellinger, Internet: joe@montebello.soest.hawaii.edu\/\.-.__

Newsgroups: comp.parallel
From: trejo@ens.ens-lyon.fr (Luis Trejo)
Subject: Parallel Prefix applications
Apparently-To: comp-parallel@uunet.uu.net
Organization: Ecole Normale Superieure de Lyon, France
Date: Tue, 12 Jan 1993 16:57:43 GMT

Hi everybody,

We are looking for applications that require a large number of parallel 
prefix computations (for example, that would require the resolution of 
a large number of tridiagonal systems or recurrence-equation systems, 
or ...).

We would appreciate it if any of you could send us related information.


J.M. Adamo & L. Trejo

------------------------------------------------------------------
J.M. ADAMO, Laboratoire LIP-IMAG, Ecole Normale Superieure de Lyon
46 allee d'Italie, 69364 LYON cedex 07, FRANCE

E-Mail: adamo@frensl61.bitnet / adamo@ensl.ens-lyon.fr

Tel. +(33) 72 72 83 52, Fax. +(33) 72 72 80 80
------------------------------------------------------------------


Newsgroups: comp.parallel
From: jerry@cs.mcgill.ca (Gerald Jerry KUCH)
Newsgroups: comp.robotics
Subject: WANTED: Latombe's "Robot Motion Planning"
Keywords: Book, poverty, broke
Date: 12 Jan 93 21:45:23 GMT
Organization: SOCS - McGill University, Montreal, Canada

Does anybody out there have a used copy of Latombe's "Robot Motion Planning"
that they're willing to part with?  If so, please contact me by EMail.


-- 
 Jerry Kuch (jerry@cs.mcgill.ca)   |  NEED A NEW QUOTE
 "I was wrong to play God.  Life is precious, not a thing to be toyed with.
  Now take out that brain and flush it down the toilet."
                  --- M. Burns  "Treehouse of Horror II"