HDTenEightyP/NetNews huggingface dataset:
From: grega@verdix.com (Greg Alonso)
Newsgroups: fj.mail-lists.x-window
Subject: set uid bit for xterm?
Date: 23 Jul 92 03:51:53 GMT
Distribution: fj
Organization: Verdix Corp.

Date: Wed, 22 Jul 1992 13:50:44 GMT
Message-Id: <1992Jul22.135044.16457@verdix.com>
Newsgroups: comp.windows.x

In my installation of X, xterm has the uid bit set with root as owner:
-rwsr-xr-x  1 root       188416 Aug  2  1990 /usr/bin/X11/xterm*

If that is the case, why can I delete an xterm process after it is
spawned?  Isn't it owned by root when it is running?


-- 
..........................................................
. Gregory Alonso                 EMail grega@verdix.com  .
. Verdix Corporation             Voice (703)318-5834     .
. 250 Van Buren St.              Fax   (703)318-9304     .
From: d8ahlcr@dtek.chalmers.se (Christopher Ahlberg)
Newsgroups: fj.mail-lists.x-window
Subject: Bitmap in DrawnButton problem on color screen
Date: 29 Jul 92 13:13:15 GMT
Distribution: fj
Organization: Chalmers University of Technology, Gothenburg Sweden

Date: 29 Jul 92 09:55:07 GMT
Message-Id: <13014@chalmers.se>
Newsgroups: comp.windows.x

I'm writing a problem that has several DrawnButtons which are placed in
a drawing area. Into these buttons are bitmaps loaded. This works alright on a
black & white screen, but when running in color the program crashes. Anyone
knows why?

	/Christopher
d8ahlcr@dtek.chalmers.se
--
Christopher Ahlberg		       Chalmers University of Technology
email: d8ahlcr@dtek.chalmers.se	       School of Computer Science & Engineering
				       G|teborg, Sweden
From: mirek@unixg.ubc.ca (Miroslaw Piaseczny)
Newsgroups: fj.mail-lists.x-window
Subject: Local Bus X386 configuration - help needed
Date: 30 Jul 92 03:59:47 GMT
Distribution: fj
Organization: University of British Columbia, Vancouver, B.C., Canada

Date: Wed, 29 Jul 1992 18:17:34 GMT
Message-Id: <1992Jul29.181734.11024@unixg.ubc.ca>
Newsgroups: comp.windows.x

Has anyone successfully completed the X386 installation    
for local bus video card? 

I have GA-200 Local Bus ET4000 card (1MB) installed on 50MHz 486,
and Aamazing monitor (Horizontal: 31.5/35KHz,
                      Vertical 60/70 Hz (31.5KHz)
                               56/87 Hz (35KHz).

My problem seems to be in finding the correct clock timings. 
The DOS utility program (dmode.com) shows the following:
       50 57 65 72 80 90 101 130

However, when I run clock.exe, for some reason I get different numbers.
What's even worse, each clock.exe run shows different readings.

I've tried some of them to get the horizontal and vertical timings, 
but couldn't get it right.
 
Any ideas?

Thanks in advance

Mirek Piaseczny
University of British Columbia
mirek@unixg.ubc.ca
From: gbol@rglnext.geol.vt.edu (Gregory Lampshire)
Newsgroups: fj.mail-lists.x-window
Subject: RTF text widget
Date: 23 Jul 92 08:32:59 GMT
Distribution: fj
Organization: Workstation Div., Supermicro Systems Group, Sony Corporation

Date: 22 Jul 92 17:46:17 GMT
Message-Id: <5046@vtserf.cc.vt.edu>
Newsgroups: comp.windows.x




I haven't seen any mention of an RTF text widget, I was wondering if  
someone has a pointer to an RTF text widget or if it is a component in  
another program.  I would appreciate any response on this.


I am only looking for public domain type widgets.



--
Gregory Lampshire 
Virginia Tech 
Bradley Department of Electrical Engineering
gbol@rglnext.geol.vt.edu (NeXTmail welcome)
------------------------
My opinions are my very own and do not reflect the opinions of any  
employer
From: MSD109@psuvm.psu.edu
Newsgroups: fj.mail-lists.parallel
Subject: Parallel Block-Tridiagonal solver
Date: 28 Jul 92 12:01:55 GMT
Distribution: fj

I'm looking for a parallel block-tridiagonal solver and was wondering
if there are any out there available. Or atleast some references
describing some. Preferably simple references.
   i need it for a machine such as the Intel iPSC or for a local
network running PVM.
  thanks. I'm sorry if this is a FAQ.

   -- manish (manish@arthur.psu.edu)
From: maffeis@ifi.unizh.ch (Silvano Maffeis)
Newsgroups: fj.mail-lists.parallel
Subject: bibliography: distr. systems and replication
Date: 24 Jul 92 11:54:49 GMT
Distribution: fj

Find my bibliography (about 100 items) on distributed systems and 
object-replication on

claude.ifi.unizh.ch: pub/bib/{distrsys.bib,distrsys.ps.Z}

enjoy!


-- 
Silvano Maffeis    CS Dept. University of Zurich, Switzerland
  RFC822: maffeis@ifi.unizh.ch          voice: +411 257 43 27
  X.400:   C=CH; ADMD=ARCOM; PRMD=SWITCH; O=UNIZH; S=MAFFEIS;
From: ahmad@delta.ee.ufl.edu (Ahmad Ansari)
Newsgroups: fj.mail-lists.parallel
Subject: Simulator for MIMD Architecture
Date: 27 Jul 92 14:09:50 GMT
Distribution: fj

I am looking for a public domain simulator for a MIMD
machine which runs on Spark or PC platforms. I would
greatly appreciate any information on this.

thanks
ahmad ansari
From: matt@waikato.ac.nz
Newsgroups: fj.mail-lists.parallel
Subject: More on CSP PDs or PS's
Date: 21 Jul 92 14:35:37 GMT
Distribution: fj

There seems to be some confusion about my last posting.  Several people
have responded by pointing out that CSP is not a programming language, but
is used for specifying or verifying algorithms.  I am interested in a
form of static checking of parallel programs, and for generality I am 
developing my ideas using CSP so that hopefully any parallel program written
in a language which uses principles outlined in CSP could be checked using my 
methods.  
  If there are nontrivial process descriptions or program specifications
written in CSP out there, I would like to know about them and how to obtain
them so I could test my ideas.


Matt
From: ian@MasPar.COM (Ian L. Kaplan)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Description of C*
Date: 27 Jul 92 14:10:01 GMT
Distribution: fj

>Peter "R.Hoare" <peteh@cs.rhbnc.ac.uk> writes:
>Could anybody tell me where I can get a good reference to the new
>version of C* which is being proposed as a ANSI standard parallel C.

  To avoid any misunderstanding I would like to emphasize that C* is
just one input to the ANSI parallel C standardization process.  A
number of companies and individuals, including Thinking Machines and
MasPar, are involved in the process.  C* will be an important
influence, but it is by no means a "defacto standard".

                           Ian Kaplan
			   ian@maspar.com
From: angela@prosun.first.gmd.de (Angela Sodan)
Newsgroups: fj.mail-lists.parallel
Subject: Performance Tools
Date: 21 Jul 92 14:35:46 GMT
Distribution: fj

Hello,

we are currently looking for tools visualizing the performance behaviour of
parallel programs. We are parallelizing Lisp for the Manna architecture
(distributed memory, i860 processor). Our current simulation environment
is a SUN or a SUN net, respectively. So the tool should run on SUN with X.
At the moment we only want to visualize data from traces and simulations
(simulation is also still to be written). Later, however, there will be the
need for visualizing real data from runs on the Manna computer. The operating
system group also needs visualization, so we would prefer a more general
solution than just being able to visualize our Lisp output. (Our operating
system PEACE is written in C++, and our Lisp system has a C interface.)

One tool which we have considered is ParaGraph. It seems us to be quite nice
but is limited to 16 nodes. In addition we will try the Topsys system from
the Technical University of Munich. Within an article of Kathleen Nichols in
IEEE Software, 1990, I found descriptions of Simple/Care and of Axe (for DEC
only?) which seemed me to be quite interesting. Does anyone know where I can
get more information about Simple/Care and where I can get the software?
(it is announced to be public domain) Has anyone experience with it?

I am also interested in information about any other performance visualization
tools which might be appropriate for our purposes.

Please send answers to angela@prosun.first.gmd.de. If I get sufficient
feedback, I will post a summary.

Thanks in advance for your help, Angela


-- 
----------------------------------------------------------------------------
Angela Sodan                              angela@first.gmd.de
GMD Adlershof                             ...!uunet!unido!gmdtub!angela
Rudower Chaussee 5
From: narad@nonsequitur.Eng.Sun.COM ([Doing 6 Impossible Things before breakfast])
Newsgroups: fj.mail-lists.parallel
Subject: Sun job contacts
Date: 21 Jul 92 14:35:09 GMT
Distribution: fj

In an earlier message (which I thought I was posting directly to a sender, not to the
whole news group) I accidentally broadcast the names of some hardware managers
at Sun as job contacts.  This was inadvertent (hey, I've only been using Unix systems for
10 years!).  If you are interested in employment at Sun, *please* contact Sun's HR department
through the usual channels.  The phone number for the switchboard is 415-960-1300.

Abject apologies to the managers involved :-)

chuck/
From: rvdg@cs.utexas.edu (Robert van de Geijn)
Newsgroups: fj.mail-lists.parallel
Subject: Broadcasting on Hypercubes
Date: 21 Jul 92 14:35:24 GMT
Distribution: fj

I recently developed a broadcast routine for the iPSC/860
that is considerable faster than the library call to
csend with destination -1, at least for very large vectors.

While I am still working on the report, and I am not willing
to disclose the algorithm at this time, I am willing to
make the object code available to whoever needs it in a
hurry.

A time complexity shows that the algorithm is faster that
a minimum spanning tree broadcast (which is used by csend)
by a factor   (p log p) / (2 (p-1) ) (asymptotically).

Here are some timings on the ORNL iPSC/860:
(n= # of bytes, p= # of nodes, times in seconds)

p=64
     n    new      csend-1
     =    ===      =======
     0  0.00020    0.00022
     1  0.00021    0.00022
    10  0.00022    0.00024
   100  0.00041    0.00041
   500  0.00210    0.00188
  1000  0.00263    0.00295
  5000  0.00645    0.01163
 10000  0.01021    0.02250
 50000  0.04000    0.10796
100000  0.07391    0.21513

p=32
     0  0.00017    0.00018
     1  0.00018    0.00018
    10  0.00019    0.00020
   100  0.00034    0.00034
   500  0.00163    0.00155
  1000  0.00239    0.00245
  5000  0.00622    0.00960
 10000  0.00926    0.01854
 50000  0.03779    0.08996
100000  0.07202    0.17925

The object file can be obtained via anonymous ftp
from cs.utexas.edu, directory pub/rvdg/gcast.
In this directory, there is a README file that
explains the calling sequence.

===========================
ftp cs.utexas.edu
Name: anonymous
Password: anything
cd pub/rvdg/gcast
bin
get rvdg_gcast.o
get README
===========================

you may want to look at some of the postscript files
in pub/rvdg as well.

Those who send a message to rvdg@cs.utexas.edu will
be kept up to date on further developments wrt this
and other communication algorithms.

We are working on a broadcast for the Intel Touchstone
Delta as well, based on the same principles.

PLEASE, don't send messages asking for further details.

Robert van de Geijn
Assistant Professor
The University of Texas at Austin
rvdg@cs.utexas.edu
From: grendel@fen.arc.nasa.gov (Raymond E. Suorsa)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 23 Jul 92 17:49:56 GMT
Distribution: fj

In article <1992Jul23.134928.5014@hubcap.clemson.edu>, lycmit@x1sun6.ccl.itri.org.tw (Yin-Chih Lin) writes:

|> I am curious, if I connect 32 SPARCstation 10 model 30 (33MHz, SuperSPARC
|> module with 86.1 MIPS - Sun Micro adverted!?) computers (loosely-coupled
|> MIMD multicomputers?) either by Ethernet, ISDN or FDDI with the multi-
|> thread OS and might use facilities from Linda-like distributed data
|> structures. Is it possible for me to obtain the reasonable performance
|> when compared with the 32-node TMC CM5 (SIMD machine)?
|> 
more stuff

I have use a network of SparcStation2's as a loosely-coupled MIMD
machine.  My application (obstacle detection and ranging using machine
vision for guidance applications) would saturate the ethernet with 6
to 8 machines (32 nodes just would slow it down).  If your application
doesn't need much or any internode communication AND it needs A LOT of
computation time than a network of 32 Sparc10s would give good
performance.  As soon as the computation time nears the data transport
time (which happens pretty fast with ethernet) the network will
saturate.

The price of a TMC CM5 is in its fat tree network... which is very
fast compared to ethernet, or FDDI.


  __o   Ray Suorsa,
  \<,   grendel@windchime.arc.nasa.gov,
()/ ()  NASA/Ames (415)604-6334
From: peter@palin.cc.monash.edu.au (Peter Hawkins)
Newsgroups: fj.mail-lists.parallel
Subject: Re: HELP - software needed to run MIMD like programs on an IBM PC
Date: 31 Jul 92 12:00:35 GMT
Distribution: fj

Andrew.Stratton@cm.cf.ac.uk (Andrew F Stratton) writes:

>	I have recently purchased a 486/33, and would like to run a MIMD
>simulator to allow me to develop some code for Meiko and nCUBE 2.  I am
>not worried about timings - just the ability to somehow communicate between
>different virtual processors.  This would allow me to work on algorithms at
>home.



You could use parallaxis (freeware @ ftp.informatik.uni-stuttgart.de
in /pub/parallaxis) - you will need to buy a manual for ($20???) )

Peter
From: ravi@photonics.usc.edu (Ravi)
Newsgroups: fj.mail-lists.parallel
Subject: EXPRESS on SUN-SPARC 2
Date: 27 Jul 92 14:11:06 GMT
Distribution: fj

Hello,
I would like to receive the user's experience in using EXPRESS 
(from PARASOFT) software for Sun Workstations connected to Transputers.
Since the cost is quite high (compared to compilers etc.), I am curious
to receive some inputs from the actual users before bying them.
Please help.
I would appreciate if you could send me the mail to the following
address. 
                   ravi@photonics.usc.edu
Thanks in advance.
RAVI
From: ajay@hadar.cs.buffalo.edu (Ajay Shekhawat)
Newsgroups: fj.mail-lists.parallel
Subject: Deskside MP ?
Date: 22 Jul 92 13:46:07 GMT
Distribution: fj

Has anyone heard of a "Deskside MP", called ZEPHYR, by a company called
WaveTracer ? (I may have the names wrong...)
Any info would be appreciated.

Ajay S.

ajay@cs.Buffalo.EDU
From: dirk@rummelplatz.uni-mannheim.de (Wenzel)
Newsgroups: fj.mail-lists.parallel
Subject: Literature: Virtual Shared Memory
Date: 22 Jul 92 15:32:31 GMT
Distribution: fj

I'm interested in literature about Virtual Shared Memory.
Could someone give me some hints on actual papers, books on this field.

Thanks in advance,

	Dirk.
From: lukose@cm.deakin.OZ.AU (Dickson Lukose)
Newsgroups: fj.mail-lists.parallel
Subject: Seeking info on Prolog running on transputers
Date: 31 Jul 92 12:00:42 GMT
Distribution: fj

I am looking for a version of Prolog that runs on transputers.

If you know af any, could you please email.

Any pointers will be most appreciated.

Dickson Lukose
Deakin University

lukose@deakin.oz.au
From: tyzec@sun.pcl.ac.uk (Andy Macfarlane)
Newsgroups: fj.mail-lists.parallel
Subject: TEXT RETRIEVAL IN PARALLEL
Date: 27 Jul 92 14:11:43 GMT
Distribution: fj

TEXT RETRIEVAL IN PARALLEL

	I would be grateful if anyone can send me the following

i) Details of any books, publications, articles etc on text retrieval
in parallel (if possible using occam).

ii) Details of regular expressions in parallel (as i). ).

iii) Any algoritms for i) & ii).

Andrew MacFarlane
3rd year BSC computer science 
pcl (soon to be university of westminster!)
From: sean@sparcy.hhmi (Sean Smith)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Distributed Data Bases
Date: 22 Jul 92 15:32:22 GMT
Distribution: fj


	The most familiar distributed database system I know of are
the products of Teradata (now owned by NCR). Teradata machines consist
of a number of Intel processors linked in a proprietary "Dynamic Y-Net"
scheme. The best literature on the Teradata is in last months CACM.

	Note: the Teradata machine is specifically a Relational-Database
machine, using SQL.

	The above information is not much, but the number of articles I
have on the machine are not present. Companies using Teradata's include 
Citicorp and AT&T.

	One aquaintance who may be of more useful information is
Aurea Andino, former manager of the Teradata Project at Citicorp. She
can be reached via internet at 
	73700.1636@compuserve.com.

	Unfortunaetly I am not familiar with other architectures, so any infor	mation will be welcome.

					Good Luck
						Sean Smith
						sean@adamsgw.bio.sunysb.edu
From: mmh@cs.qmw.ac.uk (Matthew Huntbach)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Literature on prarallel LP
Date: 22 Jul 92 13:46:13 GMT
Distribution: fj

From: oliver@adt.uni-paderborn.de (Oliver Jack)
>Could someone point me at a survey of prarallel Logic Programming,
>or could someone give me some hints on actual papers, books on this field.
>I'm also interested in literature about *testing* parallel Logic Programs,
>regardless of the model used (AND, OR parallelism, GHC etc.).

E.Shapiro "The Family of Concurrent Logic Programming Languages"
in ACM Computing Surveys 21,3, Sep. 1989.

The only problem with this paper and others I could suggest is
that they tend to make parallel logic programming look a lot
more complex than it actually is since they concentrate on
pointing out the differences between the various suggested
parallel logic languages which in many cases are fairly trivial
when it comes to actually programming in them.

Matthew Huntbach
From: grendel@fen.arc.nasa.gov (Raymond E. Suorsa)
Newsgroups: fj.mail-lists.parallel
Subject: Task allocation for multiprocessors
Date: 23 Jul 92 13:50:36 GMT
Distribution: fj

Hello,

I have a little problem some of you should be able to help me with.

I am working with a computer vision problem domain which may be
divided into M independent tasks with each task requiring a variable
amount of time T_i, where the total problem is solved in T seconds of
processor time:

T=sum_{i=1}^M T_i

The optimal allocation of these tasks onto a N processor machine,
where M > N, is an NP-complete problem.

There are several ways to do a good allocation by first sorting the
set of M tasks, and assigning the longest running tasks first.  This
helps reduce the balancing errors as the end of the sorted list is
approached.

I have found many papers concerning task allocation using graph
methods.  I am looking for a simpler treatment closer to this problem
type.  (i.e. What is the Best Choice for M given N and the minimum and
maximum expected T_i.)

Thanks,

  __o   Ray Suorsa,
  \<,   grendel@windchime.arc.nasa.gov,
()/ ()  NASA/Ames (415)604-6334
From: henrik@mpci.llnl.gov (Henrik Klagges)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 23 Jul 92 20:42:34 GMT
Distribution: fj

grendel@fen.arc.nasa.gov (Raymond E. Suorsa) writes:
>The price of a TMC CM5 is in its fat tree network... which is very
>fast compared to ethernet, or FDDI.

Is it a fat tree network ?


--

Cheers, Henrik
MPCI at LLNL
IBM Research
From: steele@vlsi.cs.caltech.edu (Craig Steele)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Literature: Virtual Shared Memory
Date: 23 Jul 92 13:50:25 GMT
Distribution: fj

A survey article is Nitzberg and Lo, IEEE Computer, August 1991.


Craig Steele, steele@vlsi.caltech.edu
From: rzthlb@tuhhco.rz.tu-harburg.de (Lutz Behnke)
Newsgroups: fj.mail-lists.parallel
Subject: Yellow Pages and PVM on a Silicon
Date: 29 Jul 92 11:53:35 GMT
Distribution: fj

To all wiz Programmers out there:

has anybody done a adaption of PVM in order to use Yellow Pages-password Handling
instead of the original Unix getpwent(uid) used in main.c

I am currently trying to install PVM on a subnet of Silicons and one of hp/ux's
both of them use YP to make SysAd easier

I would apreceate a C-Source Interface to the Yellow Pages greately, but
would also be happy with a trick to get by YP without a code change.

Thanks for any upcoming mail.

PS If you thing this doesn't belong here flame me (privately)
PSS please excuse any spelling a/o grammar mistakes

----
lutz 


-- 
| Lutz Behnke | behnke@tu-harburg.dbp.de | (Germany) 040 / 630 39 38 |
|  TU Hamburg Harburg, Hamburg, Germany, Europe, Earth, Sol-System   |
|----------When the Evil Spirit armed the Tiger with claws,----------|
|----------------Brahma gave wings to the Dove-----------------------|
From: primeaux@alphard.cs.utk.edu (David Primeaux)
Newsgroups: fj.mail-lists.parallel
Subject: Anyone tried prof on intel RX
Date: 27 Jul 92 14:10:25 GMT
Distribution: fj

I am trying to identify bottlenecks in some code
written for the intel RX hypercube.  I thought that
using prof might be a good idea, but I am only
able to generate an uninteresting profile of what
happens on the host.  Does anyone have any suggestions?
From: neal@grover.stat.washington.edu (Phil Neal)
Newsgroups: fj.mail-lists.parallel
Subject: Re: looking for PVM
Date: 21 Jul 92 20:40:46 GMT
Distribution: fj

ROBIN !! YOUR MAIL BOUNCED SO HERE IS THE MESSAGE OVER THE NET

To: robin@fractal.ireq-num
Subject: Re: looking for PVM
Newsgroups: comp.parallel
Organization: Helping Hand Acceptance Corporation
Cc: 

Robin,
PVM stands for Parallel Virtual Machine and it 
is available by:

        ftp research.att.com

and is found in directory /netlib/pvm

Bonne chance,
Phil


Phil Neal, Systems Programmer, Statistics Department GN-22
University of Washington, Seattle, Wa. 98195 USA  | 206-685-1627
----------------------------------------------------------------
"I won't play second fiddle to the beat of your honky tonk
heart"


-- 
Phil Neal, Systems Programmer, Statistics Department GN-22
University of Washington, Seattle, Wa. 98195 USA  | 206-685-1627
----------------------------------------------------------------
"I won't play second fiddle to the beat of your honky tonk heart"
From: lycmit@x1sun6.ccl.itri.org.tw (Yin-Chih Lin)
Newsgroups: fj.mail-lists.parallel
Subject: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 23 Jul 92 13:50:03 GMT
Distribution: fj

Greetings:

We have many Sun's SPARCstations (from 1, 1+, IPC, to 2, 670MP and 
SPARCstation 10 in the near future), and the new-version multi-thread
OS (SunOS 5.0) will be installed on these computers.

I find that the Think Machines Corp.'s latest MPP machine CM-5 is also
adopted the SPARC processors (22 MIPS per processor) as its nodes.
According the "Parallel Processing" Oct. 1991 issue, the price of 32-node
CM5 model will sell at about $1.4 million.

I am curious, if I connect 32 SPARCstation 10 model 30 (33MHz, SuperSPARC
module with 86.1 MIPS - Sun Micro adverted!?) computers (loosely-coupled
MIMD multicomputers?) either by Ethernet, ISDN or FDDI with the multi-
thread OS and might use facilities from Linda-like distributed data
structures. Is it possible for me to obtain the reasonable performance
when compared with the 32-node TMC CM5 (SIMD machine)?

I will be highly appreciated for receiving any comments. Please direct
your opinion (or abuse) to me by email. so the news bandwidth won't be
wasted (except this one!).

Thanks,

P.S. I would also like to know, is there any one config their SPARCstations
to a message-passing MIMD multicomputers rather than just merely LAN-
based networking workstations?

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Yin-Chih Lin                            Industrial Technology Research
email: lycmit@x1sun6.ccl.itri.org.tw    Institute  (ITRI)
phone: 886-35-917331
fax:   886-35-917503                    Computer & Comm. Research Labs.(CCL)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
From: alleyne@MasPar.COM (Brian D. Alleyne)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Could I compete the low-end CM5 with multiple SPARCstations?
Date: 31 Jul 92 03:26:51 GMT
Distribution: fj

In article <1992Jul23.204237.4492@hubcap.clemson.edu> henrik@mpci.llnl.gov (Henrik Klagges) writes:
>
>grendel@fen.arc.nasa.gov (Raymond E. Suorsa) writes:
>>The price of a TMC CM5 is in its fat tree network... which is very
>>fast compared to ethernet, or FDDI.
>
>Is it a fat tree network ?

Depends what YOU call a fat tree. And what you call a node. 

Brian