HDTenEightyP/NetNews huggingface dataset:
From: azhao@cs.arizona.edu (Qiang Alex Zhao)
Subject: Re: Distributed Virutal Reality
Keywords: distributed, multiprocessor, Virtual Reality
Organization: Computer Science Dept, Univ of Arizona, Tucson
Date: 20 Jan 93 22:19:55 GMT


In article <1993Jan20.210954.11691@hubcap.clemson.edu>, knut@uni-paderborn.de (Knut Menzel) writes:
|> Three months ago I initiated a survey and collected the results
|> that have been done so far in Virtual Reality applications running
|> on multiprocessor systems or in distributed environments.
|> 
|> Does anyone know a special interest group (Siggraph) or another 
|> conference or journal where I can publish these results?

People at the discussion list "mp-render" (Massive Parallel Rendering)
may be interested (at least I am :o). Subscribtion should be sent to:

	mp-render-request@icase.edu

Contribution to:

	mp-render@icase.edu

And there'll be a "Visualization '93 PARALLEL RENDERING SYMPOSIUM" in
October -- I can send you the news-blurb if you like.

-- 
= Qiang Alex Zhao                 ___       .             ______
  Computer Science Dept          /   )     /|   )          __//  )
  University of Arizona         /   /     /_|  / _        //    /_  _. ._
  azhao@cs.arizona.edu         (__)(_o   /  (_(_(-'_)(   ((____/ (_(_(_(_)

Newsgroups: comp.parallel
From: wrighte@cae.wisc.edu (Edward Dansavage Wright)
Subject: Novice Needs help with Hypercube
Originator: wrighte@sun-15.cae.wisc.edu
Organization: College of Engineering, Univ. of Wisconsin-Madison
Date: Mon, 25 Jan 1993 16:37:16 GMT

Request for some help/advice.

I have been given a small account on an Intel Hypercube.  I have
had no success figuring out how to program the thing for my project.
The machine is still new on campus and there aren't many manuals or
proficient programmers around.

The project I have in mind is a parallel implementaion of a
CHannel-Scovel symplectic integrator.  The function of the program
is rather similar to a Newton Raphson root finging algorithm.  Does
anyone hav a NR algorithm that works on the Hypercube I could use
as a model till I figure things out?  Does anyone have some pointers
on programming the Hypercube?

Thank you for your time.

As always,
Ed Wright
Department of Engineering Mechanics and Astonautics
University of Wisconsin at Madison



Newsgroups: comp.parallel
From: krings@cse.unl.edu (Axel Krings)
Subject: locate report by Rayward and Smith
Organization: University of Nebraska--Lincoln	
Date: 27 Jan 1993 17:13:56 GMT

I am trying to locate the email address of V.J. Rayward and Smith to
find their 1986 work: 

               Internal Rep. SYS-C86-06
    "UET scheduling with interprocessor communication delays"

School Inform. Syst. Univ. East Anglia, Norwich, England.
If any one can prompt me to either email address of the authors or a
source of the paper in the US I'd appreciate it.
Thanks
	Axel
--
------------------------------------------------------------------
Axel Krings                            | email: krings@cse.unl.edu
Dept. Comp.Science & Engineering       | phone: 402-472-2402
University of Nebraska - Lincoln       | fax  : 402-472-7767

Newsgroups: comp.parallel
From: kencham@ulysses.cs.umn.edu (Deepak Kenchammana-Hosekote)
Subject: Distributed Debugging: Help for paper sources
Apparently-To: comp-parallel@uunet.uu.net
Organization: University of Minnesota
Date: Thu, 28 Jan 1993 02:36:25 GMT

Hi,

I was looking for recent papers on distributed debugging. If any
one has any pointers/lists I would appreciate them mailing it to
me.

Thanks,

\deepak
--
This message is being generated by Kenchammana-Hosekotan SXXIIIR2. 
Please report bugs to kencham@cs.umn.edu.

Newsgroups: comp.parallel
From: swhite@mathcs.emory.edu (Scott White)
Subject: Can a Hypercube programmer lend me a hand?
Organization: Emory University, Dept of Math and CS
Date: 25 Jan 1993 10:04:40 -0500

Hi,

I was looking over some Hypercube code, which I have some experience
programming, and came across csend() calls that have a negative value
in the "destination node" argument.  Looking at the csend() man page, I
see the following:

     If node is a negative number up to a certain value, it
     causes a ``global'' send. If node is -1, the message is sent
     to all nodes. Other negative numbers cause the message to be
     sent to a subcube composed of a set of the nodes surrounding
     the sender. The dimension of this cube is calculated as (d -
     nodedim() -1) , where d is the dimension of the subcube, and
     is less than or equal to nodedim().

Now, I'm not sure if this is the clearest explanation.  Maybe I'm just being
thick.  Can someone help me understand just who gets the message in the
following examples:

	nodedim is 2, destination argument is -2, I am processor 2

	nodedim is 3, destination argument is -2, I am processor 2

	nodedim is 5, destination argument is -3, I am processor 2


Your assistance in getting my week off to a better start is greatly appreciated!

Thanks,

Scott White
Emory U. Math/C.S. Dept.
-- 
Scott White
Department of Mathematics and Computer Science
Emory University, Atlanta, GA 
Internet: swhite@mathcs.emory.edu   UUCP: {rutgers,ogicse,gatech}!emory!swhite	

Newsgroups: comp.parallel
From: hss@pepper.bu.edu (Himanshu Sinha)
Subject: Re: computing on a cluster of workstations
Organization: Boston University
Date: 27 Jan 93 02:00:17 GMT


In article <1993Jan23.153711.15180@hubcap.clemson.edu>, silly@eel.micro.umn.edu (Vijay) writes:
|> Hi all,
|> 
|> 	I am looking for parallel/dist algorithms ( and general problem
|> areas ) that are suitable for a cluster of workstations. 
|> That is, point-to-pont communication is just as costly as a
|> broadcast to all since machines are hooked onto an ethernet.. 
|> 	I need algos that exploit this ie algos that get all
|> the work done thru broadcasts and/or computation done in a
|> phased manner etc..;
|> 
|> 	An excellent example is sahni's all-pairs-shortest-paths
|> (originally floyd's seq algo);
|> 	I would very much appreciate any help, like pointers to
|> survey articles/books etc;.
|> 
|> -vijaY`
|> [bandi@cs.umn.edu or silly@eel.micro.umn.edu]

You may want to look at asynchronous iterative algorithms for finding fixed
points. I have an implementation in which I solve a linear system of equations
using such an algorithm on a network of workstations.  You can get papers
describing our system by anonymous ftp from cs.bu.edu.
	cd techreports
	mget *mermera*
A paper describing the performance in detail is under preparation.

The book "Parallel and Distributed Computation" by Bertsekas and Tsitsiklis
gives an excellent description of these algorithms.

I am not aware of Sahni's parallel all-pairs-shortest-paths algorithm. Could
you please send me a reference.

Thanks
Himanshu

Newsgroups: comp.parallel
From: stunkel@watson.ibm.com (Craig Stunkel)
Subject: Re: parallel linear programming algorithms
Keywords: linear programming
Organization: IBM T.J. Watson Research Center
Disclaimer: This posting represents the poster's views, not necessarily those of IBM
Date: Fri, 22 Jan 1993 20:55:52 GMT

In article <1993Jan20.124827.8420@hubcap.clemson.edu> msodhi@agsm.ucla.edu (Mohan Sodhi) writes:
>...  To the best of my knowledge, there is no
>other asynchronous algorithm based on the (revised) simplex method yet.
>
>Eckstein at Thinking M/c along with Zenios at Wharton implemented the
>basic (not revised) simplex method on a Connection Machine. Stunkel &
>Reed (ACM, 1988 pp 1473-1482) do the same on a hypercube.

A better reference for the "Stunkel & Reed" work is

@inproceedings{stun88,
        author="C. B. Stunkel",
        title="Linear Optimization Via Message-Based Parallel Processing",
        booktitle="Proceedings of the International Conference
                on Parallel Processing",
        volume="III",
        pages="264--271",
        address="St. Charles, IL",
        month="August",
        year=1988
}

This paper reports results of both simplex AND revised simplex
implementations on an iPSC/2 hypercube.  The methods are primarily
row or column oriented, and thus are more suited to large or
medium-grained machines.

I noticed that Sridhar & Basu co-author a paper on revised simplex
partitioning schemes in the upcoming IPPS '93.

Craig Stunkel                 IBM T.J. Watson Research Center
stunkel@watson.ibm.com        Yorktown Heights, NY
--
Craig Stunkel                 IBM T.J. Watson Research Center
stunkel@watson.ibm.com        Yorktown Heights, NY

Newsgroups: comp.parallel
From: silly@eel.micro.umn.edu (Vijay)
Subject: computing on a cluster of workstations
Apparently-To: comp-parallel@uunet.uu.net
Organization: University of Minnesota, Minneapolis: Under Grad Workstation Lab.
Date: Sat, 23 Jan 1993 02:03:19 GMT

Hi all,

	I am looking for parallel/dist algorithms ( and general problem
areas ) that are suitable for a cluster of workstations. 
That is, point-to-pont communication is just as costly as a
broadcast to all since machines are hooked onto an ethernet.. 
	I need algos that exploit this ie algos that get all
the work done thru broadcasts and/or computation done in a
phased manner etc..;

	An excellent example is sahni's all-pairs-shortest-paths
(originally floyd's seq algo);
	I would very much appreciate any help, like pointers to
survey articles/books etc;.

-vijaY`
[bandi@cs.umn.edu or silly@eel.micro.umn.edu]


Newsgroups: comp.parallel,comp.theory
From: vram@cc.gatech.edu (Venkataraman Ramanathan)
Subject: Re: Vertex disjoint routing on Hypercube
Apparently-To: comp-parallel@gatech.edu
Reply-To: vram@cc.gatech.edu (Venkataraman Ramanathan)
Organization: College of Computing
Date: Sat, 23 Jan 1993 15:07:29 GMT

Let's say V1 and V2 differ in n bits. By an easy transformation, we could
get V1 to origin and V2 to V. Now, the problem is to find n disjoint routes
from O (origin) to V.  For a 8 dim difference,

	1  2  3  4  5  6  7  8
	2  3  4  5  6  7  8  1  (1 rotated)
	3  4  5  6  7  8  1  2  (2 rotated)
		...
	8  1  2  3  4  5  6  7  (7 rotated, n-1 in general).

consider the scheme above. There can be atmost n routes. 
For each route, flip the bits (move in that dimension) according to
the sequence defined by the row.

First route is : take dim 1, 2 ... (1 row)
Second route is: take dim 2 first,  3 next, and so on..
And so on..

Proof is easy. This rotate-router is very effective. Fill your route number in,
increment and do mod + 1, keep flipping these bits..: that's all.
-
Venkat
(vram@cc)
PS.  I got 10/10 on this homework problem with Dr.Jim Burns.
PPS. Ah! this didnt show up when i posted this through 're'. now it's ok!

Newsgroups: comp.parallel
From: hamby@cs.utk.edu (Jeffrey Mark Hamby)
Subject: request suggestions for parallel programming project
Organization: CS Department, University of Tennessee, Knoxville
Date: 20 Jan 93 15:28:27 GMT


I'm looking for ideas for a project in my parallel programming class.
Since we fortunately have a great deal of freedom in choosing a topic,
and since astronomy & physics have long been interests of mine, I
hope to find something that combines them with parallel programming.
Ideally, I'd like to do something that's

   * interesting,
   * actually useful to someone in the "real" world,
   * not a duplicate of work already done or being done,
   * suitable for a one-person, ~one-semester project, and
   * in one of the Fortran, C, or C++ dialects.

The nature of the project would be something like either adapting an
existing serial code to a parallel architecture, or adapting an
existing parallel code to a different parallel architecture, and then
trying to get something which runs quickly and accurately.  Evidently
several architectures, as well as tools such as PVM, will be available.

Thoughts I'd had include problems in N-body simulation, particle
physics, etc..  Any suggestions, pointers to existing apps, or other
comments, I'd greatly appreciate.  Thanks in advance for your help,

mark
hamby@cs.utk.edu

Newsgroups: comp.parallel
From: mlevin@husc8.harvard.edu (Michael Levin)
Subject: what's the difference between a CM-5 and a CM-2?
Organization: Harvard University Science Center
Date: 27 Jan 93 11:01:10 EST


     I have some C* programs which ran fine on a Thinking Machines'
CM-2 (they were fractal algorithms, and very well parallelizable).
Now, there is a CM-5, and I am curious as to the difference. Is there
a text file anywhere (FTP?) which describes the difference between
them from the point of view of the user (i.e., I don't need any
hardware details, but just info on whether you have to cmattach to the
CM-5, etc.). Is the CM-5 supposed to be faster? I have actually
recompiled and ran (without cmattach, as that didn't work) my code on
the CM-5, and it was much much slower. I imagine I'm doing something
wrong though. Maybe I'm not asking for enough processors or something.
Anyways, if anyone has any clues on moving C* programs from the CM-2
to CM-5, please email me at mlevin@jade.tufts.edu or
mlevin@husc8.harvard.edu. 

Mike Levin


Newsgroups: comp.parallel
From: yhanafy@egr.duke.edu (Yasser Y. Hanafy)
Subject: help needed with concurrent programming tools
Organization: Duke University EE Dept.; Durham, NC
Date: 27 Jan 93 04:15:46 GMT

[
This subject is on parlib. How to Get Information from Parlib:

The parlib login on hubcap.clemson.edu is a mail server using the netlib
software. To get the instructions, send the following mail message:

        shell> mail parlib@hubcap.clemson.edu
               Subject:
               send index
               .
        shell> ....
]

Hi,

  I'm supposed to do a little survey on concurrent programming tools (on networks
of workstations). Currently working with PVM, i have very few references on Linda,
and ISIS. Need some references and comparison studies if available. As far as i 
heard, the only tool that has built in load balacing algorithms is Express, but i
could not find any references to it. 

Thanks,
Yasser.

email: yhanafy@egr.duke.edu


Newsgroups: comp.parallel
From: raw@dogmatix.inmos.co.uk (Bob Wipfel)
Subject: Re: KSR-1 Docs
Apparently-To: hypercube@hubcap.clemson.edu
Keywords: Parallel computing, supercomputing
Organization: INMOS Limited, Bristol, UK
Date: Thu, 28 Jan 1993 13:23:41 GMT

In article <1993Jan26.160316.8498@hubcap.clemson.edu>, esl_manager@Gimme.CC.UH.EDU writes:

|> I am trying to obtain information on the KSR-1 developed by the people
|> at Kendall Square Research Lab(KSR). Does anyone know of any paper(s)
|> written about it? Or, is there an ftp site repository of their paper(s).
|> Of course, I will also be interested if someone can give me KSR's e-mail
|> address. 

Try ksr-info@ksr.com

I did! and they sent me some pretty good (ie: high technical content)
sales literature (and what a sexy machine the KSR-1088 is, go out and buy
one today). Incidentally, does any one know what the largest KSR machine
shipped to date is?

-- 
| Bob Wipfel         Inmos Ltd, Bristol  | EMail(UK) ukc!inmos!raw
|----------------------------------------|     or    raw@inmos.co.uk
| The opinions above are my personal     | Internet: raw@inmos.com
| views and do not reflect Inmos policy. | UUCP:(US) uunet!inmos.com!raw

Newsgroups: comp.parallel
From: cedelle@yin.irisa.fr (Alain Cedell)
Subject: MPfortran performance question.
News-Software: VAX/VMS VNEWS 1.41    
Organization: IRISA, Rennes (Fr)
Date: 22 Jan 1993 15:13 -0700

 I would be interested to share experience with MPFortran users, especially
about this point of vector/array performance:
 I'm currently using MPFortran on a DECMPP-12000 (1K processors), and i meet
many performance problems: The shape of arrays seem affecting the computing
time. For instance the statement : 
                Sb = SUM(Tb,MASK=Mb .eq. 1)

 Or even the statement :
                Tb = Mb + 1

 Are much more quickly evaluated when Tb and Mb are vectors (array(1:900)), than
when they have 2 dimensions (array(1:3,1:300)). This for same number of elements

 Is this a general rule to always prefer vectors than multi dimension arrays ?

a.c.
cedelle@irisa.fr

Newsgroups: comp.parallel
From: jet@nas.nasa.gov (J. Eric Townsend)
Subject: cm5-admin mailing list?
Apparently-To: comp-parallel@ames.arc.nasa.gov
Organization: Numerical Aerodynamic Simulation, NASA Ames
Date: 21 Jan 93 16:00:29


Does one exist?  If not, is anyone interested?  I already run a few
other mailing lists, what's one more?

--
J. Eric Townsend --  jet@nas.nasa.gov -- 415.604.4311 (DoD# 0378)
"It is the cunning of form to veil itself continually in the evidence
of content.  It is the cunning of the code to veil itself and to produce
itself in the obviousness of value." -- Baudrillard

Newsgroups: comp.parallel
From: sriniv@cathedral.cerc.wvu.wvnet.edu (Srinivas Kankanahalli)
Subject: Memory Access Pattern Generators
Apparently-To: comp-parallel@uunet.uu.net
Followup-To: poster
Organization: Concurrent Engineering Research Center
Date: Sun, 24 Jan 1993 17:17:53 GMT

Hi
  I would appreciate any pointers to PD and commercial software, that
generate memory access patterns for programs. I am interested in Software
for Sequential as well as parallel machines. I will summarize if there
is enough interest.

Thanks in Advance

-Srinivas
---------------------------------------------------------------------
Srinivas Kankanahalli
Assistant Professor
Department of Computer Science & Concurrent Engineering Research Center
West Virginia University
Morgantown, WV 26505
Email: srini@cs.wvu.wvnet.edu
           or
      sriniv@cerc.wvu.wvnet.edu
---------------------------------------------------------------------


Newsgroups: comp.parallel
From: hsong@asylum.cs.utah.edu (Hwal Song)
Subject: code for transport equation
Organization: University of Utah Computer Science
Date: Wed, 20 Jan 93 15:09:24 -0700

I need to parallize the transport eq. solution using multigroup 
method.
Does anyone know any existing code for the transport equation
by mutigroup methods?
Any other related info is welcome, too.
Please send me an email if you do.

Thank you in advance.       

Newsgroups: comp.parallel
From: raw@dogmatix.inmos.co.uk (Bob Wipfel)
Subject: Re: PVM and transputers
Apparently-To: hypercube@hubcap.clemson.edu
Organization: INMOS Limited, Bristol, UK
Date: Thu, 28 Jan 1993 13:13:02 GMT

In article <1993Jan26.160228.8207@hubcap.clemson.edu>, knut@uni-paderborn.de (Knut Menzel) writes:
|> In article <1993Jan20.093013.11400@vax.oxford.ac.uk>, nagrwb@vax.oxford.ac.uk writes:
|> |> Out of interest, anybody know if PVM has been implemented with
|> |> transputers as the target hardware?
|> |> Richard.
|> 
|> I am not quite sure, but I think Parsytec Corp., Aachen, Germany, plans
|> to implement PVM on transputers...

Caplin Cybernetics, Isle of Dogs, LONDON (071-538-1716) have an
implementation for their transputer based HEX and XPR systems. This
supports PVM on transputers, i860-XPs and across the host interface to
Sparc, RS6000 and most Q-Bus or SCSI DEC machines.


-- 
| Bob Wipfel         Inmos Ltd, Bristol  | EMail(UK) ukc!inmos!raw
|----------------------------------------|     or    raw@inmos.co.uk
| The opinions above are my personal     | Internet: raw@inmos.com
| views and do not reflect Inmos policy. | UUCP:(US) uunet!inmos.com!raw

Newsgroups: comp.parallel
From: sanjay@tyler.berkeley.edu (Sanjay Shrivastava)
Subject: Is PVM3.0 available at any ftp site??? 
Apparently-To: comp-parallel@uunet.uu.net
Reply-To: sanjay@tyler.berkeley.edu (Sanjay Shrivastava)
Organization: Concurrent Engineering Research Center
Date: Wed, 27 Jan 1993 04:04:11 GMT


Could someone please let me know the status of PVM3.0 ... is it out and
available at any site. If not, does anyone have any idea as to when it is to
be released.

Thanks in advance......

Sanjay Shrivastava.

_____________________________________
Sanjay Shrivastava
Research Assistant
Concurrent Engineering Research Center
West Virginia University
Morgantown, WV-26506.

Ph#:(304)-293-7535 extn:242.

Newsgroups: comp.parallel,comp.theory
From: Heiko Kiessling <kiess@ira.uka.de>
Subject: Milner's \pi-calculus
Reply-To: kiess@ira.uka.de
Organization: University of Karlsruhe, Germany, Department of Computer Science
Date: 	Wed, 27 Jan 1993 17:15:00 +0100

I'm looking for more information on Milner's \pi-calculus as presented in his
Turing Award lecture in CACM 36(1). Maybe someone knows an FTP site with
papers or technical reports on this topic. Thanks in advance for any help.
-- 
  Heiko

Newsgroups: comp.parallel
From: kunisada@is.kyushu-u.ac.jp (Katuhiro KUNISADA)
Subject: Re: definition of parallel efficiency
X-Nntp-Posting-Host: is-og8.is.kyushu-u.ac.jp
Organization: Dept. of Information Systems, Kyushu Univ., Japan
	<kitchel.726766135@manta>
Date: Fri, 22 Jan 1993 07:27:45 GMT

In article <kitchel.726766135@manta> kitchel@manta.dpsi.com (Sidney W. Kitchel) writes:

   >Stephen Vavasis <vavasis@cs.cornell.EDU> writes:
   >
   >
   >>I have seen two definitions of "parallel efficiency" in the literature,
   >>and I am wondering whether one definition or the other has prevailed.
   >>They are:
   >
   >>(1) par eff = (seq. time of the par. algorithm) / (p * parallel time)
   >
   >>(2) par eff = (seq. time of the best possible sequential algorithm
   >>               for the problem) / (p * parallel time)
   >
   >>If you had a parallel cyclic reduction algorithm, would you rate it
   >>against a sequential cyclic reduction algorithm or against tridiagonal
   >>Cholesky factorization?
   >
   >>How about when the underlying problem is more complicated, for example
   >>solving a boundary value problem?  In this case it's not clear how to
   >>identify the best possible sequential algorithm.
   >
   >>I would like to get this definition straight because I am teaching a
   >>class on parallelism.
   >
   >	    Since Frontiers '92, it also depends on whether you did the
   >programming or God did.


As we are not god.

I think that, the best way to estimate parallel efficiency is to use
the sequential algorithm that is known to perform best, as the following.

           (worst seq. time of the seq. algorithm that is known to be best)
 par eff = ----------------------------------------------------------------
                     	       (p * parallel time of the worst case)



----------------------------------------------------------------------
K. kunisada				kunisada@is.kyushu-u.ac.jp
My name is same with the most famous Yakuza (Kunisada Tyuuji)

Newsgroups: comp.parallel
From: eugene@nas.nasa.gov (Eugene N. Miya)
Subject: Re: World's most powerful computing
Apparently-To: comp-parallel@ames.arc.nasa.gov
Organization: NAS, NASA Ames Research Center, Moffett Field, CA
Date: Fri, 22 Jan 93 02:30:31 GMT

In article <1993Jan21.013116.1925@sol.cs.wmich.edu>
john@cs.wmich.edu (John Kapenga) writes:
>Who would have guessed?

I expect the Spanish Inquisition.

>If there is a use for such a list it might be to allow those who
>have no idea what's going on to find out where various non-conventional
>computers are located.
>Listing a site, brief information on access, uses and a list of hardware
>(without the vendor hype) might help someone.

The list is useful for system crackers to test their ability to find accounts
without passwords (first level security: twisting the door knob to see
if it's unlocked), and then maybe the possibility of testing penetration
tools to scope out what's going on (2nd level security).  The attraction
is the "non-conventional." Like finding the gateways to Antarctica or
space computers, or defense/intelligence computers.  Especially, since
the laws are currently vague and many bureaucracies don't want to go thru
the embarassment of the publicity.  The penetrator hoping or assuming they
can get off the hook by trying to seek employment as a security consultant.

Or you might write a book.

Joy riding.

And in a way, Robert Morris did not deserve to be convicted for the Internet
worm AT THIS TIME.  But that's my opinion.

--eugene miya, NASA Ames Research Center, eugene@orville.nas.nasa.gov
  Resident Cynic, Rock of Ages Home for Retired Hackers
  {uunet,mailrus,other gateways}!ames!eugene
Second Favorite email message: Returned mail: Cannot send message for 3 days
A Ref: Mathematics and Plausible Reasoning, vol. 1, G. Polya

Newsgroups: comp.parallel