HDTenEightyP/NetNews huggingface dataset:
From: jinsoo@snucom.snu.ac.kr (Kim JinSoo)
Subject: Re: OO in Parallel Computing
Organization: Clemson University
Date: Mon, 23 Nov 92 10:31:26 EST
X-Mailer: ELM [version 2.3 PL2]

> A friend is interested in learning about Object Oriented techniques
> on parallel computers.  Please post or email references.  Brief descriptions
> of on-going work is also of interest.

  I am also interested in Object-orientedness on parallel computers.
If you have any reply, please forward to me or post summary on comp.parallel
Thanks in advance.

  Best regards,

	Jinsoo.


------------------------------------------------------------------------------
    Jinsoo Kim
    Dept. of Computer Engineering,         Phone:  +82-2-880-7299
    Seoul National University,	     	   Fax:    +82-2-886-7589
    Seoul 151-742,  KOREA.		   E-mail: jinsoo@snucom.snu.ac.kr
------------------------------------------------------------------------------


Newsgroups: comp.parallel
From: harv@cis.ksu.edu (Harvard Townsend)
Subject: Wanted: Systems based on TI TMS320C40
Organization: Kansas State University, Dept. of Computing and Information Sciences
Date: 23 Nov 1992 17:39:44 GMT

One of our faculty would like information on any commercial systems based
on the Texas Instruments TMS320C40 processor. He needs at least 64 nodes
and desires a Sun SPARCstation interface in order to test different
software reconfiguration algorithms. Any pointers would be helpful, esp.
addresses and/or phone numbers.
-- 
Harvard Townsend, Kansas State University Dept. of CIS
Internet: harv@cis.ksu.edu    UUCP: rutgers!depot!harv

Newsgroups: comp.parallel
From: cpr4k@holmes.acc.Virginia.EDU (Christian P. Roberts)
Subject: Re: CM-2 Performance?
Organization: Academic Computing Center - U.Va.
Date: Thu, 19 Nov 1992 15:15:04 GMT

In article <1992Nov18.130500.26154@hubcap.clemson.edu>, shiraz!ian@ohm.york.ac.uk (I Stephenson) writes:
|> I've been doing some development work on a CM-2. I've got my software to work  
|> fine, but am unsure as to how efficient my impementation is, compared to other  
|> platforms I've run it on.
|> 
|> The problem is that all the performance figures I've seen for the CM are in  
|> GFlops. This is all very well but my code is stricly integer. Given that the  
|> CM-2 has dedicated FP units, this tells me very little about the performance I  
|> should be expecting.
|> 
|> Has anyone got a MIPS rating for the machine, produced using integer code? I  
|> appreciate the limitations of such a metric, but it may give me a rough idea of  
|> whether I'm getting things about right, or missing by a mile! Any other  
|> comments as to the integer performance would be appreciated.
|>

I tried to email, but it bounced:

Please post a summary of information.  I am not using the CM-2 for integer
work, but I work with clients who do.  I would appreciate information about
this analysis of performance that I could pass on to them.

-- 

Chris Roberts                     ITC/Academic Computing Center
cpr4k@virginia.edu                University of Virginia           
(804) 982-4693                    Charlottesville, Virginia 22903

Newsgroups: comp.parallel
From: christos@bohemia.cs.colorado.edu (Christos Triantafillou)
Subject: Re: PVM & HeNCE
Organization: University of Colorado at Boulder
Date: Wed, 18 Nov 1992 03:41:13 GMT

In article <1992Nov16.164435.19568@murdoch.acc.Virginia.EDU> cpr4k@holmes.acc.Virginia.EDU (Christian P. Roberts) writes:
>
>Are you referring to the Intel hypercube here?  Do you mean that
>you are trying to run a hypercube program, where the Intel machine
>is a node in PVM?  Then are you asking whether or not you can have
>communication between the nodes on the hypercube (which I would 
>presume you still would be able to do), or whether you can have
>communication between a node of the hypercube and another PVM
>node, for example, a Cray?
>

I am talking about using PVM routines to snd/rcv messages
between the nodes on the hypercube, and it turns out, after all
the respones I have received, that this is not possible, at least
with versions 2.3-2.4.

However, PVM is still useful for running parallel programs
in a network of workstations and for exchanging data in a
heterogeneous environment.


--- Christos


Newsgroups: comp.parallel
From: rsaripa@bach.cs.clemson.edu (Saripalli Ramakrishna)
Subject: TCP/IP on Intel's IPSC/2 ?.
Apparently-To: comp-parallel@uunet.uu.net
Organization: Clemson University Computer Science Dept.
Distribution: na
Date: Fri, 20 Nov 1992 07:25:58 GMT

Hi there,

	
	I would like to know how I can have sockets on Intel's IPSC/2 16-node parallel system.

	I have an application which is as follows:-


	I have more than one GA(genetic algorithm) running one on each node.
	All of them send their results to the host which ships off the results to a SUN workstation.

	
	Now I would like to use TCP/IP or UDP(whichever is present) to open a socket and send off the data.

	A process running on this SUN would then output these results in a graphical form using X.


	My problem is though I have all the manuals that describe this,I am not able to find the library with which I have to link my application.
	In IPSC/2 socket calls are library calls rather than system calls.


	Wouls some kind soul tell me what is the name of the library,if it is present and if it is not,is there any other way to do sockets?.


	The Intel IPSC/2 runs NX operating system,a variant of UNIX.


	I need this info very urgently and I cannot proceed without this info.


						thanks in advance
						Saripalli Ramakrishna
	

e-mail : rsaripa@cs.clemson.edu

An example illustrating the compilation would be very helpful.
Man is a beast and usually has no control over his passions.

Newsgroups: comp.parallel
From: Ian Heavens <ian@spider.co.uk>
Subject: Support for readers/writer locks in operating systems
Apparently-To: comp-parallel@uunet.uu.net
Organization: Spider Systems Limited, Edinburgh, UK
Date: Fri, 20 Nov 1992 10:54:27 GMT

I'm interested in the algorithms used to provide readers/writer synchronisation
in SMP operating systems such as SVR4/MP, SunOS 5.0, Mach etc.

Both SVR4/MP and SunOS 5.0 provide primitives to allow concurrent reads and exclusive
writes for a shared resource.  How are these implemented on 80x86s, SPARC etc?  Does
Mach provide them?

ian

---
	 Ian Heavens			ian@spider.co.uk                 
 	 Spider Software
 	 Spider Park, Stanwell Street		
	 Edinburgh, EH6 5NG, Scotland	+44 31 555 5166 (Ext 4347)
--

Newsgroups: comp.parallel
From: "Dennis Gannon" <gannon@moose.cs.indiana.edu>
Subject: Computational Science Position at Indiana
Apparently-To: hypercube@hubcap.clemson.edu
Organization: Computer Science, Indiana University
Date: Sun, 15 Nov 1992 21:57:05 -0500


           Position in Computational Science
            Indiana University, Bloomington

Indiana University is expanding its program in Computational
Science and invites applications for a faculty position in
the program. We are particularly interested in applicants
with an interdisciplinary orientation in computational
science and a background in Astronomy, Chemistry, Computer
Science, Mathematics or Physics. Applicants with other
backgrounds who can make a strong contribution to this
interdisciplinary program will also be considered. The
position is tenure-track in one of the above departments
(depending on background) and teaching and the development
of a vigorous research program in this department is
expected.

Of particular interest are those candidates with experience
in supercomputing and massively parallel systems.
 
Applicants should send a curriculum vitae, publication list,
documentation of teaching experience and accomplishments, a
one page statement of research goals, and the names of three
references. Applications should be sent to: The
Computational Sciences Program, Office of the Dean of Arts
and Sciences, Indiana University, Bloomington, IN 47405.
Indiana University is an equal opportunity employer.

Informal contacts by email to gannon@cs.indiana.edu are also
welcome.  

Newsgroups: comp.parallel
From: kostas@siemens.siemens.com (Konstantinos Diamantaras)
Subject: Alliant Campus/800: Info wanted
Organization: Siemens Corp. Res., Inc.
Distribution: na
Date: 23 Nov 92 16:10:17 GMT


Hi netters,

I am looking for info regarding Alliant's Campus/800 system
for comparative study relative to other massively parallel systems.
I have already gathered some information from newspapers and magazines
but I have some gaps especially regarding these issues:

o Performance
o Network configuration
o Pricing
o Software support for image-processing applications

Anyone out there who can help me may contact me via e-mail at

kostas@siemens.siemens.com

Thanks in advance!

		Kostas Diamantaras

Newsgroups: comp.parallel
From: dcp79807@csie.nctu.edu.tw ()
Subject: Re: Trace generator wanted (Uniprocessor or MP)!!
Apparently-To: <hypercube@hubcap.clemson.edu>
Organization: Computer Science & Information Engin., Chiao-Tung U, Taiwan, ROC
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 16 Nov 1992 09:20:12 GMT

Dear Netter:

	Because the summary is long.  I post it to comp.arch only.
	If you are interested in it please get it in comp.arch.
	Thanks

Miller Lin

--
------------------------------------------------------------------------------
Chih(4)-Zong(2) Lin(2)				| e-mail address:            
Dept. Computer Science & Information Engineering|   dcp79807@csie.nctu.edu.tw 
National Chiao-Tung University			| 
Hsinchu, Taiwan, Republic of China		|
------------------------------------------------------------------------------

Newsgroups: comp.parallel
From: jf@edv6000.tuwien.ac.at (Josef Fritscher)
Subject: Re: PVM vs. Express
Apparently-To: comp-parallel@news.uu.net
Reply-To: fritscher@email.tuwien.ac.at
Organization: Technical University of Vienna
Date: Mon, 16 Nov 1992 11:17:08 GMT

In article <1992Nov13.125101.20219@hubcap.clemson.edu>, Roy_Williams@nntp-server.caltech.edu writes:
 
|> Portability: PVM seems to be just workstation networks, Express is also Intel, Ncube
|> Cray, SGI, in fact all the MIMD machines I can think of.

On the other side you can mix workstations from different vendors
(heterogeneity) with PVM but not with Express.

|> 
|> Debuggers: Express has ndb, PVM has the usual unix debuggers. You have to learn
|> ndb, but its built as a parallel debugger (Firing up 64 dbx's could be a bit of
|> a strain on any machine I would think)

The new (public domain) tool xab will give you debugging and performance
monitoring features.

|> 
|> Express has a reasonable I/O model: the processors contribute to the file in order,
|> or all the processors speak with one voice, or they all write asynchronously, and
|> similarly for reading. I've found it really awkward trying to write an intelligible
|> file when anyone can write whenever they want.

This only needs some synchronisation stuff which can be written in PVM too.

|> 
|> PVM seems to be just send and receive and not much else. You can't send a "mixed-bag"
|> message with different types - you have to send the floats, ints, chars etc in
|> different messages. Also there seems to be a kind of hub-and-spoke system where all 
|> messages get routed through the hub (is this true?).

Completely wrong. You can mix of different types of data in one message and you
have barriers, signals, etc.. Also the routing is no problem because PVM is
based on TCP/IP where no routing is neccessary. Of course messages are 
transported through a daemon, but that is in most cases an advantage.

BTW. the new version of PVM (3.0) will address most of the features addressed
above.

- Joe 

-- 
Josef Fritscher                     Internet: fritscher@edvz.tuwien.ac.at
Computing Center                      Bitnet: fritscher@awituw64.bitnet
Technical University of Vienna    in reality: jf@edv6000.tuwien.ac.at
Wiedner Hauptstrasse 8-10              Voice: ++431 58 801/5505
A-1040 Vienna, Austria/Europe		 Fax: ++431 58 74 211 
Member of the Austrian Center for Parallel Computation (ACPC)
-------------------------------------------------------------------------
The function of local-in-Universe critical information-gathering and
local-in-Universe problem-solving is manifest in the cockpit of all
great airplanes.                                  (R. Buckminster Fuller)

Newsgroups: comp.parallel
From: jf@edv6000.tuwien.ac.at (Josef Fritscher)
Subject: Re: PVM vs. Express
Apparently-To: comp-parallel@news.uu.net
Reply-To: fritscher@email.tuwien.ac.at
Organization: Technical University of Vienna
Date: Wed, 18 Nov 1992 11:26:52 GMT

In article <BxtGE9.460@cs.vu.nl>, henk@cs.vu.nl (Henk Smit) writes:
|> jf@edv6000.tuwien.ac.at (Josef Fritscher) writes:
|> 
|> >.........<about PVM communication>........... Of course messages are 
|> >transported through a daemon, but that is in most cases an advantage.
|> 
|>   Why is this an advantage ? Every messages between 2 tasks has to go
|>  through 2 daemons now. The path now takes 3 hops, instead of 1 hop.
|>  Which advantage is so big, that it outweights this disadvantage in
|>  speed ?

The daemon works as an agent. It starts processes, kills them, manage PIDs, etc.
That does not excuse for slower communication. I also wrote in the same post:

: BTW. the new version of PVM (3.0) will address most of the features mentioned
above.

which is also true for this topic. 

- Joe
-- 
Josef Fritscher                     Internet: fritscher@edvz.tuwien.ac.at
Computing Center                      Bitnet: fritscher@awituw64.bitnet
Technical University of Vienna    in reality: jf@edv6000.tuwien.ac.at
Wiedner Hauptstrasse 8-10              Voice: ++431 58 801/5505
A-1040 Vienna, Austria/Europe		 Fax: ++431 58 74 211 
Member of the Austrian Center for Parallel Computation (ACPC)
-------------------------------------------------------------------------
The function of local-in-Universe critical information-gathering and
local-in-Universe problem-solving is manifest in the cockpit of all
great airplanes.                                  (R. Buckminster Fuller)

Newsgroups: comp.parallel
From: akothari@ecst.csuchico.edu (Atin Atul Kothari)
Subject: Parallel comp. applicaitions in graphics
Organization: California State University, Chico
Date: 18 Nov 1992 20:05:06 GMT


hi people,
	i am currently researching applications of parallel and super computers
in computer graphics. and along with that, i also info. about why particular 
machines are suitable for certain types of graphics applications only. 

	i would appreciate it if any of you can send me any related info, may it
be on-line or name and issues of magazines where i can find it.
	
	i need it real bad. 

thanx.
atin

Newsgroups: comp.parallel
From: |S| Norbert Juffa <S_JUFFA@irav1.ira.uka.de>
Subject: References for parallel file system?
Organization: University of Karlsruhe (FRG) - Informatik Rechnerabt.
Date: Thu, 19 Nov 1992 15:52:27 +0100
X-News-Reader: VMS NEWS 1.23

Hi netters!

I am posting this on behalf of a friend who doesn't have access to NEWS.
He is supposed to do some research for a parallel file system. This is to 
be used for a MIMD architecture where the nodes are connected by a perfect 
shuffle network. They plan to use a whole bunch (~64) of cheap SCSI disks
with the machine. This is a research project under development at the
University of Karlsruhe, Germany ("Project Triton", I think). He has a few
journal articles/conference papers on the parallel file system used by Intel
iPSC hypercube architecture. However, he would like to have as many additional
references as possible.

So if any of you out there know about technical reports, journal articles,
and conference papers dealing with parallel file systems, please let me know!
Please send email, as I am not able to follow this group. I will post a summary
of all responses in about two weeks! Thanks for your help in advance! It is
appreciated!

Norbert
-------------------------------------------------------------------------------
Norbert Juffa          email: S_JUFFA@IRAVCL.IRA.UKA.DE      Live and let live!

Newsgroups: comp.parallel
From: henk@cs.vu.nl (Henk Smit)
Subject: Re: PVM vs. Express
Organization: Fac. Wiskunde & Informatica, VU, Amsterdam
Date: Mon, 16 Nov 1992 15:58:57 GMT

jf@edv6000.tuwien.ac.at (Josef Fritscher) writes:

>.........<about PVM communication>........... Of course messages are 
>transported through a daemon, but that is in most cases an advantage.

  Why is this an advantage ? Every messages between 2 tasks has to go
 through 2 daemons now. The path now takes 3 hops, instead of 1 hop.
 Which advantage is so big, that it outweights this disadvantage in
 speed ?

      Sincerly,

           Henk.

-- 
Henk Smit                               Vrije Universiteit     Amsterdam
Internet: henk@cs.vu.nl                 Phone:    +31 20 548 6218

Newsgroups: comp.parallel
From: terashim@mtecv2.mty.itesm.mx (Ing. Hugo Terashima Marin)
Subject: Info on KSR, Dataflow, Sequent and NCube
Keywords: KSR, Ncube, Dataflow, Sequent
Organization: I.T.E.S.M. Campus Monterrey
Date: 23 Nov 92 17:21:52 GMT


Ing H T Marin: Info on KSR, Sequent, Dataflow and Ncube systems18 Nov 92
22:52
Hello,
   I would like to get any information and references of the commercial
parallel systes such as  KSR, Sequent, Dataflow, Ncube. Any reference
would be greatly appreciated
Thanks in advance.
Hugo Terashima
terashim@mtecv2.mty.itesm.mx

Newsgroups: comp.parallel
From: don@ohm.york.ac.uk (Don Goodeve)
Subject: Re: Manipulating process workspace on the Transputer
Organization: Electronics Department, University of York, UK
Date: Fri, 20 Nov 92 14:13:48 GMT

In <1992Nov17.132507.14895@hubcap.clemson.edu> aghao@sersun2.essex.ac.uk writes:

>To this I would add that I need this information at run-time.  The idea is that
>there are low-priority processes executing code implemented as functions
>(A and B, say).  Each of these processes would have an associated workspace,
>pointed to by Wptr, for local vars, params, etc.  I need to know exactly what
>the size of the allocated workspace is, and I would like to design a separate
>function (G, say), which, executed by a high priority process, would be able to
>examine, access and manipulate the workspaces for A and B.  

The only way that I think you could get this information is from
the compiler/builder. Tcode is relocatable and hence can be started
anywhere in memory without modification. However, on startup the
WPtr and IPtr need to be set (base addresses). You can easily find
this value if you can ensure that no variables in your code are
allocated before you do something like

LDLP 0
STNL address  (pass in as a f. parameter)

The top limit is a matter for whatever you are using to do memory
allocation (icollect in Inmos toolsets). This will depend on the
requirements of your compiled code and any stuff that you link
in. I do not know of any way you could determine it at run time.

If you have the available memory, you could always write a bogus
piece of code that does something like (Occam)

SEQ
  [ridiculously.large.number]INT dud.array :
  PLACE dud.array IN WORKSPACE :
  SEQ
    SKIP    -- (may have to be more meaningful to avoid being
            --  optimised out)
  ... Rest of function

This way, you should be able to guarantee the upper limit by
choosing an appropriate ridiculously.large.number.

Not necassarily the most elegant approach, but it may save
a lot of hassling around trying to extract the information
you need.

I dont know what the situation is like for other language
platforms, but you should be able to do something similar.

Cheers
	Don

don@ohm.york.ac.uk


-- 
 ---------------------------------------------
| Don --- Well why not? Someone has got to be!|
 ---------------------------------------------

Newsgroups: comp.parallel
From: janowsky@boltzmann.rutgers.edu (Steven Janowsky)
Subject: Re: CM-2 Performance?
Summary: CM-2 Integer Performance
Organization: Rutgers Univ., New Brunswick, N.J.
Date: 22 Nov 92 17:56:54 GMT




Here is what TMC claimed (a couple of years ago).  All is for the Paris
model.

Numbers are for a 64K CM2.  Divide by the appropriate factor if fewer
are available

Bits	Mips for Add	Mips for Move

64		1500		2000
32		2500		3000
16		3300		3800
8		4000		4500


SJ

Newsgroups: comp.parallel
From: izahi@bsc.no (Raul Izahi Lopez Hernandez)
Subject: Hypercube friendly applications
Summary: What runs well on hypercubes?
Keywords: Parallel Processing, Applications, Hypercubes, Users 
Organization: Bergen Scientific Centre, Bergen, NORWAY
Date: Thu, 19 Nov 1992 11:26:33 GMT

Can some users post information on which applications run well on hypercubes?
Could a brief summary of the application be written and also how many
processors were used and what was the degree of parallelism obtained?
Thanks in advance for your time.

--
         -----> All opinions expressed here are my own, not IBM's <-----
Raul Izahi Lopez IBM Bergen Environmental Sciences and Solutions Centre	
izahi@bsc.no	 Thormoehlensgate 55, 5008 Bergen, NORWAY (47-5)54-4653	

Newsgroups: comp.parallel
From: aghao@sersun2.essex.ac.uk ()
Subject: Re: Manipulating process workspace on the Transputer
Reply-To: aghao@sersun2.essex.ac.uk ()
Organization: University of Essex, Colchester, UK
Date: Tue, 17 Nov 1992 13:25:07 GMT

Greetings.

I'm sorry I have been rather silent since I posted my original question.  I had
to leave town (:-) for a long weekend, and only returned last night.

Thanks very much for the responses.  I think my original post was slightly 
ambiguous, as I failed to explain the conditions under which I wished to access
the workspaces.  As a reminder, I said

>As part of my research, I need to be able to examine the workspace of one or 
>more Transputer processes.  Clearly, this is quite feasible, as I can get hold
>of the Wptr of a process.
>
>However, as I need to access the workspaces as separate, individual entities,
>I need to know what the boundaries are, ie where each particular process' 
>workspace starts and *ends*.  One possibility is to find out what the size
>of each workspace is, and that is what I am hoping to be able to do.

To this I would add that I need this information at run-time.  The idea is that
there are low-priority processes executing code implemented as functions
(A and B, say).  Each of these processes would have an associated workspace,
pointed to by Wptr, for local vars, params, etc.  I need to know exactly what
the size of the allocated workspace is, and I would like to design a separate
function (G, say), which, executed by a high priority process, would be able to
examine, access and manipulate the workspaces for A and B.  

I cannot rely on the chance that the 2 workspaces will be consecutively placed,
nor can I make assumptions about the workspace sizes, as that is simply 
courting disaster.  At the same time, I'm sure that information either about
the size of the workspace, or the ending address of the workspace (which amount
to the same thing) will be available somewhere.  This information will allow
me to do what I like with the workspaces of A and/or B, safe in the knowledge
that I am not tampering with the workspace of any other process(es). 

Ideally, the process G would be able to compile a table with workspace info
on all processes of interest, and would then be able to accurately access any
of them.

Thanks,

	Obi Aghanya
	Dept. of Computer Science
	University of Essex
	Colchester CO4 3SQ
	UK



Newsgroups: comp.parallel
From: collberg@dna.lth.se (Christian S. Collberg)
Subject: Info on Parallelizing Compilers for Distributed Memory Architectures
Organization: Department of Computer Science, Lund University
Date: Fri, 20 Nov 1992 17:24:50 GMT


I have found lots of articles on vectorizing compilers. I have not, 
however, been able to find any information on compilers which try to
discover parallelizable code and then attempt to map it to processes 
on a distributed memory machine. Can someone help me to find the
relevant references?

Thanks!

Christian Collberg-- 
Christian.Collberg@dna.lth.se
Department of Computer Science, Lund University, BOX 118, S-221 00 LUND, Sweden

Newsgroups: comp.parallel,comp.sys.super