HDTenEightyP/NetNews huggingface dataset:
From: hatay@spot.Colorado.EDU (Ferhat F. Hatay)
Subject: Conjugate Gradient on CM-2 
Keywords: CM-Fortran, Conjugate Gradient, Poisson, Helmholtz ..
Organization: University of Colorado, Boulder
Date: Thu, 16 Apr 1992 23:58:34 GMT

It can be too much to ask, but, I am in the need for a conjugate 
gradient method optimized for CM-2. If I have a choice
I prefer to have it in CM-fortran. I will be solving 
successive Helmholtz and Poisson equation with it. any 
sort of pointers to nice places will be appreciated.

ferhat
-- 
Ferhat F. Hatay                        || Disclamer: |||||||||||||||||
Aerospace Engineering Sciences         || I speak for myself unless || 
University of Colorado, Boulder        || otherwise indicated.      ||
e-mail: hatay@spot.colorado.edu        |||||||||||||||||||||||||||||||

Newsgroups: comp.parallel
From: hong@huanghe.unl.edu (Hong Jiang)
Subject: Phone Numbers of Vendors
Apparently-To: comp-parallel@uunet.uu.net
Summary: Info. on commercial machines
Keywords: Commercial Parallel Machines
Organization: University of Nebraska - Lincoln
Date:  5 Apr 92 19:49:16 GMT

Hi there,
	I am looking for information regarding commercial parallel machines (SIMD
and MIMD). In particular, I'd like to know the current price range (for a given 
configuration) and processing power (however vague it may sound, again, per given 
configuration) of all major commercial parallel machines on today's market.
	I'd appreciate it tremendously if somebody out there could furnish me with
the above information OR the PHONE NUMBERS of RESPECTIVE VENDORS.

	Please send your reply via email to:

	jiang@cse.unl.edu or hong@huanghe.unl.edu

	Thank you very much in advance!


Hong Jiang, Ph.D
Dept of CS&E
Univ. of Nebraska-Lincoln  (402)472-6747 (O)

Newsgroups: comp.parallel
From: rminnich@super.super.org (Ronald G Minnich)
Subject: Re: Atomic read/writes to memory in SMMs
Apparently-To: uunet!comp-parallel
Organization: Supercomputing Research Center (Bowie, MD)
Date: Sat, 4 Apr 1992 04:14:56 GMT

In article <1992Apr1.165233.12597@hubcap.clemson.edu> kweber@mcs.kent.edu (Ken Weber) writes:
>What percentage (roughly) of 32 bit Shared Memory Multiprocessors allow
>atomic load/store operations for 16 & 32 bit data?  For example, the
>Sequent Balance and Symmetry systems allow this.  Is it true for the
>majority of such systems?

I assume you mean atomic read-modify-write (RMW)?

Balance did not. I.e. the RMW instructions of the 320xx were not 
atomic RMW over the bus. There is a warning to this effect in one 
of the Sequent manuals. Instead there was an atomic 
lock memory. I am told this
was due to a bug (not surprising) in the 32032. 

Memory tells me that Burroughs did/does on all its multiprocessors, as
does IBM. 

Actually most of the multiprocessors that have shared memory that I can 
recall support atomic RMW. Of course, this will fail for the new
architectures such as Alpha. Getting an understanding of the memory model of
that system is proving to be a little confusing, if interesting.
ron

Newsgroups: comp.parallel
From: freeman-elisabeth@CS.YALE.EDU (Elisabeth Freeman)
Subject: CM5 studies
Apparently-To: comp-parallel@uunet.uu.net
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
Date: Sat, 11 Apr 1992 16:47:10 GMT


I am doing an architecture project this semester on the CM5.  I would like
to find out if anyone has run any benchmarks or done any kind of performance 
studies on the CM5.

Please send email to: freeman-elisabeth@cs.yale.edu

Thanks,

Beth Freeman


Xref: sparky comp.parallel:1295 comp.programming:897
From: priol@irisa.fr (Thierry Priol)
Newsgroups: comp.parallel,comp.programming
Subject: Re: Raytracing on a CM
Date: 16 Apr 92 09:39:39 GMT
Organization: IRISA, Rennes (Fr)


You may find some works on parallelizing the ray-tracing algorithm
on a connection machine in the following references:

@InProceedings(CROW88, 
        Author="F.C. Crow and G. Demos and J. Hardy and J. McLaughlin and K. Sims",
        Key="parallel",
        Title="3D Image Synthesis On the Connection Machine",
        Organization="University of Leeds,UK",
        BookTitle="Parallel Processing for Computer Vision and Display",
        Month="January",
        Year="1988")

@InProceedings(delany88,
        Author="H.C. Delany",
        Title="Ray Tracing On A Connection Machine",
        Address="Saint-Malo (France)",
        booktitle="1988 International Conference on Supercomputing",
        pages="659-667",
        month="June",
        year="1988")  

@TechReport(delany88,
        Author="H.C. Delany",
        Title="A Simple Hierarchical Ray Tracing Program for the Connection Machine System",
        Institution="TMC",
	number="VZ88-4"
        month="December",
        year="1988")  

@InProceedings(williams88,
        Author="N.S. Wiiliams, B.F. Buxton and H. Buxton"
        Title="Distributed Ray Tracing Using an SIMD processor Array",
        booktitle="NATO ASI Series, Vol F40, Theoretical Foundations of Computer Graphics and CAD"
        pages="703-725",
        year="1988")  


After reading these papers, one may ask the question "is SIMD architectures
is well suited for realistic image rendering algorithms ?". It's a
open question. I have an answer, but too much subjective! I worked
on parallel raytracing algorithms on MIMD architectures...

Thierry

-- 
Thierry PRIOL                                Phone:  99 84 72 10
IRISA / INRIA U.R. Rennes                    Fax:    99 38 38 32
Campus Universitaire de Beaulieu             Telex:  UNIRISA 950 473F
35042 RENNES CEDEX - FRANCE                  E-mail: priol@irisa.fr
Newsgroups: comp.parallel,comp.theory
From: rthomson@dsd.es.com (Rich Thomson)
Subject: Re: Raytracing on a CM
Apparently-To: uunet!comp-parallel
Reply-To: rthomson@dsd.es.com (Rich Thomson)
Organization: Design Systems Division, Evans & Sutherland, SLC, UT
Date: Mon, 13 Apr 92 21:17:55 GMT

>In article <1992Apr6.152259.21385@hubcap.clemson.edu>
	MXD120@psuvm.psu.edu (Beaker) writes:
>>I have a friend who has access to a Connection Machine and we were
>>thinking of compiling a raytracer on it (DKB or Rayshade) to create
>>frames for animation.  I know that the code has to be optimized to
>>run on a parallel machine, but I'm not sure how to do this.

The Rayshade implementation has a parallel port based on Linda-C.  I'm
not sure how well this would port to a CM, though.

>>Has anybody out there done this?

There has been much research done on implementing a
distributed/parallel ray tracer.  Check the graphics literature for
the words "parallel" and "distributed".  Somewhere there was a
parallel graphics bibliography available on the net (I can't remember
where) and about 90% of the work was on distributing a ray-tracer.

In article <1992Apr13.181859.4155@hubcap.clemson.edu>
	pelegrin@geocub.greco-prog.fr (Francois PELLEGRINI) writes:
>	Argh! The CM-2 is a SIMD machine. It implies that all processors must
>do the same thing at the same time. As the ray trees will be quite different
>from one pixel to another, (not even speaking of texture and shadow rays
>computation), you will be in BIG trouble.

Not necessarily.  Careful reorganization of the algorithms may let you
take advantage of the CM-2.  Of course, this is just off the top of my
head and not a statement based on a careful analysis of how well this
problem maps to the CM architecture.

							-- Rich
-- 
	Repeal the personal income tax; vote Libertarian in 1992.
Disclaimer: I speak for myself, except as noted; Copyright 1992 Rich Thomson
UUCP: ...!uunet!dsd.es.com!rthomson			Rich Thomson
Internet: rthomson@dsd.es.com	IRC: _Rich_		PEXt Programmer
From: vu0208@bingvaxu.cc.binghamton.edu (!)
Newsgroups: comp.parallel
Subject: Re: Fast window summation on a SIMD machine
Date: 15 Apr 92 20:14:56 GMT
Article-I.D.: hubcap.1992Apr16.122046.11614
Organization: State University of New York at Binghamton
Apparently-To: uunet!comp-parallel


In article <1992Apr14.180225.182521@cs.cmu.edu> you write:
>    I am looking for an idea for a high-performance algorithm for
>    the following problem:
>
>	I have a large SIMD machine (maspar) with an image distributed
>	across the 2-dimensional array of processors.  Each processor has
>	a small (8*8), square piece of the image.  I want to produce a new
>	image in which the new pixels represent the sum, in the original
>	image, of a large (64*64) window around that pixel.  
>
>	Currently, I copy the large window of pixels onto each processor from
>	the surrounding processors and then perform an efficient window
>	summation algorithm without having to do any further communication.
>	This is very inefficient because each processor is duplicating many
>	of the additions of its neighbors.
>
>	Any ideas?  Pointers to published references?
>
>    Thanks!
>    Bill Ross
>    br@cs.cmu.edu 
>

correct me if i am wrong in understanding your problem!

if each square below represents a 8*8 pixel contained in a processor,



       (a)
-------------------------------
| | | |8|8|8| | | | | | | | | |
-------------------------------
| | | |8|x|8| | | | | | | | | |
-------------------------------
| | | |8|8|8| | | | | | | | | |
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8| 
------------------------------- 
| | | | | | | |8|8|8|8|8|8|8|8| 
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------  (b)
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------
| | | | | | | |8|8|8|8|8|8|8|8|
-------------------------------


what you want to do is generate a new image pixel 'x', which is sum of
pixels labeles '8' above...in (a) is that right? i don't understand 64*64
size, which means 8x8 squares in the above diagram (b)! Are you condesing
the image that big into a 8x8 pixel ?

The replication in additions can be avoided if you partition the large
windows such that they don't overlap, and then finding the sum of a
window will generate a new image completely independent of the cells
outside the large window (assuming large window = 64x64 sq.pixels).

If you need algorithm on that i can work on it....

Please let me know if my understanding of the problem is correct, is
it (a) or (b) that you are doing?
From: the_shadow@desire.wright.edu
Newsgroups: comp.parallel
Subject: Hooking 386 to 486 and back ....
Date: 15 Apr 92 08:49:23 GMT
Organization: Wright State University

I have a dilemma I hope someone out there in News-land can help me with...

My boss wants to connect my 386 with a 486 and share the same information back
and forth...speedily. I know I can use a null modem cable and comm software to 
do this but I have heard about a program that enables you to actually access 
the hard drive or floppy drive of the other machine as if it were your own. 
This would be ideal for me.  Does anyone have first hand knowledge of Desklink 
or Carbon Copy software packages?

Because my configuration is so complex, I'm not even sure if it will do what I 
need it to do.  My LasterMaster controller card does not use the Windows print 
manager and takes over the whole CPU while it prints, I tried a buffer in the
past and it didn't work any faster. I guess what I'm asking is:

Will one of these programs enable me control the printer with one PC while
keeping the other free to do work?  If not, what can I use? Will I have to go 
to a full blown Network (someone recommended Lantastic...any users of this 
set up out there?)...I'm sooooo confused. I have no knowledge of networks so 
if I can get off easy with a little software package and a null modem cord...I 
will be happy.  If not...I NEED HELP!!!!

Thanks...

Lynne

    ::Singing:: I'm dreaming of a zero wait state...




Anyone have any ideas???? 

email:   The_Shadow@desire.wright.edu
Newsgroups: comp.parallel
From: tjebelea@risc.uni-linz.ac.at (Tudor Jebelean)
Subject: systolic hardware?
Apparently-To: comp-parallel@news.uu.net
Reply-To: tjebelea@risc.uni-linz.ac.at (Tudor Jebelean)
Organization: RISC, J.K. University of Linz, Austria
Date: Fri, 10 Apr 1992 20:30:57 GMT


My institute (RISC - Linz) is planning to buy some hardware based
on the cellular automata and/or systolic approach.

Can somebody help me with some hints on how to find information
about such devices available on the market?

Are there people which have already used such devices and who would
help me with a [short] description of their experience?

Thank you very much,

Tudor Jebelean            Phone: Austria-7236-3231-20
RISC - Linz,              Fax:   Austria-7236-3338-30
A-4040 Linz, Austria      E-mail: tjebelea@risc.uni-linz.ac.at













Newsgroups: comp.parallel,comp.arch
From: samsung!ulowell!cpsacs.cps.msu.edu!jaya@uunet.UU.NET (Jayashree Ramanathan)
Subject: Multiprocessors {Request for references]
Apparently-To: ulowell!uunet!comp-parallel
Originator: jaya@cpsacs.cps.msu.edu
Organization: Department of Computer Science, Michigan State University
Date: Wed, 15 Apr 92 02:14:39 GMT

I am interested in obtaining papers/reports on the most recently
introduced multiprocessors (shared-memory, distributed-memory, small-scale,
large-scale). Please respond by e-mail and I will summarize if there
is sufficient interest.

Regards,
Jayashree
--
Jayashree Ramanathan		 		| jaya@cpsacs.cps.msu.edu
Grad Asst., Dept. of Computer Science	 	| jaya@msuegr.BITNET
Michigan State University, East Lansing MI48824	| uunet!frith!jaya

Newsgroups: comp.parallel
From: AGUI@MDRVM3.VNET.IBM.COM (Juan C. Agui)
Newsgroups: comp.parallel
Subject: Re: Physical Computers with certain Architectures
Date: 6 Apr 92 23:05:41 GMT
Organization: Clemson University

Commenting about the least popular of the architectures you
mention, I have been using for the last year a Telmat/32, in a
Perfect-Shuffle arrangement.

The Telmat/32 is a 32 T-800 machine based on the Supernode Architecture
coming out of a ESPRITE project funded by the EEC. Being reconfigurable
a whole collection of diferent architectures can be implemented,
such as grids, 3Dcubes (also cycle-connected), shuffles, rings, etc... .

This Perfect Shuffle arrangement, which I later found to be
the DeBruijn network, is found to be very powerful, for distributed
fft computation, matrix xposal, etc... .

Juan C. Agui
IBM Spain  ...and...
U. Polit)cnica de Madrid.
Newsgroups: comp.parallel
From: edwin@CS.UCLA.EDU (Edwin Tisdale)
Subject: Public Domain CFD solver for the CM2?
Apparently-To: comp-parallel@uunet.uu.net
Originator: edwin@maui.cs.ucla.edu
Keywords: Connection Machine Computational Fluid Dynamics
Organization: UCLA Computer Science Department
Date: Fri, 17 Apr 92 04:51:34 GMT

A surgeon specializing in cranial aneurysms here at the UCLA Medical Center 
would like to simulate and visualize blood flow through cranial aneurysms.
Can anyone tell me where I can find a public domain CFD solver for our CM2?
Please send all replies directly to edwin@cs.ucla.edu
I will summarize and post them if there is sufficient interest.
Thanks in advance,	E. Robert Tisdale
			Computer Science Department
			3680F Boelter Hall
			University of California
			Los Angeles, California 90024
			(310) 825-2266
From: kweber@Snake.mcs.kent.edu (Ken Weber)
Newsgroups: comp.parallel
Subject: Re: Atomic read/writes to memory in SMMs
Date: 6 Apr 92 16:11:20 GMT
Organization: Kent State University
Apparently-To: comp-parallel@uunet.uu.net

In article <1992Apr6.152327.21611@hubcap.clemson.edu> rminnich@super.super.org (Ronald G Minnich) writes:
>
>I assume you mean atomic read-modify-write (RMW)?
>

What I am referring to is the ability for a 32-bit value to be either written
or read atomically from a memory location.  I could envision the situation
where a read/write may work with only 16 bits of a value at a time.  This
could lead to the following situation:

Process 1 writes to low 16 bits of location A
Process 2 writes to low 16 bits of location A
Process 2 writes to high 16 bits of location A
Process 1 writes to high 16 bits of location A

Thus in location A we have the low bits from process 2 and the high bits
from process 1.  

I am wondering on how many machines I need to lock the memory (using atomic
test-and-set) when I do a 32-bit read/write?  Further, is even a 16-bit
read/write always safe?  (I assume without proof that a 1-byte read/write is
safe.)

Ken Weber Dept. of Math & Comp. Sci. KSU, Kent, OH 44242

P.S.  Thanks for your input, Ron
From: fineberg@eng.uiowa.edu (Sam Fineberg)
Newsgroups: comp.parallel
Subject: PARAFRASE
Date: 15 Apr 92 14:36:09 GMT
Distribution: na
Organization: Department of Elect. and Comp. Engr., University of Iowa, USA.
Originator: fineberg@hitchcock


I would like some information on a package called PARAFRASE.  My
understanding is that it does some static code analysis for automatic
parallelization,  What I am most interested in is what information does it
gather that could be used for further code restructuring.  For example,
dopes it provide a data-dependence graph.  Also, how does one obtain the
package, i.e., is it available via anonymous FTP or is it only available 
commercially from Kuck and Associates.


Thanks,
Sam Fineberg
-- 
Samuel A. Fineberg                 Department of Elect. and Comp. Engr.
fineberg@eng.uiowa.edu             University of Iowa
Voice: (319)335-5962               Iowa City, IA  52242, USA
FAX: (319)335-6028
Newsgroups: comp.robotics
From: yking@cs.ubc.ca (Yossarian Yggy King)
Subject: Laser range finder schematics
Reply-To: bandari@cs.ubc.ca
Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
Date: Mon, 13 Apr 92 23:49:05 GMT


Hi folks,
	Does anybody know where I can get, beg, borrow, or steal (i.e.
ftp), or even pay for the schematics of an AM (amplitude modulated) or
FM (frequency modulated) time of flight laser range finder?  Any
references or help would be appreciated.
Many thanks.
--
Y. King		|	"Printed in Canada by union labour on
yking@cs.ubc.ca	|	 recycled, recycleable paper."
UBC, Canada	|	-- the NDP covering their bases on a mailout
From: 900196v@ace.acadiau.ca (RONNIE VANDOMMELEN)
Newsgroups: comp.robotics
Subject: mc68hc11evb,first time,more help please
Date: 10 Apr 92 22:36:02 GMT
Organization: Acadia University

A short while ago I wrote the newsgroup asking about the MC68HC11EVB board 
to build a small roving vehicle/robot. The response was great and I thank 
you all but now I have another question.

Some of you briefly mentioned prices. In my magazines I have the following 
prices: CP-11, Allen Systems, $250 and RTC-HC11, Micromint, $240-270. The 
prices you indicated were less than these. I was hoping I could get some 
more detailed info on prices and addresses for a complete board containing 
an MC68HC11EVB with all the input /output /digital converter stuff or some 
such thing. (I'm not sure if this adds any difficulty but I do live in 
Canada.)

Finally, For whoever asked me to forward letters to them, I will hopefully 
get to that soon. Sorry but there's not enough time in the day.

Thanks again for before and now in advance.
From: pic@mlb.dmt.csiro.au (Peter Corke)
Newsgroups: comp.robotics
Subject: Re: Details of Unimate Puma servo systems - FTP problems
Date: 10 Apr 92 02:56:31 GMT
Organization: CSIRO Division of Manufacturing Technology, Melbourne, Australia

Well my first attempt at making stuff available via anon ftp screwed up
badly.  We've fixed the problem, and I tested it from a few non-local machines
and all seems to be well.

Apologies to all.  Enjoy...

		Peter
-- 
Peter Corke,                           PHONE: +61 3 487-9259
Senior Research Scientist              INTERNET: pic@mlb.dmt.csiro.au
CSIRO Div. Manufacturing Technology    ACSNET or CSNET:pic@mimir.dmt.oz.au
Locked Bag 9, Preston, Australia. 3072 
Newsgroups: comp.robotics
From: kempga@NeXTwork.Rose-Hulman.Edu (Greg Kemp)
Subject: Re: Questions about Tracked Robot Vehicles
Reply-To: kempga@NeXTwork.Rose-Hulman.Edu
Organization: Rose-Hulman Institute of Technology
Date: Thu, 9 Apr 1992 14:49:34 GMT

In article <1992Apr9.131650.7721@sctc.com> smith@sctc.com (Rick Smith)  
writes:
> feng@srvr1 (Liqiang Feng, ) writes:
> >In other words, is dead reckoning still a feasible option for 
> >navigation?                       ^^^^^^
> 
> I didn't think dead reckoning had _ever_ been a feasible option for
> navigation. I had the impression that even oceangoing vehicles only
> used it as a method for choosing which continent they arrived at.
> 
> Rick.
> smith@sctc.com          arden hills, minnesota

Some early ballistic missiles (robotic aircraft?) used a form of dead  
reckoning to guide them to their target (they called it "inertial  
guidance" to snow the defense dept.).  It's a really lousy method, as you  
pointed out, but nuclear missiles weren't graded for accuracy in those  
days either.

--
Greg Kemp
inmate, Rose-Hulman Institute of Technology
Terre Haute, IN
Internet: kempga@nextwork.rose-hulman.edu
From: reznik@tao.cs.wisc.edu (Dan S. Reznik)
Newsgroups: comp.robotics
Subject: Conchoid of Nichomedes
Date: 8 Apr 92 23:23:50 GMT
Organization: University of Wisconsin, Madison -- Computer Sciences Dept.

I have hit a brick wall trying to solve a problem that at first seemed like
simple 2-D geometry. I was wondering if some of you could help.

The problem is associated with moving a straight robot link within
its "sensing envelope" while in contact with an obstacle. I shall explain
it purely gemoetrically though.

I have a segment of finite length L with endpoints P (its tip) and B
(its base) whose coords are known.

Within this segment I define a point Q whose coordinates are known and
*fixed*.

I start "dragging" point P (the tip of the segment) along a straight line
of known direction (call it the pull line), with the constraint
that during such a continuous motion, the segment is always passing through
point Q.

FACT: the locus of B due to the motion of P is a curve of fourth
degree called the conchoid of Nichomedes (if anybody disagrees please let
me know).

QUESTION 1: How much should P move along the pull line if the LENGTH OF
	    THE LOCUS of B (i.e., the integral over the conchoid) is to be
	    exactly equal to some pre-defined constant, say SMAX ???

QUESTION 2: How much should P move along the pull line if the DISTANCE
	    BETWEEN B before and after the straight motion of P
	    (i.e., a chord within the conchoid) is to be exactly equal to
	    some pre-defined constant, say SMAX ???

For question 1, I have been able to come up with a non-integrable
expression and for question 2 I came up with a system of two equations
of 4th degree. In the least, "ugly" ! Any help is to be greatly appreciated.

Dan Reznik
Robotics Research
UW-Madison