HDTenEightyP/NetNews huggingface dataset:
From: maniattb@cs.rpi.edu (Bill Maniatty)
Subject: Gordon Bell Award
Apparently-To: comp-parallel@cis.ohio-state.edu
Organization: Clemson University
Date: Fri, 11 Sep 1992 18:44:28 GMT


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

Bill
-- 
|
|	maniattb@cs.rpi.edu - in real life Bill Maniatty
Newsgroups: comp.parallel
From: tu@bert.eecs.uic.edu (Shengru Tu)
Subject: C* books or references wanted
Apparently-To: comp-parallel@ux1.cso.uiuc.edu
Summary: suggestion wanted
Keywords: C*
Organization: University of Illinois at Chicago
Date: Mon, 7 Sep 1992 23:25:31 GMT

For those who know C and Ada tasking, what is the good book to learn C*?

Forgive me if this is a FAQ.  Thanx.

-shengru


Newsgroups: comp.parallel
From: parallel@netcom.com (B. Mitchell Loebel)
Subject: The PARALLEL Processing Connection
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Distribution: usa
Date: Fri, 11 Sep 92 07:36:16 GMT

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

Newsgroups: comp.parallel
From: kondrup@iesd.auc.dk (Keld Kondrup Jensen)
Subject: Linda Semantics.
Apparently-To: comp-parallel@uunet.uu.net
Organization: Mathematics and Computer Science, Aalborg University
Date: 10 Sep 92 12:21:31

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

Newsgroups: comp.parallel
From: cap@ifi.unizh.ch (Clemens Cap)
Subject: Parallel Programming Platform
Organization: University of Zurich, Department of Computer Science
Date: Wed, 9 Sep 92 12:46:21 GMT

Recently on this group there was a discussion about the advantages
and disadvantages of parallel programming platforms and concepts
like p4, PVM and LINDA. 

We want to draw the attention of this group to a similar approach
called <The Parform> and developed at the University of Zurich.
It is a parallel proramming model based on message passing and presently
implemented in a network of UNIX workstations. Efficient ports to
multiprocessor systems are planned for the near future. In principle
it may be compared to p4 and PVM, but The Parform has a number of 
interesting advantages:

  ** Heterogeneous prepartitioning of tasks
  ** Dynamic load balancing
  ** Very fast startup
  ** Direct and fast message transfer without demon activities
     and message copying
  ** Flexible and fast startup and shutdown procedures
  ** Support for heterogeneous architectures
  ** SPMD programming model

At claude.ifi.unizh.ch you can retrieve /pub/techreports/ifi-92.07.ps.Z
a technical report describing the new features and speedups of an 
early version of The Parform. A more detailed report on the application
and user interface of the present version will be available soon.  

For more information read the mentioned technical report or contact
cap@ifi.unizh.ch.
-- 
* Dr. Clemens H. CAP               cap@ifi.unizh.ch        
* Dept. of Computer Science        Phone +(1) 257-4326  (office)
* University of Zurich             Phone +(1) 322 02 19  (home)
* Winterthurerstr. 190             Fax   +(1) 363 00 35

Newsgroups: comp.parallel
From: melin@hlrz24.hlrz.kfa-juelich.de (Stephan Melin)
Subject: Multiple threads in C* on a CM2
Keywords: CM2, C*, Multiple Threads
Organization: Forschungszentrum Juelich GmbH (KFA), Germany
Date: 9 Sep 92 17:59:38 GMT


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

Newsgroups: comp.parallel
From: kue@bau20.cad-bau.uni-hannover.de (Friedhelm Kueck)
Subject: PVM on SCO-Unix
Apparently-To: hypercube@hubcap.clemson.edu
Organization: RRZN
Date: Mon, 7 Sep 1992 13:28:29 GMT

Hello dear comp.parallel-readers!

We in our Institute at the University of Hannover try to build up a PVM-
Machine in an heterogenous environment of unix-workstations. We also have
a 386-PC under SCO-Unix integrated in our network. But here we have problems
to start the pvmd. Has anyone made experiences with the pvmd under SCO-Unix?

I would be glad to read something in my mailbox or in the newsgroup!

bye
F.Kueck
--
________________________________________________________________________________
    Institut fuer Stroemungsmechanik und Elektronisches Rechnen im Bauwesen
                           Universitaet Hannover
           Friedhelm Kueck                       kue@hp1.erib.uni-hannover.de        

Newsgroups: comp.parallel
From: av2@ukc.ac.uk (A.Varshneya)
Subject: Re: Synchonizing watches
Reply-To: av2@ukc.ac.uk (A.Varshneya)
Organization: Computing Lab, University of Kent at Canterbury, UK.
Date: 5 Sep 92 08:56:57 GMT


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

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

>Michael Nelson

Atul

Newsgroups: comp.parallel
From: l249114@godzilla (Ken Van de Houten)
Subject: Determining physical nodes on Intel iPSC
Organization: Clemson University
Date: Wed, 9 Sep 92 09:26:25 PDT


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);
}

Newsgroups: comp.parallel
From: cyliao@iastate.edu (Chun-Yao Liao)
Subject: nCUBE biginner needs advice...
Apparently-To: comp-parallel@beaver.cs.washington.edu
Organization: Iowa State University, Ames, IA
Date: Thu, 10 Sep 1992 15:38:30 GMT
Return-Path: <news@news.iastate.edu>

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

Many thanks!


-- 
Chun-Yao Liao              |\   |  __ \  /-----                 -------------
cyliao@iastate.edu         | \  | /  \ \/   | A Milano      ------------
Department of EE and CprE  |  \ ||---- /\   |  Dreamer  ---------
Iowa State University      |   \| \__ /  \  |Mail OK, I have MailService.

Newsgroups: comp.parallel
From: bart@cs.wisc.edu (Bart Miller)
Subject: CORRECTION! IPS tools info
Apparently-To: uunet!comp-parallel
Organization: University of Wisconsin, Madison -- Computer Sciences Dept.
Date: Thu, 10 Sep 1992 19:26:57 GMT

In the previous post, I incorrectly specified where you could get further
info on the IPS tools.

The CORRECT host name is: grilled.cs.wisc.edu.

Sorry for the confusion.

Newsgroups: comp.parallel
From: bob@tera.com (Bob Alverson)
Subject: Re: Terra Computers
Apparently-To: comp-parallel@beaver.cs.washington.edu
Reply-To: bob@tera.com
Organization: Tera Computer Company, Seattle, WA
Date: Wed, 9 Sep 1992 15:14:31 GMT

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: kondrup@iesd.auc.dk (Keld Kondrup Jensen)
Newsgroups: comp.parallel
Subject: Re: Linda Semantics.
Date: 11 Sep 92 18:57:58 GMT
Organization: Mathematics and Computer Science, Aalborg University
Apparently-To: comp-parallel@uunet.uu.net

Hi there,

Concerning the paper "The Semantics of a Parallel Language based on a
Shared Data Space" announced as available for anonymous ftp from
iesd.auc.dk in the directory Linda/shsem.ps.Z: I forgot to give read
permissions to the Linda directory---the error should be corrected by
now.  Sorry for the inconvenience.

Keld.
--
 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
Newsgroups: comp.parallel
From: anurag@cc.gatech.edu (Anurag Gupta)
Subject: Re:Synchronizing watches
Organization: Clemson University
Date: Mon, 7 Sep 92 15:44:18 EDT

>Mike 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
>
>A:
>1. says "Bong"
>2. waits, say N minutes (N > ABBA)
>3. says "Bong" again
>
>B already knows what N is, and can then determine
>What AB is (Bong2 - Bong1 - N)
>
>B tells A what AB time is.
>
>A says "Bang" and waits AB time before zeroing
>the watch
>
>When B hears "Bang", B immediately zero's the watch
>
>synchronized
>
>Michael Nelson

The flaw is this: *Both* Bong2 and Bong1 will be delayed by AB and so
Bong2 - Bong1 - N will be zero and not AB.

Anurag Gupta

Newsgroups: comp.parallel
From: "(Mark BOGSTAD)" <bogstad@imhfhp16.epfl.ch>
Subject: Wanted: Red-black point relaxation solver on par. machine
Organization: Ecole Polytechnique Federale de Lausanne
Date: Thu, 10 Sep 1992 08:51:51 +0200


Hi 
I'm looking for an efficient red-black point relaxation (also known
as checkerboard pattern) algorithm for solving systems of equations
iteratively on a parallel machine. I'm running on a SIMD type machine.

Any ideas would be welcome...

Mark Chr. Bogstad
email: bogstad@dme.epfl.ch

 



Newsgroups: comp.parallel
From: karent@quip.eecs.umich.edu (Karen A. Tomko)
Subject: Scientific programs with conflicting memory strides 
Apparently-To: comp-parallel@archive.cis.ohio-state.edu
Organization: University of Michigan EECS Dept., Ann Arbor, MI
Date: Tue, 15 Sep 1992 17:02:08 GMT

*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

Newsgroups: comp.parallel
From: bernardl@cs.Stanford.EDU (Bernard Lee)
Subject: Re: Fujitsu Unvells Ultra High Speed Supercomputer
Organization: CS Dept, Stanford University, CA 94305, USA
Date: Tue, 15 Sep 92 04:23:31 GMT


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

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

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

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

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

 ---Steve
Newsgroups: comp.parallel
From: bernardl@cs.Stanford.EDU (Bernard Lee)
Subject: Re: Fujitsu Unvells Ultra High Speed Supercomputer
Organization: Computer Science Dept, Stanford University, CA 94305, USA
Date: Sun, 13 Sep 92 01:28:27 GMT

|> Clifford Chen <cliffc@fujitsu.fai.com> writes:
[Text Deleted]

Most of us probably won't mind reading a concise technical
summary but I would view this as a marketing post.  Perhaps 
the moderator should make a point to emphasize the basic 
rules for commercial activies on Internet.  

[The position of this moderator, and most of the other moderators of technical
 groups, is that news releases which indicate availablility of products is
 acceptable news for the group. I do not allow blatant advertising---indeed,
 I not too gently steer it offline. Fuijitsu is a major player, so the release
 is news.
=========================== MODERATOR ==============================
Steve Stevenson                            fpst@hubcap.clemson.edu
Administrative address                     steve@hubcap.clemson.edu
Department of Computer Science,            comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell
Newsgroups: comp.parallel
From: tomh@cybernet.cse.fau.edu (Tom Holroyd)
Subject: Systems of Differential Equations
Apparently-To: uunet!comp-parallel
Organization: Cybernet BBS, Boca Raton, Florida
Date: Tue, 8 Sep 1992 17:42:55 GMT

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

Newsgroups: comp.parallel
From: ananth@knife.cs.umn.edu (Ananth Grama)
Subject: References on parallel Simplex.
Apparently-To: comp-parallel@uunet.uu.net
Summary: Looking for references on parallel formulations of the simplex algorithm.
Keywords: simplex, references
Organization: AHPCRC, University of Minnesota, Minneapolis
Date: Thu, 10 Sep 1992 05:14:23 GMT

Hello all !

Would the enlightened care to share some of their wisdom and
mail me any references (the more recent the better) on parallel
formulations of the simplex algorithm and simplex with
integer solutions (?)..

Thanks in anticipation to all those who respond !

Ananth.
Army High Perf. Comp. Res. Ctr., Minneapolis.
(ananth@s1.arc.umn.edu)
From: primeaux@wham-o.cs.utk.edu (David Primeaux)
Newsgroups: comp.parallel
Subject: using both picl and ipd
Date: 15 Sep 92 17:17:26 GMT
Reply-To: primeaux@wham-o.cs.utk.edu (David Primeaux)
Organization: University of Tennessee, Knoxville - Department of Computer Science

I have code for ipsc/860 which is crashing ("Segmentation violation, data
address D04458B4 at 000017E4").

The code is *not* hostless and 
Newsgroups: comp.parallel
From: kaminsky-david@CS.YALE.EDU (David Kaminsky)
Subject: Re: Parallel Programming Platform
Apparently-To: comp-parallel@uunet.uu.net
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
Date: Thu, 10 Sep 1992 21:13:59 GMT

I'd just like to note (as is noted in Cap's paper) that the
performance data for "Linda" given in the <Parform> paper are actually
data for POSYBL (a public domain version of Linda).

As a result, these times almost certainly do not reflect the
performance achievable with optimized implementations of Linda like those
developed by Yale and SCA.

	Also in the paper:

"The bottleneck of LINDA in a distributed environment
is the concept of tuple space, especially the necessary
scanning operations to find tuples of certain format".

	Much of the Linda tuple matching is done at compile
time (see Nick Carriero's Thesis, Yale University).  "Scanning"
is not necessary.  In addition, modern network Linda systems
distribute tuple space eliminating the bottleneck.

David

Newsgroups: comp.parallel
From: magnus@solaris.astro.uu.se (Magnus Selhammar)
Subject: Re: parallel search
X-Char-Esc: 38
X-Charset: ASCII
Organization: Astronomiska Observatiet i Uppsala
Date: 13 Sep 1992 12:43:01 GMT

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


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

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

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

Magnus Selhammar


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

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


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

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

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

Magnus Selhammar




Newsgroups: comp.parallel