HDTenEightyP/NetNews huggingface dataset:
From: tve@crackle.CS.Berkeley.EDU (Thorsten von Eicken)
Subject: A ``packet'' History of Message Passing Systems
Organization: University of California, Berkeley
Date: 6 Jan 1993 01:34:03 GMT

I picked up a paper by Jon Flower and Adam Kolawa from ParaSoft with the above
title at Supercomputing and would like to reference it.  Does anyone know
whether it was published anywhere, or how to reach the authors?
	Thanks,
		Thorsten von Eicken

Newsgroups: comp.parallel
From: bergman@cyklop.nada.kth.se (Magnus Bergman)
Subject: Re: Second Workshop on Abstract Machine Models for Highly Parallel Computers
Apparently-To: comp-parallel@sunet.se
Organization: Royal Institute of Technology, Stockholm, Sweden
Date: Tue, 5 Jan 1993 01:09:13 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.

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: Lutz Prechelt <prechelt@ira.uka.de>
Subject: MasPar communication measurements technical report
Organization: University of Karlsruhe, FRG
Date: 	Tue, 12 Jan 1993 10:30:49 +0100


[[ This report has been announced as a draft version a few weeks ago.
   The completed version does not contain any new data. The only changes
   are an additional one page summary of results and some polishing.
]]


Technical report 1/93 of the University of Karlsruhe, Department
of Informatics is available. It is called

   "Measurements of MasPar MP-1216A Communication Operations"
   
It shows a variety of timings that have been measured
for the MasPar router, xnet, and complex library interprocessor 
communication operations. The results are discussed; some are really
surprising. 
There are some lessons to learn from these results.
The most shocking one is
  "Sometimes it is better to use router even if xnet would be possible"

Measured operations are:
  router send/fetch, ss/ps/sp/pp_rsend and ss/ps/sp/pp_rfetch, 
  (dito for xnet), 
  reduce, scan, sendwith, psort, rank, select, enumerate.
Measurement conditions are:
  Various processor activity patterns (random, regular, block), 
  various communication patterns (random, regular, block, shift),
  various packet sizes (1, 2, 4, 8, 32, 128, 256 bytes),
  various segment counts (for 'scan'), etc.

The report has 38 pages and contains 30 diagrams. 
It describes 70 different measurement series with about 
100 data points each.
I think this data is a valuable aid for all MasPar programmers.


The draft version is available in Postscript format 
for anonymous ftp from 

   sanfrancisco.ira.uka.de (129.13.13.110) in
   pub/maspar/maspar_measure_report.ps.Z  (about 205 kB)
   
This version prints on A4 paper. If you want to use US-american 
8.5 x 11 inch paper, get the file
   
   sanfrancisco.ira.uka.de (129.13.13.110)
   pub/maspar/maspar_measure_report_US.ps.Z  (about 205 kB)
 
instead (it contains the same report).
The measurement program itself is also available as source code on

   sanfrancisco.ira.uka.de (129.13.13.110) in
   pub/maspar/maspar_measure_program.tar.Z  (about 20 kB)

Remember to use 'binary' mode in ftp, or you will get garbage.   

  Lutz
  

Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
(Voice: ++49/721/608-4068, FAX: ++49/721/694092)        | less simple.

------------------------------------------------------------------------


Newsgroups: comp.parallel
From: ian@MasPar.COM (Ian L. Kaplan)
Subject: Re: mpp technology survey questions
Apparently-To: uunet!comp-parallel
Reply-To: ian@MasPar.COM (Ian L. Kaplan)
Organization: MasPar Computer Corporation, Sunnyvale, CA
Date: Wed, 6 Jan 1993 06:54:55 GMT

In article <1993Jan5.210849.26474@hubcap.clemson.edu> rms@well.sf.ca.us (richard marlon stein) writes:
>
>    Survey Questions on massively parallel computing technology
>
[various questions deleted]
>
>8) Why are scalable computation systems unbalanced in their
>capabilities to perform peripheral I/O?

  I have no idea why any of us should spend our time answering Mr.
Stein's survey.  I never saw a statement describing what the results
would be used for or what Mr. Stein's background might be (e.g.,
academic, industry or gadfly).  Further the "survey" is rather poorly
constructed.  How is a "scalable" system defined?  MasPar, for
example, makes systems that are scalable in the increments 2K, 4K, 8K,
and 16K processors.  Our communication network scales as processors
are added, so does our I/O system.  We are very proud of the fact that
we have built a balanced parallel processor.  

>
>9) If a balanced, scalable computation system could be built, one
>that affords an economically viable cost/performance advantage and
>is easy to program, what is the likelihood that its introduction
>would be successful?

  As I wrote above, MasPar has built a balanced, scalable system that
provides one of the best $/MIP ratios available, in any computer
system (including PCs).  Our entry level system (1K processors) can be
purchased for about the cost of a BMW 735i.  As to our success, we are
on our second generation machine and so far things seem pretty
successful.  Who knows, if things go really well perhaps I will be
logging in from the south of France in the future (yeah, well I can
dream).

                                 Ian

Newsgroups: comp.parallel
From: sscott@mcs.kent.edu (Stephen Scott)
Subject: Pittsburgh Supercomp. Ctr. email address wanted
Apparently-To: comp-parallel@uunet.uu.net
Organization: Kent State University
Date: Wed, 6 Jan 1993 21:26:00 GMT

I would like to contact Michael H. Lambert and Christopher J Maher. 
I believe both are at the Pittsburgh Supercomputing Center.  I would
greatly appreciate if anyone could give me any email address to this
location so that I may attempt to locate them.

Thank You,  Stephen.

---------------------------------------------------------------------------
Stephen L. Scott				Phone:  216-672-4004  x215
Heterogeneous Processing Research Group		voice mail:  x466
Kent State University				Fax:    216-672-7824
Math Sciences Building				email:  sscott@mcs.kent.edu
Kent, OH  44242


Newsgroups: comp.parallel
From: tridge@andosl.anu.edu.au (Andrew Tridgell)
Subject: general purpose parallel sorting
Organization: CSLab, Autralian National Uni.
Date: 11 Jan 1993 03:36:01 GMT

I have written a general purpose parallel sorting algorithm and I'm
now just starting to write a paper on its design. Can anyone point me
to other implementations which I can use for comparison purposes? I
have a lot of theoretical papers but no references to real
implementations. The type of architechure I'm interested in is
something like the CM5 or the Fujitsu AP1000, but I would be also
interested in just about any parallel architecture.

I will probably be making the code available sometime over the next
few months. I'll announce it here when I do.


-- 
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
Andrew Tridgell                 CSLab, Research School of Physical Sciences
Andrew.Tridgell@anu.edu.au      Australian National University (x3064)
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

Newsgroups: comp.parallel
From: kavuri@myria.cs.umn.edu (Sakuntala Kavuri)
Subject: Techniques of external sort
Apparently-To: comp-parallel@uunet.uu.net
Organization: University of Minnesota
Date: Thu, 7 Jan 1993 22:01:03 GMT



	Hi

	I am on the lookout for references of  parallel techniques
	in external sort.
	Reference of any other important work in external sort techniques 
	is also appreciated.

	I prefer work on Shared-nothing architectures, but please do
	suggest work in any architecture that u are aware of.

	Naga Kavuri

Newsgroups: comp.parallel
From: stgprao@st.unocal.COM (Richard Ottolini)
Subject: Re: List of world's most powerful computing sites
Organization: Unocal Corporation
Date: Mon, 11 Jan 1993 18:26:57 GMT

In article <1993Jan11.142744.8429@hubcap.clemson.edu> gunter@tartarus.uwa.edu.au (Gunter Ahrendt) writes:
>	List of the world's most powerful computing sites as of 11-JAN-1993
> [top] +34,148 Mflops - (05-JAN-1993)

I thought a 1024-node CM-5 had been shipped.  This would have 128,000 Mflops peak.

Newsgroups: comp.parallel
From: rgk@uts.ipp-garching.mpg.de (Robert Klaffl)
Subject: Huge FFT on distributed Systems
Keywords: FFT,distributed
Organization: Rechenzentrum Garching
Date: 	Thu, 7 Jan 1993 04:42:08 +0100

Hi,

Is there a fast 3D FFT PD Source for use on distributed Systems
with minimal communication. I would need to do real FFT sized
1024x1024x1024 on a heterogenous network of Supercomputers, parallel
Machines Workstations. The Storage is sufficient but all FFT's i've
been digging so far are communication intensive and make the
machines waiting for Ethernet. 

Any help would be much appreciated.

Robert

*====================================================================*
#                                      #                             # 
# Robert Klaffl                        #   Simulating the Universe   #
# robert@convex.mpa-garching.mpg.de    #                             #
# Max-Planck-Institut fuer Astrophysik #   faster than Real-Time...  #
#                                      #                             #
*====================================================================*


Newsgroups: comp.parallel
From: ghouse@gauss.cs.jhu.edu (Mujtaba Ghouse)
Subject: Re: Techniques of external sort
Apparently-To: comp-parallel@uunet.uu.net
Organization: Johns Hopkins Computer Science Department, Baltimore, MD
Date: Mon, 11 Jan 1993 19:43:05 GMT

kavuri@myria.cs.umn.edu (Sakuntala Kavuri) writes:
>	Hi
>	I am on the lookout for references of  parallel techniques
>	in external sort.

Try:

Aggarwal and Vitter, "The Input/Output Complexity of Sorting and
Related Problems," CACM September 88.

Vitter and Shriver, "Optimal Disk I/O with Parallel Block Transfer,"
STOC 90.

and

Nodine and Vitter, "Greed Sort: An Optimal External Sorting Algorithm
for Multiple Disks," Tech. Report CS 91-20, Department of Computer Science,
Brown University.


-Mujtaba Ghouse

Newsgroups: comp.parallel
From: owhadi@gale.rice.edu (Eric Owhadi)
Subject: Re: BAKS: Basler Algorithmen Klassifikations-Schema
Apparently-To: comp-parallel@ncar.ucar.edu
Organization: Rice University
Date: Thu, 7 Jan 1993 17:10:50 GMT

I am interested in this report too. (English only)

---------------------------------------------------------------------
Eric Owhadi
Geophysics and Computer Science Researcher
GEOLOGY & GEOPHYSICS
Wiess School of Natural Sciences
Rice University
P.O. Box 1892
Houston, Texas 77251-1892

6100 South Main Street
Houston, Texas 77005

Telephone (713) 527-8750---3331
Email     owhadi@geophysics.rice.edu
Fax       (713) 285-5214


Newsgroups: comp.parallel
From: jz1@Ra.MsState.Edu (Jianping Zhu)
Subject: Reference on KSR1 parallel computers
Apparently-To: comp-parallel@uunet.uu.net
Organization: Mississippi State University
Date: Sun, 3 Jan 1993 18:44:36 GMT


	I would appreciate very much any information
	about references (papers and reports) reporting
	algorithm development and applications on
	KSR-1 parallel computers.

	Please respond to:  
		
		jzhu@erc.msstate.edu

	Thanks,


	Jianping Zhu
	Mississippi State University


Newsgroups: comp.parallel
From: wmitchel@fergie.dnet.ge.com (Bill Mitchell)
Subject: Frontiers of Massively Parallel Processing
Organization: GE Advanced Technology Labs
Date: 12 Jan 1993 19:33:29 GMT

The Advisory Committee for the Frontiers of Massively Parallel
Processing 1994 is accepting nominations for General Chair and
Program Chair. This IEEE sponsored conference is scheduled for
June 6-9, 1994 near Washington, D. C. Please submit nominations
to R. Michael Hord, GE Advanced Technology Laboratories, Moorestown
Corporate Center, MS 145-2, Moorestown, NJ 08057; (609) 866-6548.

Newsgroups: comp.parallel
From: skohn@cs.ucsd.edu (Scott Kohn)
Subject: request for heterogenous references
Followup-To: comp.parallel
Keywords: heterogenous, references, help
Organization: UC-San Diego CSE Department
Date: 7 Jan 93 01:01:16 GMT



We are starting up a reading group here at UCSD on heterogenous
computer systems and would be intersted in pointers to papers on

	- heterogenous applications
	- languages
	- scheduling
	- program decomposition
	- tools (such as PVM or HeNCE)
	- almost anything else

Any references would be greatly appreciated.  I will be sure
to post a summary.

Thanks.

-- Scott



Newsgroups: comp.parallel,comp.sys.sgi,comp.sys.sgi.admin
From: vamsee@abgen.tamu.edu (Vamsee Lakamsani)
Subject: Configuring a Silicon Graphics Workstation as a remote host to an i860 parallel computer
Organization: Center for Macromolecular Design, Texas A&M University.
Date: 11 Jan 1993 21:18:19 GMT

The i860 SUG (System User's Guide) says remote host software runs
on Sun-3 and Sun-4 workstations. Does the same software work for 
a Silicon Graphics workstation? Is this software available at SSD's
ftp site? Is it possible to control access to remote hosts from the
SRM or one of the nodes? 

Previous experience on interfacing a Silicon Graphics Workstation (as a
remote host) to an i860 machine (say Paragon) would be very useful.

Vamsee
(vamsee@tamu.edu)

Newsgroups: comp.parallel
From: zhou@ifi.unizh.ch (Hongbo Zhou)
Subject: DAG generators wanted
Organization: University of Zurich, Department of Computer Science
Date: Tue, 12 Jan 93 17:58:12 GMT


Dear Netters,

I am looking for graph generators (source code) that generate 
Directed Acyclic Graphs. 

Thanks for your help in advance.



Newsgroups: comp.parallel
From: gupta@prl.phil.co.uk (Ashok Gupta)
Subject: Lecture in London
Reply-To: gupta@prl.phil.co.uk
Organization: Philips Research Laboratories, Redhill, UK
Date: 8 Jan 93 15:09:07 GMT



                          The British Computer Society
                      Parallel Processing Specialist Group

                                   (BCS PPSG)

                                Public Lecture:


                      HIGH PERFORMANCE PARALLEL COMPUTING:
                                    A REVIEW

                             by Professor John Gurd


                                Wed Jan 13 1993
                              6.15 pm for 6.30 pm

                            Fleming Lecture Theatre
                           University College London
                                Torrington Place
                                   London WC1

                        (entrance directly opposite main
                         entrance to Dillons book shop)

                       This is a free public lecture open
                                to one and all.

                         No prior booking is required.

                      Membership of the BCS or of the PPSG
                                is not required.


                                       **
                    ** PLEASE CIRCULATE THIS ANNOUNCEMENT **
                                       **


Newsgroups: comp.parallel
From: bubeck@peanuts.informatik.uni-tuebingen.de (Till Bubeck)
Subject: Re: putstring() in PVM
Organization: "Lehrstuhl fuer Technische Informatik, Uni Tuebingen"
Date: 11 Jan 1993 15:24:34 GMT

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;


Simply do:
 	initsend();					/* clear send buffer */
	putstring("hello world");			/* put into buffer */
	snd(server_name,server_instnum,MESSAGE_TYPE);	/* send buffer */
	


Till Bubeck


Newsgroups: comp.parallel
From: pm@icase.edu (Piyush Mehrotra)
Subject: Research positions at ICASE
Reply-To: pm@icase.edu
Organization: ICASE
Date: 7 Jan 1993 16:45:43 GMT

                         Research Positions at ICASE


    The Institute for Computer Applications  in  Science  and  Engineering
    (ICASE)  is  seeking  fresh  PhDs for staff scientist positions in the
    areas  of  systems  software  for  parallel  computers  and   parallel
    numerical  algorithms.   The  principal focus of the software research
    effort at ICASE is development of tools  and  environments  for  large
    scale  parallel  computing  applications.  Similarly, the focus of the
    parallel  algorithm  research  is  development  of  scalable  parallel
    numerical  algorithms  applicable  to computational fluid dynamics and
    other scientific application areas.

         In the software area  we  are  looking  for  PhDs  interested  in
    collaborative  research  on  tools for distribution, mapping, and load
    balancing, on tools for performance monitoring and prediction, and  on
    compiler  design  and  enhancement.   In  the  algorithms  area we are
    looking for PhDs interested in parallel multigrid algorithms, adaptive
    grid computation, and domain decomposition.

         Staff scientists positions are usually  for  two  years,  with  a
    possibility  of  a one year extension.  ICASE is a non-profit research
    organization located at  NASA  Langley  Research  Center  in  Hampton,
    Virginia.    The   institute   offers   excellent   opportunities  for
    researchers  to  carry  out  first  rate  computer  science   research
    motivated  by  the  complex  and computationally intensive problems of
    interest to NASA.  Researchers at ICASE will have access to  Langley's
    64  processor  Intel  PARAGON,  Cray Y/MP, and also internet access to
    many other parallel architectures.

    Please send resumes to:

    Director
    ICASE, MS 132C
    NASA Langley Research Center
    Hampton VA 23665

    or by e-mail to

    positions@icase.edu

Newsgroups: comp.parallel
From: dsmith@chaos.cs.brandeis.edu (Donald A. Smith)
Subject: Performance of MP1 vs MP2
Apparently-To: comp-parallel@uunet.uu.net
Organization: Brandeis University
Date: Mon, 4 Jan 1993 23:29:08 GMT

Can anyone send me information about the relative performance of the 
MasPar MP2 as compared to the MP1?

I have been using MPL on the MP1 and I like the language (more than,
say, TMC's C* or starlisp).  It is well documented and reliable, and
it has a seamless interface between sequential and parallel control 
structures.  Things work the way you expect them to.  Some minuses:  
the lack of virtual processing and the need to execute MPL programs on 
the slow intermediate processor, the ACU, instead of the faster front 
end.  Can anyone send me their observations about the MP1 or MP2?

   Don Smith (dsmith@chaos.cs.brandeis.edu)

Newsgroups: comp.parallel
From: hct4708@ccfds2.draper.com (Hung-Chou Tai)
Subject: putstring() in PVM
Organization: Draper Laboratory
Date: Fri, 8 Jan 1993 16:23:53 GMT

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?

Any and all help would be appreciated!

Thanks!!

Hung-Chou Tai
CS Draper Labs



Newsgroups: comp.parallel
From: rms@well.sf.ca.us (richard marlon stein)
Subject: mpp technology survey questions
Apparently-To: comp-parallel@uunet.uu.net
Organization: Whole Earth 'Lectronic Link
Date: Tue, 5 Jan 1993 19:36:14 GMT

    Survey Questions on massively parallel computing technology

1) What steps should industry, government, and academia take to
expedite the introduction and adoption of scalable computation
systems?  What are the economic advantages or disadvantages from
such an effort?

2) What aspects of scalable computation systems weigh against their
use within multiple application domains when compared to the
potential for using shared-memory multiprocessor systems?

3) Have you ever programmed a scalable computation system?  Which
one(s)?

4) Do you expect the PRAM model to become a major factor in the
universal acceptance of message-passing multicomputer systems?

5) When do you expect the generational improvements in shared-
memory multiprocessor systems based on CMOS VLSI process technology
to cease?

6) What rational considerations should an end-user apply to the
procurement process before deciding whether to acquire a scalable
computation system or shared-memory multiprocessor?

7) What is your outlook on the software industry?  Do you foresee
the possibility that a "scalable" Microsoft could emerge by
introducing a scalable operating system for scalable computation
systems?

8) Why are scalable computation systems unbalanced in their
capabilities to perform peripheral I/O?

9) If a balanced, scalable computation system could be built, one
that affords an economically viable cost/performance advantage and
is easy to program, what is the likelihood that its introduction
would be successful?

10) Do you have ethical or moral concerns about the continuous
introduction and integration of embedded computer systems into
society?  What are they?

11) What competitive advantage could be attributed to the
premeditated design of scalable software for scalable systems?  Are
there penalties for building software with this goal in mind?  What
might they be?

12) What do you believe the current vendors of scalable systems
should focus on in terms of marketing strategy?  Product
engineering?
-- 
Richard Marlon Stein, Internet: rms@well.sf.ca.us
To those who know what is not known;  The Chronicles of Microwave Jim!

Newsgroups: comp.parallel
From: ghenniga@NMSU.Edu
Subject: iPSC/860 malloc problem?
Apparently-To: comp-parallel@uu.net
Reply-To: ghenniga@NMSU.Edu
Organization: New Mexico State University - Electromagnetics Group
Date: Mon, 4 Jan 1993 21:33:15 GMT



	I'm programming an Intel iPSC/860 using C and have an incessant
problem when using malloc. When I run the code it'll go in to the malloc
function and just hang. This occurs at different points depending on which
data sets I'm using but the thing that really bothers me is that it gives
me absolutely NO error and using "ipd" I can see that the amount of memory
I'm attempting to allocate is reasonable, in some cases as little as 40
bytes. I've also run problems with a different type of data but with a MUCH
higher memory requirement with no problem. I've tried using "ipd" with the
"step -i" instruction to see what's happening but I'm afraid my i860
assembly skills are sorely lacking! I'm compiling my code on a Sun4 remote
host and I believe the software release is 3.3.1. 
	Has anyone had any similiar experiences? I've had similiar
problems, with different pieces of code, on an nCube but it would fault
rather than lock up.

Any ideas/suggestions/help would be GREATLY appreciated!

Thanks in advance,
Gary Hennigan
---------
PhD Student, Computational Electromagnetics
New Mexico State University
email: ghenniga@NMSU.Edu

Newsgroups: comp.parallel,comp.lang.fortran