HDTenEightyP/NetNews huggingface dataset:
From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Newsgroups: fj.mail-lists.parallel
Subject: Re: parallel search
Date: 9 Sep 92 15:13:57 GMT
Distribution: fj

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
From: duncan@spicameiko.co.uk (Duncan Roweth)
Newsgroups: fj.mail-lists.parallel
Subject: GAUSSIAN on parallel machines
Date: 15 Sep 92 17:28:54 GMT
Distribution: fj

-- 
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                                                  |
-------------------------------------------------------------
From: reiner@ksr.com (David Reiner)
Newsgroups: fj.mail-lists.parallel
Subject: OODBMS oppty, Boston, KSR
Date: 15 Sep 92 12:59:28 GMT
Distribution: fj

Kendall Square Research is looking for a creative software designer to
adapt, enhance, and tune third-party object-oriented DBMSs (OODBMSs) and
associated object-oriented development environments for the KSR parallel
machine. 

Areas of focus include large objectbase support, parallel objectbase
processing, and integration of OO development environments/languages with
OODBMSs. 

Essential knowledge: Current OO development environments including OODBMS
internals, with both hands-on experience and theoretical grounding.  Important
skills: Unix, C, and C++.  A significant plus: experience with relational DBMS
internals, parallel machines, performance tuning, software porting, or large
commercial database/objectbase applications.  MSCS in Computer Science 
preferred, or equivalent experience.

The ideal candidate has 5+ years of experience with a track record of design,
implementation, or porting OO products.  S/he is a creative software designer,
a strong, hands-on implementor, a team player able to work independently as
well, and a good communicator.  S/he welcomes challenge and complexity in a
very focused professional environment.

Email resumes to: reiner@ksr.com 

or send via US Mail to:
  Kendall Square Research Corporation
  Attn: Personnel Dept OODSR
  170 Tracer Lane
  Waltham, MA 02154

Kendall Square Research Corporation is an Equal Opportunity Employer.
From: pds@epcc.edinburgh.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: Re: Synchonizing watches
Date: 8 Sep 92 13:37:34 GMT
Distribution: fj

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    
---------------------------------------------------------------------------
From: dwf@acl.lanl.gov (David W. Forslund)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Research Position opening
Date: 15 Sep 92 15:18:57 GMT
Distribution: fj


	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
From: zielke@fozzie.nrl.navy.mil (David Zielke)
Newsgroups: fj.mail-lists.parallel
Subject: Needed Parallel SOR for IPSC/860 Hypercube
Date: 14 Sep 92 12:30:31 GMT
Distribution: fj

I am looking for a parallel solver for a Two-dimensional Poisson
Equation.  For my sequential application I am currently using an
SOR method.  I can fit the other parts of the algorithm to the
data structures required to do this well.  Any suggestions or
pointers would be greatly appreciated.  

David Zielke
Naval Research Laboratory
zielke@fozzie.nrl.navy.mil
From: bart@cs.wisc.edu (Bart Miller)
Newsgroups: fj.mail-lists.parallel
Subject: New release of the IPS par prog measurement tools
Date: 10 Sep 92 12:55:09 GMT
Distribution: fj


	        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
From: bob@tera.com (Bob Alverson)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Terra Computers
Date: 9 Sep 92 17:37:36 GMT
Distribution: fj

Here is a bibliography of articles on the Tera system.

Bob


%
% $Id: terabib.bib,v 1.2 1992/08/13 15:44:43 bob Exp $
%
@InProceedings{exploit,
	Author={G. Alverson, R. Alverson, D. Callahan, B. Koblenz, 
			A. Porterfield,  and B. Smith},
	Title={Exploiting Heterogeneous Parallelism on a
		Multithreaded Multiprocessor},
	BookTitle={Proceedings of the 6th ACM International Conference on
		Supercomputing},
	Location={Washington, D.C. USA},
	Month={July},
	Year={1992}
}


@ToAppear{longexploit,
	Author={G. Alverson, R. Alverson, D. Callahan, B. Koblenz, 
			A. Porterfield,  and B. Smith},
	Title={Integrated Support for Heterogeneous Parallelism},
	Proposed BookTitle={Multithreading: A Summary of the State of the Art},
	Pages={  },
	Editor={Bob Iannucci},
	Publisher={Kluwer},
	Address={  },
	Year={  }
}

@InCollection{CaSm:Futures,
	Author={D. Callahan and B. Smith},	
	Title={A Future-based Parallel Language For a General-purpose
		Highly-parallel Computer},
	BookTitle={Languages and Compilers for Parallel Computing},
	Pages={95-113},
	Editor={D. Gelernter, A. Nicolau and D. Padua},
	Publisher={The MIT Press},
	Address={Cambridge, Massachusetts},
	Year={1990}}

@InProceedings{AlCa:Tera,
	Author={R. Alverson, D. Callahan, D. Cummings, B. Koblenz,
		A. Porterfield and B. Smith},
	Title={The Tera Computer System},
	BookTitle={International Conference on Supercomputing},
	Pages={1-6},
	Month=Jun,
	Year={1990}}

@InProceedings{CaKo:Tera,
	Author={D. Callahan and B. Koblenz},
	Title={Register Allocation via Hierarchical Graph Coloring},
	BookTitle={Proceedings of the ACM SIGPLAN '91 Conference on
		Programming Language Design and Implementation},
	Pages={192-203},
	Month=Jun,
	Year={1991}}

@InProceedings{Alve:Tera,
	Author={R. Alverson},
	Title={Integer Division Using Reciprocals},
	BookTitle={10th IEEE Symposium on Computer Arithmetic},
	Pages={186-190},
	Month=Jun,
	Year={1991}}
From: karent@quip.eecs.umich.edu (Karen A. Tomko)
Newsgroups: fj.mail-lists.parallel
Subject: Scientific programs with conflicting memory strides
Date: 15 Sep 92 17:29:00 GMT
Distribution: fj

*WANTED* 

Scientific Fortran Programs to optimize 

I am looking for programs with conflicting memory
strides to verify an automatic restructuring tool.

For example:
	
	do i = 1, N/k
	   ... = A(i) ... A(k*i)
	enddo

	Where the array A has stride 1 and stride k (small integer)
	accesses within the same loop nest.


	or

	real A2(3,N), A1(3*N)
	equivalence  (A2(1,1), A1(1))
	   .
	   .
	   .
 
	do i = 1, N
	   ... = A2(2,i) ... A1(i)  
	enddo                                

	Were the data of arrays A2 and A1 is accessed with a stride of
	3 and a stride of 1.

If you have programs which have loops similar to the ones above and
can give me an electronic copy of your source file please send email.

I have been working on techniques for optimizing these types of accesses
for shared memory multiprocessors and am looking for some 'real' examples.
	
Karen Tomko
karent@eecs.umich.edu
University of Michigan
From: suttner@Informatik.TU-Muenchen.DE (Christian Suttner)
Newsgroups: fj.mail-lists.parallel
Subject: Looking for K.S. Natarajan
Date: 4 Sep 92 17:42:52 GMT
Distribution: fj

I'm looking for                    K.S. Natarajan
how at least in 1989 worked at     IBM T.J.Watson Research Center

Does anyone know his current email-address?
                                   
Thanks for any help,

Christian

  +-------------------------------+------------------------------------------+
  | Christian B. Suttner          |                                          |
  | TU Muenchen                   |                                          |
  | Institut fuer Informatik      | EMAIL: suttner@informatik.tu-muenchen.de |
  | Augustenstr. 46, RGB 2.Stock  | PHONE: +49-89-521098                     |
  | D-8000 Muenchen 2, Germany    | FAX  : +49-89-526502                     |
  +-------------------------------+------------------------------------------+
From: kielmann@isa.informatik.th-darmstadt.de (Thilo Kielmann)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Glossary of Parallel Computing Terms
Date: 15 Sep 92 15:19:04 GMT
Distribution: fj

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
From: maniattb@cs.rpi.edu (Bill Maniatty)
Newsgroups: fj.mail-lists.parallel
Subject: Gordon Bell Award
Date: 11 Sep 92 19:37:38 GMT
Distribution: fj


	Just how does one apply for the Gordon Bell Award (deadlines, location,
other issues)?

Bill
-- 
|
|	maniattb@cs.rpi.edu - in real life Bill Maniatty
From: ghosh@CS.YALE.EDU (Bhaskar Ghosh)
Newsgroups: fj.mail-lists.parallel
Subject: Conrad and Agarwal, ICPP 92
Date: 7 Sep 92 12:18:42 GMT
Distribution: fj

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
===============================================================================
From: tomh@cybernet.cse.fau.edu (Tom Holroyd)
Newsgroups: fj.mail-lists.parallel
Subject: Systems of Differential Equations
Date: 9 Sep 92 12:23:51 GMT
Distribution: fj

Yo.  I'm a beginner, with a (large) system of ODE's and a Maspar (SIMD).
Is there some standard way of integrating systems of equations on
such architectures?

Tom Holroyd
Center for Complex Systems and Brain Sciences
Florida Atlantic University, Boca Raton, FL
tomh@bambi.ccs.fau.edu
From: parallel@netcom.com (B. Mitchell Loebel)
Newsgroups: fj.mail-lists.parallel
Subject: The PARALLEL Processing Connection
Date: 11 Sep 92 12:19:36 GMT
Distribution: fj

September 14, 1992 - Meeting notice -- The PARALLEL Processing 
Connection

MasPar - Supercomputing With a SIMD Architecture

The high performance computing world is becoming increasingly focused 
on MIMD based machines;  MasPar believes that the "MIMD hysteria" has 
clouded the real problem, delivering application performance. Their VP of 
Technology and Architecture, Tom Blank, will discuss the applications 
which best utilize the MasPar autonomous SIMD architecture. Tom is 
uniquely qualified to do this; it is our understanding that he was the prime 
developer of the architecture. Too, this will be the first public presentation 
of their new I/O system which provides solid state disk, I/O buffering and a 
shared extended memory with transfer rates up to 1GB/sec. As usual, we 
will explore third party opportunities for our members with MasPar. And 
we will want to know if they are targeting industrial and commercial 
customers for their machine.

The meeting will take place at 7:30PM 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.

Please be prompt; as usual, we expect a large attendance; don't be left out or 
left standing. There is a $8 fee for non-members and members are admitted 
free.

-- 
B. Mitchell Loebel                                      parallel@netcom.COM
PARALLEL Processing Connection                                 408-732-9869
From: melin@hlrz24.hlrz.kfa-juelich.de (Stephan Melin)
Newsgroups: fj.mail-lists.parallel
Subject: Multiple threads in C* on a CM2
Date: 10 Sep 92 12:54:26 GMT
Distribution: fj

While doing the main calculation on the CM2, I'd like to do some of the 
postprocessing of the results on the frontend (which is a Sun). Is there 
a way to programm multiple threads (the C* compiler doesn't seem to like
Sun's lwp library header files...) ?

So if someone has a suggestion or a pointer where to look, please email.

Many thanks in advance

-- 
Stephan Melin

melin@hlrsun.hlrz.kfa-juelich.de   ||    hkf418@djukfa11.bitnet
From: idm@koala.mel.dit.CSIRO.AU (Ian Mathieson)
Newsgroups: fj.mail-lists.parallel
Subject: Distributed memory programming courses
Date: 9 Sep 92 12:24:19 GMT
Distribution: fj

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
From: charlie@cse.ucsc.edu (Charlie McDowell)
Newsgroups: fj.mail-lists.parallel
Subject: synchronization event traces
Date: 11 Sep 92 19:37:40 GMT
Distribution: fj

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
From: bh@nissen.asd.sgi.com (Bent Hagemark)
Newsgroups: fj.mail-lists.parallel
Subject: Re: sgi/sun shared memory machines question
Date: 14 Sep 92 12:30:41 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.

Someone told you very wrong.  All processors peruse the run queue.
Any process runs on any processor unless you explicitly assign
a process to a processor and/or restrict a processor to run only
certain processes.

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

Simultaneous writes from different threads of a parallized process
are not prevented.  (Threads are known to the kernel and each
has its own pid, kernel supported stack, etc).  Harware spinlocks
are avaliable to user-level programs directly or through a couple
of different MP programming interfaces to provide serialization
if that's desired.

Bent
From: kondrup@iesd.auc.dk (Keld Kondrup Jensen)
Newsgroups: fj.mail-lists.parallel
Subject: Linda Semantics.
Date: 10 Sep 92 12:55:20 GMT
Distribution: fj

Hi there,

For those Interested in Linda Semantics, I Paolo Ciancarini, myself and
Dany Yankelevich have recently completed the paper

  "The Semantics of a Parallel Language based on a Shared Data Space"

which studies Linda Semantics using respectively SOS, CCS, Petri Nets,
and the CHAM.  I have made a compressed version of the postscript file
for the paper available as anonymous ftp from

	iesd.auc.dk	in the directory 	Linda/shsem.ps.Z

Comments on the paper is welcome.

\Keld.

PS.  As for now the paper is a Technical report from Pisa
(TR 26/92, Dipartimento di Informatica, University of Pisa).

--
 Keld Kondrup Jensen:            Department of Computer Science          /
 --------------------            Aalborg University,                .__//|
 e-mail: kondrup@iesd.auc.dk     Frederik Bajers Vej 7             /   / (
 phone: (+45) 98 15 85 22        DK 9220 Aalborg {\O}, Denmark    A   U   C
From: greg@dworkin.wustl.edu (Gregory D. Peterson)
Newsgroups: fj.mail-lists.parallel
Subject: INFO Request: Delta/Paragon performance
Date: 7 Sep 92 12:17:50 GMT
Distribution: fj

Hi there!  I have been trying to get information on the
Delta and Paragon, but have not been terribly successful yet.
I need to know the data rate for communications, latency,
clock rate, performance measures (Mips, etc.) and other
relevant info.  Of particular interest is the ratio of
the compute speed to communications speed.  Thanks in advance
for the help - I'll summarize the results as appropriate.

greg


--
Greg Peterson
Computer and Communications Research Center   
Campus Box 1115, Washington University                                 
1 Brookings Drive  Box 1115
From: l249114@godzilla (Ken Van de Houten)
Newsgroups: fj.mail-lists.parallel
Subject: Determining physical nodes on Intel iPSC
Date: 9 Sep 92 17:37:36 GMT
Distribution: fj

Here's a C routine that works for me :


/*
  Return physical node number
*/

#include <sys/types.h>
#include <nxinfo.h>

int physnode_()
{
	return(nxinfo.physnode);
}