HDTenEightyP/NetNews huggingface dataset:
From: mturner@aris.ss.uci.edu (Matthew Turner)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Basic Question
Date: 18 Aug 92 11:19:31 GMT
Distribution: fj

After reading the post entitled Basic Question, I found that I had a question of my own.  Is there a place where people trying to build experimental multi-processor systems out of off-the-shelf parts get together to compare notes?  I have read through a l
ot of articles in this group, and get the impression that it is more concerned with theory and high-end systems than with "homebrew" systems.

Thanks for any info...

-Matthion








===========================================================================
                        (__)        |   Matthion Augustus Douglas Turner
                ^^      (oo)        |
            ^^^^ /-------\/         |  Department of Biophysical Alchemy
         ^^^^^  / |     ||          |  College of Arcane Arts (A.A.)
       ^^^^^   *  ||----||          |  University of California, Irvine
    ^^^^^^^^  ====^^====^^====      |              
^^^^^^^^^^^^^/ ^^^^                 |       mturner@aris.ss.uci.edu
^^^^^^^^^^^^^^^^^^^^^^^^^^          |           
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ |
    Cow Hanging Eight at Malibu     |    Analytical Engines Incorporated
============================================================================
From: edelman%math.Berkeley.EDU@ucbvax.Berkeley.EDU (Alan Edelman)
Newsgroups: fj.mail-lists.parallel
Subject: Large Dense Linear Algebra Update
Date: 20 Aug 92 17:05:12 GMT
Distribution: fj


   Large Linear Algebra Record Update

Largest LU:     75,264 complex, double precision, Intel iPSC/860
Symmetric Eigs: 27,000 on an N-cube
Non-sym eigs:   Probably less than 10,000


  Any further updates, please let me know.

Alan Edelman
From: eugene@nas.nasa.gov (Eugene N. Miya)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Asking for demo program for PVM
Date: 19 Aug 92 12:21:55 GMT
Distribution: fj

PVM comes with four or five test/demo programs (if you got it from netlib
properly).
From: engler@cs.arizona.edu (Dawson R. Engler)
Newsgroups: fj.mail-lists.parallel
Subject: Request: Good Recent Threads Paper
Date: 18 Aug 92 11:18:59 GMT
Distribution: fj

I am having some difficulty finding recent thread papers (specifically,
anything in the last two years).  Can someone give a reference to a good 
'survey' paper which I could use to work backwards?

Please reply via email.

Thanks,
        Dawson Engler
        engler@cs.arizona.edu
From: cpr4k@holmes.acc.Virginia.EDU (Christian P. Roberts)
Newsgroups: fj.mail-lists.parallel
Subject: Re: Liver (sic) loops benchmarks wanted
Date: 17 Aug 92 14:03:38 GMT
Distribution: fj

In article <1992Aug14.183014.26627@hubcap.clemson.edu>,
JSALAS@vmtecqro.qro.itesm.mx (Joaquin SALAS RODRIGUEZ) writes:
|>     Does someone of you where could I get the liver (sic) loops
benchmarks? Any infor
|> mation would be apreciated.

Available from netlib@ornl.gov with the message

send livermore from benchmark              <-- double precision
or
send livermores from benchmark             <-- single precision
or
send livermorec from benchmark             <-- C version

--

Chris Roberts                     Academic Computing Center
cpr4k@virginia.edu                University of Virginia           
(804) 982-4693                    Charlottesville, Virginia 22903
From: gmap19@gmd.de (Horst Schwichtenberg)
Newsgroups: fj.mail-lists.parallel
Subject: virtual shared memory on workstation cluster
Date: 19 Aug 92 16:55:01 GMT
Distribution: fj

We are looking for  shared memory systems to run it on a 
cluster of workstations (RS6000, Sun's) or  atop of 
pvm or Express. Are there any pd-versions. Please let us 
know.
H. Schwichtenberg, GMD, Institut I1.T
Schwichtenberg@gmd.de
From: basak@news.cis.ohio-state.edu (Debashis Basak)
Newsgroups: fj.mail-lists.parallel
Subject: Info on clustered architectures.
Date: 14 Aug 92 12:10:12 GMT
Distribution: fj

Hi,

I am interested to get some references to papers on clustered architectures,
by which I  mean a distributed memory  architecture with supernodes arranged
in some regular topology, where each supernode is a cluster of processors 
with shared memory/distributed memory, e.g. a mesh of meshes.

I am willing to post a compilation of the responses.

Thanks in advance.

-Debashis Basak
 basak@cis.ohio-state.edu
From: hacksaw@cellar.org (Hacksaw)
Newsgroups: fj.mail-lists.parallel
Subject: Basic Question
Date: 14 Aug 92 12:11:24 GMT
Distribution: fj


   I apologize if this message is off-topic or idiotic, but... I was talking 
to a friend who mentioned something about parallel computing. The idea that 
more than one processor could be hooked together in one system and achieve 
"super-speed". At work, he used a system(I forget the name) that had 
4-parallel 386/25Mhz processors. It handled "animation" on a CAD program 
called Jack with no trouble at all. I'm talking high-res images getting 
flipped back and forth in no time. If this is what 4 386 processors can 
achieve, then I'll be satisfied with what 2 286 processors can do.
 
   I'm currently running a 286/12 under MS-DOS. Obviously, I'm ready to 
upgrade. I can pick up another 286 motherboard for under $100. Or would I 
just need the 286 chip itself? Anyway... how would I go about hooking these 
things together to achieve parallelism? What kind of software would support 
it? MS-DOS seems to choke on even the itty-bittiest section of RAM above 
640K; I don't know what makes me think it could handle another processor.
 
   Basically... Is parallel computing something only for the highest end 
machines, or could it be achieved on a measly 286? Any comments would be 
greatly appreiated. 

Cheers!
From: sivap-m@sybil.cs.buffalo.edu (Muhunthan Sivapragasam)
Newsgroups: fj.mail-lists.parallel
Subject: References rqd : automatic partitioning of parallel programs
Date: 13 Aug 92 20:18:39 GMT
Distribution: fj


	i had posted a request about the same topic few weeks back.
thanks for those who replied.

	but i forgot to mention i am looking for info on automatic
partitioning at runtime. that is the decision to partition the program
further ( or to run sequentially ) is made at runtime. if you know
of any work, or papers about this topic please send me mail.

	thanks in advance,

-- 
						S. Muhunthan,

	"The shortest distance between two people is a smile"
################################################################################
From: jjackson@carlrs6000.carl.ua.edu (Jeff Jackson)
Newsgroups: fj.mail-lists.parallel
Subject: RPC usage in FORTRAN on distributed SUN workstations.
Date: 12 Aug 92 12:20:48 GMT
Distribution: fj

I have two questions.

 1) What manual(s) describes the FORTRAN usage of Remote Procedure Calls?
    I have all the SUN manuals, including the Network Programming Guide,
    but all examples there are in C.  My code must be F77 (arrrrgghh!).

 2) I have heard (via a previous post that I no longer have) that PVM
    (availability?) may help me.  If so, what is PVM, what will it do for
    me, and where can I get it?

Please email any response to jjackson@tiger.carl.ua.edu or
jjackson@carlserver.carl.ua.edu.

Thanks in advance.

Jeff

-------------------------------------------------------------------------------
David Jeff Jackson                         Internet: jjackson@tiger.carl.ua.edu
Electrical Engineering Dept.                                    (130.160.48.25)
P.O. Box 870286
The University of Alabama                The Computer Architecture Research Lab
Tuscaloosa, AL 35487-0286
Phone: (205) 348-2919
-------------------------------------------------------------------------------
From: c0031010@ws.rz.tu-bs.de (Josef Schuele)
Newsgroups: fj.mail-lists.parallel
Subject: PVM
Date: 18 Aug 92 20:04:50 GMT
Distribution: fj

Hi,
has anybode PVM installed on HPs 400 (HPUX 8.0) 700 (HPUX 8.07) and
could give me some hints ?

Josef
From: minser@cs.utk.edu (Karen Minser)
Newsgroups: fj.mail-lists.parallel
Subject: C* on the CM2 and CM5
Date: 17 Aug 92 19:33:19 GMT
Distribution: fj

Could anyone tell me if the C* used on the CM2 is the same or similar to the C*
to be used on the CM5?

Please just e-mail the answer to me.

Thanks,
Karen Minser (minser@cs.utk.edu)
From: desprez@schnaps.ens-lyon.fr (Frederic Desprez)
Newsgroups: fj.mail-lists.parallel
Subject: T9000 machines projects?
Date: 14 Aug 92 12:11:30 GMT
Distribution: fj


	Hi,

	I'm looking for informations about projects of parallel 
	machines using T9000 processors and C104 routing chip.

	I only have some informations about Parsytec's Giga Cube.

	Thanks in advance.

	Frederic
From: csds@alpha.ru.ac.za (David Sewry)
Newsgroups: fj.mail-lists.parallel
Subject: Formal Specifications in CCS
Date: 12 Aug 92 12:21:33 GMT
Distribution: fj

Hello

I am using Milner's CCS to specify the Linda programming model.
(This work forms part of a larger project which aims to construct
a parallel debugger.)

I am keen to learn of any efforts in the use of CCS as a specification
tool, or its use in the specification of such parallel paradigms.

David Sewry
Internet: csds@alpha.ru.ac.za
From: hong@cs.arizona.edu (Ke Hong)
Newsgroups: fj.mail-lists.parallel
Subject: Papers on Debugger
Date: 18 Aug 92 20:05:57 GMT
Distribution: fj

Hi ,

   Is there anyone know where can I get the paper on Debugger via ftp?

   Because sometimes it's hard to find the paper in lib?

Thank you in advance!

--George

hong@cs.arizona.edu
From: JSALAS@vmtecqro.qro.itesm.mx (Joaquin SALAS RODRIGUEZ)
Newsgroups: fj.mail-lists.parallel
Subject: Liver (sic) loops benchmarks wanted
Date: 14 Aug 92 18:30:33 GMT
Distribution: fj

Hi,
    Does someone of you where could I get the liver (sic) loops benchmarks? Any infor
mation would be apreciated.
                     Thanks.
                          Joaquin SALAS
 
jsalas@vmtecqro
From: jsmith@king.mcs.drexel.edu (Justin Smith)
Newsgroups: fj.mail-lists.parallel
Subject: Re: C* on the CM2 and CM5
Date: 19 Aug 92 12:22:12 GMT
Distribution: fj

In article <l8veh7INNbcs@utkcs2.cs.utk.edu> minser@cs.utk.edu (Karen Minser) writes:
>
>Could anyone tell me if the C* used on the CM2 is the same or similar to the C*
>to be used on the CM5?

I'm also interested in the answer to this --- could you post it?
-- 
Justin R. Smith
Department of Mathematics and Computer Science
Drexel University
Philadelphia, PA 19104                    (215) 895-1847
From: steve (Steve Stevenson)
Newsgroups: fj.mail-lists.parallel
Subject: Student Volunteers needed for Supercompting
Date: 18 Aug 92 20:06:05 GMT
Distribution: fj

[I got this through other sources...don't respond to me]

               *** ATTENTION STUDENTS ***

>From the Student Volunteer Committee of SUPERCOMPUTING'92:
> 
...........................................................................
> Student volunteers are needed for the SUPERCOMPUTING '92 conference to be 
> held in Minneapolis in November, 1992.  Volunteer positions will require 
> from 25 to 30 hours of duty during or prior to the conference from Thursday, 
> November 12, to Friday, November 20.  Every effort will be made to design 
> their duty schedule so that they can attend some conference activities of 
> their choice, including a tutorial, technical sessions, minisymposia, 
> workshops, etc.
> 
> Students selected by the SC'92 Student Volunteer Committee to work at 
> Supercomputing '92 will receive the following benefits:
> 
>      o   Complimentary Registration & Banquet Activities
>      o   Hardcopy of Conference Proceedings
>      o   Free hotel room (double occupancy) during the time you are 
>          assisting at SUPERCOMPUTING '92.
>      o   Complimentary admittance and handouts for one tutorial.
> 
> Any student enrolled in an undergraduate or graduate program may apply by 
> completing the application form and returning it as soon as possible.
> 

Since the SUPERCOMPUTING'92 committee is not providing financial support
for students to travel to Minnesota, the North Carolina Supercomputing 
Center will provide students from North Carolina Institutions who are 
selected as volunteers by the SC'92 student volunteer committee with a 
$100 Travel Grant (up to 10 students, first come first served), in order 
to encourage students to volunteer to work at this educational event.

For an application form, get the anonymous ftp file 

        "/pub/general/sc92volunteer.info" 

from ncsc.org (or send email to info@ncsc.org requesting a form).

Application forms are due by Friday, August 28, 1992.
=======================================================================
The '92 volunteer program will reward you with an enriching conference 
experience and provide you with special opportunities to learn more 
about advanced computing and its applications.  
                                 ###
From: waander@cs.umd.edu (Bill Andersen)
Newsgroups: fj.mail-lists.parallel
Subject: Need general info on MasPar product line
Date: 21 Aug 92 12:15:22 GMT
Distribution: fj


   If anyone out there has info on MasPar computers, please
contact me by e-mail.

  ...Bill

 P.S. Thanks in advance!
-- 
   / Bill Andersen (waander@cs.umd.edu) /
  / University of Maryland             /
 / Department of Computer Science     /
/ College Park, Maryland  20742      /
From: nagrwb@vax.oxford.ac.uk
Newsgroups: fj.mail-lists.parallel
Subject: quadrature and parallelism
Date: 21 Aug 92 12:16:14 GMT
Distribution: fj

I'm looking for references on parallel techniques for quadrature problems.
Even better, does anybody have a bibliography on the subject? Post to
the net or e-mail direct and I'll summarize.

TIA - Richard.
-- 
** R.W. Brankin -- nagrwb@vax.ox.ac.uk **
From: ian@spider.co.uk
Newsgroups: fj.mail-lists.parallel
Subject: Is the overhead of spin lock acquisition always significant?
Date: 18 Aug 92 11:19:40 GMT
Distribution: fj

I'd like to question one of the sacred cows of spin-lock based shared 
memory multiprocessing: that the number of spin locks acquired should be 
minimised, because the overhead in lock acquisition is significant.

I agree that contention is always significant, and that there are good
other reasons for not having lots of locks (clarity and deadlock
avoidance).  Also, in some applications, the overhead of lock
acquisition may be significant, where the critical sections are
very short and are executed very frequently.

In our application, a TCP/IP protocol stack, the difference between
acquiring 5 and 10 locks on a typical input or output path seems to me
to be insignificant compared to the protocol processing, assuming no
contention for those locks.  

This issue becomes important because multiple-reader/single-writer
locks are much more convenient to use, and reduce contention, at
a cost of increasing the overhead (three times that of a mutex lock?).

Are their cache consistency or other reasons to inflate the overhead
of testing and setting a memory location?  What have I missed?

Can someone suggest a rough equivalent for a spin lock acquisition in
terms of (some arbitrary mix of) instructions execution, where both 
instruction and data fetch are cache hits?

thanks


ian

---
Ian Heavens				ian@spider.co.uk                 
Spider Software
Spider Park, Stanwell Street		
Edinburgh, EH6 5NG, Scotland		+44 31 555 5166 (Ext 4347)
--
From: noh@cs.umd.edu (Sam Hyuk Noh)
Newsgroups: fj.mail-lists.parallel
Subject: code for CM-2
Date: 14 Aug 92 18:30:35 GMT
Distribution: fj

Have you developed programs that has
a characteristic such
that the number of processors active
during it execution changes?
For example, in the Gaussian elimination algorithm
the number of active processors 
tend to decrease as the execution progresses.

Are these program written in C*, *Lisp, or CM-Fortran of
the Connection Machine?

Then would you be kind enough to share this
code with me?

I would greatly appreciate it if you could
send me this kind of code.

Thanks in advance.

-- sam noh
From: rminnich@super.super.org (Ronald G Minnich)
Newsgroups: fj.mail-lists.parallel
Subject: Re: PVM: thoughts on data-passing routines
Date: 14 Aug 92 12:10:28 GMT
Distribution: fj

In article <1992Aug11.121234.28784@hubcap.clemson.edu> jek@cs.duke.edu (James E. Kittock) writes:
>
>This summer, I have been working with PVM on a project to parallelize
>codes that simulate convection.  The parallelization is being done
>through domain decomposition, i.e. each of N subprocesses works on
>1/Nth of the original domain.
I am curious: when you partition, are the partitions of the array 
in contiguous chunks, or if they are interleaved, are the chunks
reasonably large? (say a multiple of page size). 

If each process's 1/Nth of the array is in a contiguous chunk,
then it seems to me you could use a DSM. 
When a process is scheduled, it uses its process number 
to compute a pointer to its chunk of work and does the computation. 
That is basically what I have done here on the ELC farm for 
several applications. Then you are using PVM for scheduling and
the DSM for sharing data.

Even supposing they aren't contiguous, or they aren't aligned
on nice boundaries, if you are using a DSM then each 
process can do assignment statements from the global array to the small
local copy. The programming effort is easy, at least for the applications
I have tried. 

the put_automatically thing you propose looks difficult. 
I don't want to write it either :-)

ron
-- 
--------------------------------------------------------------------------------
satisfaction: the feeling you get when you        | rminnich@super.org
run newfs on a DOS disk so you can install 386BSD.| (301)-805-7451
Now if only I could do this to AIX on the RS/6k ...|
From: ti6hk@ap04.rz.tu-harburg.de (Henry Koplien - 3358 )
Newsgroups: fj.mail-lists.parallel
Subject: CSP Real-Time
Date: 19 Aug 92 16:55:01 GMT
Distribution: fj

Hello everybody,
 
I am a new "member" of  the  comp.parallel group  and  glad to  find the right
articles.  I  make  a research  about  a  specification-language  for parallel 
processes  under  the  time  domain.  This language should be able to describe 
parallel  processes and their  communication between  them. My ideas  focus on 
using CSP  extended with  time-intervalls.  Is  anybody  working  on  the same 
problem or has anybody solved it? Is CSP a good platform?
I hope to receive a lot of answers. Thanks in advance...
 
Henry
 

------------------------------------------------------------------------------
mail-address   :  Dipl.-Inform. Henry Koplien
                  Technische Universitaet Hamburg-Harburg
                  Martin-Leuschel-Ring 16
                  2100 Hamburg 90
 
Telephone      :  040 / 7718-3358   
Fax            :  n.a.              
 
e-mail         :  koplien@rztsun.tu-harburg.dbp.de
------------------------------------------------------------------------------
From: deluca@bu-pub.bu.edu (Cecelia Deluca)
Newsgroups: fj.mail-lists.parallel
Subject: C* on the CM2 and CM5
Date: 20 Aug 92 17:05:00 GMT
Distribution: fj

According to our local TMC rep, C* code written for the CM2 should compile
and otherwise behave nicely on the CM5, with  the important exception that the
CM5 does not support any Parallel Instruction Set (PARIS) calls whatsoever.
(That means no complex type - yuck) However, CM operarators such as scan, reduce, etc. will still be supported on the new machine.  If you're interested, there's a brief description of C* on the CM5 in the "CM5 Technical Summary"
booklet provided by TMC.
From: jimc@quintus.com
Newsgroups: fj.mail-lists.parallel
Subject: Call For Papers: ICLP '93
Date: 18 Aug 92 11:19:31 GMT
Distribution: fj


			CALL FOR PAPERS - ICLP'93


	TENTH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING

			    Budapest, Hungary
			    June 21 - 24, 1993


	Sponsored by the Association of Logic Programming


The 1993 International Conference on Logic Programming will be held on June
21-24, 1993, in historic Budapest. Logic Programming is one of the most
promising approaches to declarative programming. It forms the theoretical
basis of the programming language PROLOG and its extensions. Also, work in
logic programming has contributed to several other areas: Artificial
Intelligence where it has been used for nonmonotonic and commonsense
reasoning, Expert Systems implementation, Deductive Databases and a variety
of applications such as computer aided manufacturing. The technical program
for the conference will include workshops, tutorials, invited lectures and
presentations of refereed papers.

Papers are invited on any aspect of logic programming, including (but
not limited to): 

   o Theory and foundations                o Applications
   o Programming methodologies and tools   o Artificial intelligence
   o Meta and higher-order programming     o Constraints
   o Parallelism, concurrency              o Partial deduction
   o Deductive databases                   o Bottom-up evaluation
   o Implementations and architectures     o Compilation techniques


Papers must be written in English and should not exceed 5000 words,
excluding references. Papers should include a 200 word abstract and keywords
to define a topic. Submitted papers (or any portion thereof) should not have
been previously published or submitted to any journals, refereed conferences
or workshops. Each accepted paper must be presented at the conference.
Submit six (6) copies by December 1, 1992 to:

David S. Warren
Department of Computer Science
SUNY at Stony Brook
Stony Brook, NY 11794-4400
U.S.A.
Email: warren@cs.sunysb.edu
Fax: +1 516 632-8334

Notification will be made in early March 1993. The proceedings will be
published by MIT Press. 

      Conference Chair: Peter Szeredi, IQSOFT, Hungary
                        szeredi@iqsoft.hu
         Program Chair: David S. Warren, SUNY at Stony Brook, USA
                        warren@cs.sunysb.edu
       Publicity Chair: Jim Crammond, Quintus, USA
                        jimc@quintus.com
  Workshop Coordinator: Mats Carlsson, SICS, Sweden
                        matsc@sics.se
    Local Organization: John von Neumann Society for Computing Sciences
                        huug@neumann.hu
From: rustomji@sol.cs.wmich.edu (Storm Rider)
Newsgroups: fj.mail-lists.parallel
Subject: HETEROGENEOUS COMPUTING
Date: 20 Aug 92 20:09:23 GMT
Distribution: fj

[this is getting to be a true FAQ---has someone kept track of the
recent PVM, etc stuff? -- Steve].

Hi,

I am about to launch myself on a project in building a Heterogeneous
Parallel Computing System, using TCP/IP/UDP Protocols. If anyone
can provide any information as to where I can get information regarding
Heterogeneous environments for UNIX based systems, it will be greatly
appreciated. (e.g. ftp sites, journals, articles, papers, documentation)


Thank you.

--
==================================================================
Eric  Rustomji         
Department of Computer Science
Western Michigan University
From: pgraham@silver.cs.umanitoba.ca (Peter Graham)
Newsgroups: fj.mail-lists.parallel
Subject: Wanted: Public Domain parallel machine simulators
Date: 17 Aug 92 19:33:27 GMT
Distribution: fj

I am interested in getting pointers to free parallel machine simulators for
use in a 4th year undergraduate honours course which surveys parallel
systems. I used the Blitzen(/MPP) simulator last term with reasonable
success and would like to expand the students' experience to include other
such systems representing other types of parallel machines. I would greatly
appreciate any advice/comments/suggestions people may have. (Particularly
those which relate experiences in a similar academic setting.) My thanks
in advance.     Peter
---
Peter C.J. Graham			<pgraham@cs.umanitoba.ca>
Computer Science			(204) 474-8313
University of Manitoba, Winnipeg MB
Canada R3T 2N2
From: ojuarez@mtecv2.mty.itesm.mx (Octavio Juarez Espinosa)
Newsgroups: fj.mail-lists.parallel
Subject: Looking info about shared memory systems
Date: 12 Aug 92 14:54:46 GMT
Distribution: fj

Hi,

I am very interested in to receive some information about shared memory
systems (parallel).

I'll appreciate if give some references about programming paradigms for
parallel architectures.

Thanks in advance.

Sincerely,

Octavio Juarez Espinosa
ojuarez@mtecv2.mty.itesm.mx

-- 
Octavio Juarez Espinosa
Gabriel Valerio 1134 
Saltillo, Coahuila    CP 25000
Mexico  email ojuarez@mtecv2.mty.itesm.mx