HDTenEightyP/NetNews huggingface dataset:
From: ghosh-bhaskar@CS.YALE.EDU (Bhaskar Ghosh)
Subject: dynamic load balancing techniques : HELP !!
Apparently-To: comp-parallel@uunet.uu.net
Organization: Yale University, Department of Computer Science, New Haven, CT
Date: Fri, 4 Sep 1992 18:34:35 GMT


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
===============================================================================

Newsgroups: comp.parallel
From: maniattb@cs.rpi.edu (Bill Maniatty)
Subject: Re: Synchonizing watches
Apparently-To: comp-parallel@cis.ohio-state.edu
Organization: Clemson University
Date: Fri, 4 Sep 1992 21:49:43 GMT

In article <1992Sep4.174143.13747@hubcap.clemson.edu>, mln@sunkj.larc.nasa.gov (Michael L Nelson) writes:
|> I must be missing something here, because this looks quite simple.
   [....]
It isn't quite this simple :-)
|> 
|> -A & B already know this procedure.
|> 
|> A: says "Bing" to B
|>    B responds with "Bing" to A
|> 
|> this is ABBA time - the total delay
True
|> 
|> A:
|> 1. says "Bong"
I assume you want A to say "Bong" when A hears B's "Bing"
Then when B hears the "Bong" B will have sufficient information to compute
BA + AB == AB + BA, Otherwise B cannot know AB + BA
|> 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)
This is not the case.

	T0 A Goes Bong
	T1 B hears Bong = T0 + AB
	T2 A Goes Bong Second Time = T0 + N
	T3 B Hears Bong = T0 + AB + N
Please note that AB is undetermined (B lacks sufficient information
to determine this).  The problem lies in the fact that A and B do not
share the clock, but each keep their own local clocks, which are not currently
synchronized (as per the given).
|> 
|> B tells A what AB time is.
B does not have the value for AB.
|> 
|> A says "Bang" and waits AB time before zeroing
|> the watch
A does not have the value of AB computed
|> 
|> When B hears "Bang", B immediately zero's the watch
|> 
|> synchronized
Not quite.
|> 
|> Michael Nelson
|> 

Bill
-- 
|
|	maniattb@cs.rpi.edu - in real life Bill Maniatty
|

Newsgroups: comp.parallel
From: Greg Wilson <gvw@epcc.edinburgh.ac.uk>
Subject: Re: Biblio. on supercomputing & parallel processing
Organization: Edinburgh Parallel Computing Centre
Date: 9 Sep 92 14:39:35 GMT


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
 ========================================================================

Newsgroups: comp.parallel
From: ramadan@cs.widener.edu (Mazin Ramadan)
Subject: Search for Distributed algorithms for Minimum spanning trees
Keywords: Distributed Algorithms, Minimum spanning trees
Organization: Widener University CS Department, Chester PA
Date: 14 Sep 1992 18:42:21 -0400

Dear friends
	Hello there!
	I am looking for Distributed Minimum Spanning trees
algorithms.  It will be of great help if you could send me information
on papers or ftp sites (if any) from where I can get more information
on this topic.
Thanks

=================================================================
" Dreams are not meant to come true
	They are meant to be achieved. "

ramadan@cs.widener.edu

Xref: sparky comp.parallel:2136 comp.os.research:932 comp.arch:9433 comp.compilers:1558
From: charlie@cse.ucsc.edu (Charlie McDowell)
Subject: synchronization event traces
Summary: traces of real programs needed
Keywords: semaphores synchronization traces
Organization: University of California, Santa Cruz (CE/CIS Boards)
Distribution: usa
Date: 11 Sep 1992 18:58:58 GMT

We are looking for TRACES and/or PARALLEL PROGRAMS that use EXPLICIT
(preferably semaphore style) synchronization.

We are in need of traces of real programs that use explicit synchronization.
We would prefer programs that use semaphore style synchronization but
will consider any explicit synchronization.  We need them to test a new
trace based algorithm for detecting races in parallel programs.

Although the problem we are solving is NP-hard we are hypothesizing
that for actual programs our polynomial time algorithm will give
accurate results.

If you have real programs that use semaphores but do not have traces
we would still like to hear from you in case we can't get traces.
If necessary we can extract the synchronization structure from your
program and artificially create a trace.

Thanks for your help.

Charlie McDowell
charlie@cis.ucsc.edu



Newsgroups: comp.parallel
From: dpm@scs.leeds.ac.uk (D P Mallon)
Subject: req for info on Chorus, Express and VSM
Apparently-To: uunet.uu.net!comp-parallel
X-Posted-From: csparc2.leeds.ac.uk
Organization: The University of Leeds, School of Computer Studies
Date: Mon, 7 Sep 1992 11:03:49 GMT
X-Posted-Through: sol.ctr.columbia.edu


I should be grateful for information relating to

a) Express.  I believe this is a dist/parallel operating system
   providing facilities for SVM, message passing, and process
   mapping.

b) The Chorus micro-kernel, and in particular its distributed
   shared memory subsystem.

References to papers, or preferably, ftp cites where information
and papers can be obtained would be useful.

Thanks.

Dave Mallon	dpm@scs.leeds.ac.uk

Newsgroups: comp.parallel
From: duncan@spicameiko.co.uk (Duncan Roweth)
Subject: GAUSSIAN on parallel machines
Apparently-To: hypercube@hubcap.clemson.edu
Organization: meiko
Date: Tue, 15 Sep 1992 16:54:35 GMT

-- 
Dear Readers

Does anyone know of people running GAUSSIAN on networks of workstations using
PVM or parallel machines using Dash/Express/iPSC comms/nCube comms/.....

Best Wishes
Duncan Roweth

-------------------------------------------------------------
|  Meiko Limited                Phone : +44 454 616171      |
|  650 Aztec West               FAX   : +44 454 618188      |
|  Bristol BS12 4SD             E-Mail: duncan@meiko.co.uk  |
|  England                                                  |
-------------------------------------------------------------


Newsgroups: comp.parallel
From: adriaan@dcs.qmw.ac.uk (Adriaan Joubert)
Subject: BLAS-1 and 2 for iPSC
Organization: Computer Science Dept, QMW, University of London
Date: Sat, 5 Sep 1992 13:01:37 GMT

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                 *                                        *
 *************************************************************************** 

Newsgroups: comp.parallel
From: Patrick Surry <pds@epcc.edinburgh.ac.uk>
Subject: Re: Synchonizing watches
Organization: Edinburgh Parallel Computing Centre
Date: 7 Sep 92 17:07:51 GMT


In article <1992Sep4.174143.13747@hubcap.clemson.edu>, mln@sunkj.larc.nasa.gov (Michael L Nelson) writes:
> I must be missing something here, because this looks quite simple.
> 
> -A & B already know this procedure.
> 
> A: says "Bing" to B
>    B responds with "Bing" to A
> 
> this is ABBA time - the total delay

Yup.
 
> A:
> 1. says "Bong"

at time T say, message arrives at B at T+AB

> 2. waits, say N minutes (N > ABBA) 
> 3. says "Bong" again

at time T+N say, message arrives at B at T+N+AB

> B already knows what N is, and can then determine
> What AB is (Bong2 - Bong1 - N)

No - he just receives two messages N minutes apart:
(Bong2-Bong1-N) = T+N+AB-(T+AB)-N = 0, not AB

> (un)synchronized ;-) 

Patrick

---------------------------------------------------------------------------
 Engineers  think that theory  approximates reality | Mathematicians never
 Physicists think that reality approximates theory  | make the connection
---------------------------------------------------------------------------
 Patrick Surry, JCMB 2254, Edinburgh, Scotland   e||)   Edinburgh Parallel  
 EMail: pds@epcc.ed.ac.uk  Tel: (031) 650-5960   c||c   Computing Centre    
---------------------------------------------------------------------------

Newsgroups: comp.parallel
From: kielmann@isa.informatik.th-darmstadt.de (Thilo Kielmann)
Subject: Re: Glossary of Parallel Computing Terms
Organization: TU Darmstadt
Date: Tue, 15 Sep 1992 15:02:31 GMT

In article <1992Sep14.122934.16072@hubcap.clemson.edu>, Greg Wilson <gvw@epcc.edinburgh.ac.uk> writes:
> 
> The second version of a glossary of parallel computing terms is now
> available by anonymous ftp from:
> 
> 	ftp.epcc.ed.ac.uk:pub/personal/gvw/glossary.ps.Z.uu
> 

First of all: Thank you very much for this piece of work!

Second: A question to your definition of the "parallel balance point".

You define the time T taken to perform some calculation of size N on P
processors as:

         T = fx(N,P) - fc(N,P)

where the execution time function fx is a decreasing function of P,
while the coordination time function fc is an increasing function of P.

I worry about the subtraction of these 2 functions. Isn't it necessary
to perform both execution _and_ coordination? So, why not add fx and fc?

Is it just a typo, or am I wrong?


Thilo Kielmann   (kielmann@isa.informatik.th-darmstadt.de)

Dept. of Computer Science (FB 20)
University of Darmstadt
Germany

Newsgroups: comp.parallel
From: bart@cs.wisc.edu (Bart Miller)
Subject: New release of the IPS par prog measurement tools
Apparently-To: uunet!comp-parallel
Organization: University of Wisconsin, Madison -- Computer Sciences Dept.
Date: Wed, 9 Sep 1992 23:08:26 GMT

	        Announcing the availability of
		      Release 5.0 of the
	    IPS-2 Parallel Program Measurement System:

IPS-2 is a performance measurement system for parallel and distributed
programs.  It can provide a large amount of performance data about the
execution of a parallel program, and this information is organized so
that access to it is easy and intuitive.  IPS-2 also provides various
high-level analyses and a powerful, graphic user interface and display.
Programmers do not have to modify their programs to use IPS-2 (there is
only a slightly modified compiling procedure).

The major additions to Release 5.0 includes support for SPARC and CRAY Y-MP
architectures, trace browsing, support for study multiple applications or
multiple runs of the same applications in one session, manual phase
selection, and user interface improvements (such as window stacking and
interactive help windows).

IPS-2 now runs on the DECstation, Sun, Sequent Symmetry, and Cray Y-MP --
and a program could be running on a heterogeneous combination of these
machines.  Both message-passing and shared-memory communications are supported.
The user interface runs under X-windows, and supports both B&W and color
displays.  A version for the TMC CM-5 is under development.

An overview of IPS-2 appears in the April 1990 issue of IEEE Transactions
on Parallel and Distributed Systems.  A Users Guide and an Installation
Guide are also available.  If you have Internet access, you can ftp a
Postscript copy of the Users Guide.  Use ftp to access asiago.cs.wisc.edu,
login "anonymous".  The file is called "usersguide.ps.Z" and is in "compress"
format.  You can use "uncompress" or "zcat" to read the file.

Other papers on IPS-2 are found in metrics.ps.Z, edcu.ps.Z, and wrapping.ps.Z.

A license agreement and small tape distribution fee are necessary to obtain
the software for research purposes.  Copies of the (1) license agreement,
(2) order form, and (3) cover letter are available via ftp in file ips.tar
(this file does NOT contain the actual system).

IPS-2 will be available for demonstration at Supercomputing '92 as a
Research Exhibit.

If you have questions or want more information, mail bart@cs.wisc.edu.

						--bart miller
						  uw-madison cs dept
						  bart@cs.wisc.edu

Newsgroups: comp.parallel
From: rsaripa@saturn.cs.clemson.edu (Saripalli Ramakrishna)
Subject: Survey of parallel and distributed systems!.
Apparently-To: comp-parallel@uunet.uu.net
Organization: Clemson University Computer Science Dept.
Distribution: na
Date: Sat, 5 Sep 1992 08:34:09 GMT

Hi,

	I am trying to find out which of the two systems would most people prefer to use?.

	1) Distributed Memory system(Like hypercubes or Heterogenous systems connected by networks)
	2) Shared Memory system like BBN Butterfly and others ...

	
	Which of the above 2 systems would people prefer to use ?.

	
		1) The criteria used to judge the above question would be ,among others ...
			a) Efficiency.
			b) Ease of programming.
			c) Underlying software ( Operating systems and Compilers).
			d) Flexibility 
			e) Configuration 
			f) cost.

			and others.


	I would like people to send me e-mail stating what would be their preference and why?.
	Assume that you are the only user running on the system.


	I would really appreciate it.

								Thanks a lot,
						Saripalli Ramakrishna


e-mail : rsaripa@cs.clemson.edu
Man is a beast and usually has no control over his passions.

Newsgroups: comp.parallel
From: idm@koala.mel.dit.CSIRO.AU (Ian Mathieson)
Subject: Distributed memory programming courses
Organization: CSIRO, Division of Information Technology, Melbourne
Date: Wed, 9 Sep 92 05:23:15 GMT

I plan to be in the US for the FRONTIERS'92 Symposium (October 19-21).

Does anyone know of any public/commercial courses/tutorials on
programming/details of the CM-5, Paragon, nCube, etc. to be held
in the surrounding weeks (October 12-16, October 22-30)?

Much appreciated.

-- idm.

Dr. Ian Mathieson, High Performance Computation Project,
CSIRO Australia - Division of Information Technology,
723 Swanston Street, Carlton, Victoria 3053, Australia.
Phone:	+61-3-282-2632		FAX:	+61-3-282-2600

Newsgroups: comp.parallel
From: gusciora+@cs.cmu.edu (George Gusciora)
Subject: Pipeline performance analysis
Organization: School of Computer Science, Carnegie Mellon
Date: Sat, 12 Sep 1992 02:09:28 GMT


I have a system which can be modeled by a large pipeline where the
stages of the pipeline perform an amount of computation which is dependent
on the particular data set which is passing through that stage (stages do
not perform the same amount of computation on each data set).  I'm
looking for some performance analysis work on similar problems.  If
you are familiar with this, please read on.

The basic overview of the model is this: each stage of the pipeline
performs the same amount of work over all of the sets of data
which must be processed.  However, the amount of computation done
at a stage varies according to which data item is flowing through
that stage.

A bit more precise (in case anyone wants to discuss this)
we consider a P-stage pipeline which is used to process n items of
data.  Label the amount of computation to be done on data item i at
stage j as Eij.  Between stages in the pipeline are large data buffers
which, for simplicity, we can assume are arbitrarily large.  The
pipeline is 'balanced' in such a way that for any stage j, the
sum E0j + E1j + ... Enj is equal to a similar sum constructed
at any other stage.

I would like some performance analysis of a system like this.  My guess
is that it will depend on the range and distribution of E*j for each stage.
Does anyone know of work done in analyzing the performance of systems
similar to this?  Since this is such a specific topic, please send replies
to me (gusciora@cs.cmu.edu) and I'll post a summary if people are
interested.

Thanks,
George Gusciora
gusciora@cs.cmu.edu
Department of Electrical and Computer Engineering
Carnegie Mellon University

Newsgroups: comp.parallel
From: ojuarez@mtecv2.mty.itesm.mx (Octavio Juarez Espinosa)
Subject: looking for samples in Linda
Summary: help
Keywords: Linda samples
Organization: I.T.E.S.M. Campus Monterrey
Date: 15 Sep 92 02:30:43 GMT




Hi,

I'll appreciate it if you send me some samples in Linda. I am very
interested in learning Linda.

Thanks in advance.

Sincerely,

Octavio Juarez Espinosa
ojuarez@mtecv2.mty.itesm.mx

-- 
Octavio Juarez Espinosa
Gabriel Valerio 1134 
Saltillo, Coahuila    CP 25000
Mexico  email ojuarez@mtecv2.mty.itesm.mx

Newsgroups: comp.parallel
From: Greg Wilson <gvw@epcc.edinburgh.ac.uk>
Subject: Glossary of Parallel Computing Terms
Organization: Edinburgh Parallel Computing Centre
Date: 12 Sep 92 12:56:01 GMT


The second version of a glossary of parallel computing terms is now
available by anonymous ftp from:

	ftp.epcc.ed.ac.uk:pub/personal/gvw/glossary.ps.Z.uu

This is a partial, preliminary release of material which will eventually
appear as a textbook, to be titled "Practical Parallel Programming".  It
may be reproduced and circulated freely so long as the notice on the
title page is included.  My thanks to Richard Enbody, Eugene Miya, David
Skillicorn, and others for their comments and suggestions; further
comments and suggestions for additions would be very welcome. 

 ========================================================================
  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
 ========================================================================

Newsgroups: comp.parallel
From: dwf@acl.lanl.gov (David W. Forslund)
Subject: Re: Research Position opening
Reply-To: David W. Forslund <dwf@acl.lanl.gov>
Organization: Advanced Computing Lab, LANL, NM
Date: Tue, 15 Sep 1992 14:32:54 GMT

	Distributed Computing Research Position at LANL

The Advanced Computing Laboratory of the Computing and Communications
Division at Los Alamos National Laboratory invites applications for a
postdoctoral appointment in research in distributed computing.

The Advanced Computing Laboratory, one of two Dept. of Energy High
Performance Computing Research Centers, is a central focus for
technology transfer in advanced computing to industry, academia, and
other national laboratories.  We are supporting an advanced
computational environmental for computational scientists working
together in interdisciplinary teams to solve today's Grand Challenges,
forming the building blocks of tomorrow's computing environment, and
educating others in the tools of the trade.  We are currently seeking
highly qualified Postdoctoral candidates for an aggressive research
program in distributed computing involving high performance networks
(gigabit/sec), large scale parallel machines (64K CM-200, 1024 node
CM-5), and advanced visualization tools.  This environment is
envisioned to support not only Grand Challenges, but provide a
fundamental capability for simulations appropriate to a wide variety
of industrial applications.  If this opportunity is of interest to you
please send a brief resume including your research interests to:


David Forslund
Deputy Director
Advanced Computing Laboratory
MS B287
Los Alamos National Laboratory
Los Alamos, NM 87545

Voice:(505) 665-1907
FAX: (505) 665-4939
EMAIL: dwf@lanl.gov



--
David Forslund
Advanced Computing Laboratory
MS B287
Los Alamos National Laboratory
Los Alamos, NM 87545

Voice:(505) 665-1907
FAX: (505) 665-4939
EMAIL: dwf@lanl.gov

Newsgroups: comp.parallel
From: ghosh@CS.YALE.EDU (Bhaskar Ghosh)
Subject: Conrad and Agarwal, ICPP 92
Organization: Yale University, Department of Computer Science, New Haven, CT
Date: 4 Sep 1992 16:48:07 -0400

I am trying to reach James Conrad or Dharma P. Agarwal - they have a
paper in ICPP 1992 on load balancing using graph partitioning.
They might be at NCState, but i am not sure. Couldn't find a way to
get their email addresses. Any info would be appreciated. 

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

Newsgroups: comp.parallel
From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Subject: Re: parallel search
X-Char-Esc: 38
Apparently-To: comp-parallel@sunet.se
X-Charset: ASCII
Organization: UDAC, Uppsala, Sweden
Date: Wed, 9 Sep 1992 13:08:22 GMT

In article <1992Sep3.123256.14501@hubcap.clemson.edu>, sarnath@sybil.cs.buffalo.edu (Ramnath Sarnath) writes:
|> 
|> I am looking for references to Parallel search algorithms on 
|> ordered/partially ordered structures.
|> 
|> I would appreciate any pointers.
|> 
|> sarnath
|> 

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.

Magnus Selhammar

Newsgroups: comp.parallel
From: gkwan@balboa.eng.uci.edu (Greg Kwan)
Subject: Determining physical nodes on Intel iPSC/2?
Organization: University of California, Irvine
Date: 9 Sep 92 04:58:51 GMT


Does anyone know of a way to determine on which physical node a
process is running on the iPSC/2? Intel gave an undocumented/
unsupported call, but it returns unexpected values. For example,
when allocating a 16 node cube, it returned:
node  0 = 512, node  1 = 513, node  2 = 516, node  3 = 517,
node  4 = 520, node  5 = 521, node  6 = 524, node  7 = 525,
node  8 = 528, node  9 = 529, node 10 = 532, node 11 = 533,
node 12 = 536, node 13 = 537, node 14 = 540, node 15 = 541.

Are these just offset by the number 512? Currently, our cube
only has 30 nodes (2 compute nodes are defective), but it
appears that the intermediate physical locations would be
present in a fully allocated (32 node) cube. To put it an-
other way, how would one determine how many links a message
passes through from one node to another?

Thanks for any help.

greg

gkwan@balboa.eng.uci.edu

Newsgroups: comp.parallel