HDTenEightyP/NetNews huggingface dataset:
From: rekers@elc2 (Jan Rekers)
Subject: Specifying a ring in LOTOS
Organization: Department Of Mathematics and Computer Science
Date: Thu, 1 Oct 92 08:58:38 GMT


I am new into LOTOS and I have just worked my way through the
introduction in LOTOS by Bolognesi and Brinkman.  Now, on trying to
use LOTOS, I have encountered a problem which is very basic to my
understanding of the formalism. I would appreciate any help with the
following:

I wish to define a ring of processes with the following layout:

                     1
                    / \
                   c   a
                  /     \
                 3 - b - 2

1, 2 and 3 are processes; a, b and c are actions.

My first approach is to formulate this in LOTOS as:

   hide a, b, c in
     node[c,a](1) ||
     node[a,b](2) ||
     node[b,c](3)
   where process node[in,out](n:int): exit := 
     ...
   end process

However, from the explanation of the semantic of the || operator, I
understand that this forces all processes to work in full
synchronization.  This would mean that if nodes 1 and 2 can
communicate action ``a'', that this communication can occur only if
node 3 also cooperates in it.

This is clearly not what I want, the |[...]| operator seems more
appropriate.  However, I am only able to use this operator between
nodes 1 and 2 and between 2 and 3:

     node[c,a](1) |[a]|
     node[a,b](2) |[b]|
     node[b,c](3)

The |[c]| operator misses. In order to represent the layout I want, I
need a two-dimensional formalism, while LOTOS, being a textual
formalism, clearly is one-dimensional.

I would like to know whether I am wrong about the semantics of the ||
operator, or whether such a ring indeed cannot be represented in
LOTOS.

Kind regards,				Jan Rekers

J. Rekers, Department of Computer Science, Leiden University
P.O. box 9512, 2300 RA Leiden, the Netherlands
email: rekers@rulwi.LeidenUniv.nl
From: warkent@ltisun14.epfl.ch (Ken Warkentyne)
Newsgroups: comp.specification
Subject: Re: Specifying a ring in LOTOS
Date: 1 Oct 92 16:03:08 GMT
Reply-To: warkent@ltisun.epfl.ch
Organization: Ecole Polytechnique Federale de Lausanne

In article <1992Oct1.085838.7536@rulway.LeidenUniv.nl>, rekers@elc2 (Jan Rekers) writes:
|> 
|> I am new into LOTOS and I have just worked my way through the
|> introduction in LOTOS by Bolognesi and Brinkman.  Now, on trying to
|> use LOTOS, I have encountered a problem which is very basic to my
|> understanding of the formalism. I would appreciate any help with the
|> following:
|> 
|> I wish to define a ring of processes with the following layout:
|> 
|>                      1
|>                     / \
|>                    c   a
|>                   /     \
|>                  3 - b - 2
|> 
|> 1, 2 and 3 are processes; a, b and c are actions.
 
You can specify this in LOTOS:

   hide a, b, c in
     (node[c,a](1) |[a]| node[a,b](2))
   ||
     node[b,c](3)


However, the ring is a deadlock since 2 is waiting for 1,
3 for 2, and 1 for 3.

You need something to kick off the ring, such as:

   hide a, b, c in
    ( (a; node[c,a](1)) |[a]| node[a,b](2))
  ||
    node[b,c](3)
Newsgroups: comp.parallel
From: trevor@iastate.edu (Trevor E Meyer)
Subject: task scheduling 
Apparently-To: comp-parallel@beaver.cs.washington.edu
Reply-To: trevor@iastate.edu (Trevor E Meyer)
Organization: Iowa State University
Date: Tue, 6 Oct 1992 16:09:15 GMT

I am looking for information on current work in task scheduling for parallel
processing. I would be grateful if someone could tell me who is currently
working in this area, and/or what "classic" papers exist on the topic. I am
interested in applying a certain algorithm to the problem and would like to know
if something similar has been done already. 

Thanks in advance,

Trevor Meyer
(trevor@iastate.edu)

Newsgroups: comp.parallel
From: schuette@roadkill.nrl.navy.mil (Larry Schuette)
Subject: Stanford DASH system - any information
Organization: Clemson University
Date: Mon, 5 Oct 92 15:24:43 -0400

Hi,
	Can anyone point me to information on the Stanford University
DASH computer system.  It is a Distributed Shared Memory system built
from multiple Silicon Graphics 4D platforms.  
	Are there any papers published that I can grab off the net?  
Any journals that I can go read?

Thanks,

Larry
    ----------------------------------------------------------------------
	"The quality of the kite matters little.  Success depends upon
		the man who sits in it."		BMv. Richthofen

Lawrence C. Schuette			  schuette@roadkill.nrl.navy.mil
Code 7133				  (202)767-2739  
Naval Research Laboratory		  (202)767-5561 (fax) 	
Washington D.C.	20375-5320


Newsgroups: comp.parallel,comp.theory,comp.arch
From: davis@csrg2.ee.iastate.edu (Jim Davis)
Subject: Are the Livermore Loops benchmarks PD ?
Apparently-To: comp-parallel@beaver.cs.washington.edu
Organization: Iowa State University, Ames IA
Date: Fri, 2 Oct 1992 21:32:24 GMT

Are the Livermore Loops benchmarks public domain; and if so, where
can I ftp them from?

Thanks,

Jim Davis

davis@iastate.edu
From: alf@uni-paderborn.de (Alf Wachsmann)
Newsgroups: comp.parallel
Subject: Transputer-Network-Simulator on SUN
Date: 28 Sep 92 12:50:35 GMT
Reply-To: alf@uni-paderborn.de
Organization: Uni-GH Paderborn, Germany
Apparently-To: comp-parallel@uunet.uu.net


Hi,

assumed
1. I have a SUN but no Transputer-Board and
2. I want to compile OCCAM programs for Transputer-Networks and
3. I want to test if the programs are correct

What can I do?

I know that the Inmos OCCAM Toolset has a Compiler which works
without a Transputer, I further know, that in that Toolset there is a
simulator for 1(!!) T425-Board, BUT I want to simulate great
networks so that the memory of one T425-Board is much to small.

So, is there a simulator for great Transputer networks for a SUN?

Any hint is welcome.

Many thanks,
               Alf.



-- 
*     Alf Wachsmann                | Uni/GH Paderborn                  *
*                                  | FB 17 Informatik                  *
*     e-mail: alf@uni-paderborn.de | Warburger Str. 100                *
*     Phone:  +49 5251 60 3312     | D-W-4790 Paderborn                *
*                                  | Germany                           *
Newsgroups: comp.parallel
From: parallel@netcom.com (B. Mitchell Loebel)
Subject: The PARALLEL Processing Connection -
         Special October 15th Meeting Announcement
Apparently-To: comp-parallel@ames.arc.nasa.gov
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Distribution: usa
Date: Mon, 5 Oct 1992 22:26:21 GMT

October 15, 1992 - Dr. Gordon Bell - Where have all the Massively 
Parallel Processing Companies Gone? Who's Next? and Why?

This month the PARALLEL Processing Connection is honored to welcome 
Dr. Gordon Bell to its platform. Gordon is best known as the chief architect 
of the world famous VAX computer.

Though all of us 'know' that sequential computing ala Von Neuman is 
pass, it does seem to be the MPP companies whose destiny is in question! 
We've asked Gordon Bell to examine the issue of why that is so and 
perhaps even conjecture on the future of the present cadre of companies. Is 
more and bigger ala megaflops to gigaflops and terraflops truly better for 
anyone and anything other than Grand Challenge problems? Doesn't cost-
effectiveness American style mean the economy of scale that would derive 
from thousands of commodity processors operating concurrently? Doesn't 
it also mean a large community of developers writing software for MPP 
machines? And how can commercial users and developers hope to access 
the field as long as the prices of machines and development systems remain 
in the stratosphere? These are some of the vexing questions we've asked 
Gordon Bell to address and we certainly expect a very rewarding evening.

The meeting will take place at 7:30PM in Bldg 5 of the Mountain View 
campus of Silicon Graphics. Exit 101 at Shoreline Blvd, north .7 of a mile 
to Amphitheater Drive, right turn there into the complex. Please note that 
this is a one time only change in date and place of our meeting.

Please be prompt; we expect a capacity attendance; don't be left out or left 
standing. There is an $11 fee for non-members and members will be 
admitted free.
-- 
B. Mitchell Loebel                                      parallel@netcom.COM
PARALLEL Processing Connection                                 408-732-9869

Newsgroups: comp.parallel
From: Glossa <glossa@cix.compulink.co.uk>
Subject: POSIX Threads?
Reply-To: glossa@cix.compulink.co.uk
Organization: Clemson University
Date: Wed, 30 Sep 92 08:54 GMT


I understand that there is a draft POSIX threads standard under the
name PThreads. Does anyone know how I could get to read it?

Tom Lake     GLOSSA@cix.compulink.co.uk

Newsgroups: comp.parallel
From: jiu1@husc10.harvard.edu (Haibin Jiu)
Subject: linda performance
Organization: Harvard University Science Center
Date: 28 Sep 92 11:48:03 EDT


General question:  Does anyone have a compilation on Linda's performance?
		Esp. that of C-Linda?  On any system...

Specific question:  We seem to have been unable to run more than 4 or 5
		C-Linda processes on a LAN of Sun SPARCstations?  Even
		the simplest programs -- some taken from a paper by
		the guy who started Linda and some other dude on parallel
		programming -- lock up if more than 4 Suns are involved.
		Any comments?

Thanks for any useful info.

Bugs

Newsgroups: comp.parallel
From: parallel@netcom.com (B. Mitchell Loebel)
Subject: The PARALLEL Processing Connection - What Is It?
Organization: Netcom - Online Communication Services  (408 241-9760 guest) 
Distribution: usa
Date: Mon, 5 Oct 1992 22:18:38 GMT

The PARALLEL Processing Connection is an entrepreneurial 
association; we mean to assist our members in spawning very 
successful new businesses involving parallel processing.

Since the PPC was formed in late 1989 many people have sampled it,
found it to be very valuable, and even understand what we're up
to. Nonetheless, certain questions persist. Now, in our third
year of operation, perhaps we can and should clarify some of the
issues. For example:

Q.    What is PPC's raison d'etre?
A.    The PARALLEL Processing Connection is an entrepreneurial
organization intent on facilitating the emergence of new
businesses. PPC does not become an active member of any such new
entities, ie: is not itself a profit center.

Q.    The issue of 'why' is perhaps the most perplexing. After
all, a $40 annual membership fee is essentially free and how can
anything be free in 1992? What's the payoff? For whom?
A.    That's actually the easiest question of all. Those of us who
are active members hope to be a part of new companies that get
spun off; the payoff is for all of us -- this is an easy win-win!
Since nothing else exists to facilitate hands-on entrepreneurship,
we decided to put it together ourselves. 

Q.    How can PPC assist its members?
A.    PPC is a large technically credible organization. We have
close to 100 paid members and a large group of less regular
visitors; we mail to approximately 500 engineers and scientists
(primarily in Silicon Valley). Major companies need to maintain
visibility in the community and connection with it; that makes us
an important conduit. PPC's strategy is to trade on that value by
forming alliances with important companies for the benefit of its
members. Thus, as an organization, we have been able to obtain
donated hardware, software, and training and we've put together a
small development lab for hands-on use of members at our Sunnyvale
office. Further, we've been able to negotiate discounts on
seminars and hardware/software purchases by members. Most
important, alliances such as we described give us an inside
opportunity to JOINT VENTURE SITUATIONS.

Q.    As an attendee, what should I do to enhance my
opportunities?
A.    Participate, participate, participate. Many important
industry principals and capital people are in our audience looking
for the 'movers'!

For further information contact:


-- 
B. Mitchell Loebel                                      parallel@netcom.COM
PARALLEL Processing Connection                                 408-732-9869

Newsgroups: comp.parallel
From: strickla@usc.edu (Bryan Strickland)
Subject: Opening at Parasoft Corp. for Senior Programmer
Organization: University of Southern California, Los Angeles, CA
Distribution: usa
Date: 28 Sep 1992 17:36:02 -0700



************************************************************************
THIS IS BEING POSTED FOR A FRIEND, PLEASE DO NOT RESPOND TO THIS ACCOUNT.
************************************************************************

ParaSoft Corp., located just 20 mins outside of L.A., in Pasadena CA,
has an immediate opening for a senior programmer to work on our
Express development team.  Express is a Parallel and Distributed
Development Environment running inside a large class of parallel
computers and on networks of computers.  The individual will be expected
to lead projects, perform detailed product design, develop and
document code, develop and document testing procedures, and to develop
application codes on top of Express.

The successful candidate should have a Computer Science or Engineering
degree. MSCS or PHD preferred.  Requirements: Very good and extensive
knowledge of: UNIX Operating System, Networking, Communication
Protocols, C and FORTRAN.  Experience with parallel and/or distributed
computing is a plus.  Experience with leading commercial software
group is required. Must be able to work in a fast paced environment.

ParaSoft offers a competitive salary and excellent benefits (health,
dental).The position will be based in our Pasadena, CA. Corporate
Headquarters.  

Qualified candidates should forward resumes to:
ParaSoft Corp.  
2500 E. Foothill Blvd., Suite 104 
Pasadena, CA 91107.

Interested applicants may also send email to ukola@parasoft.com with
any questions regarding the position.






Newsgroups: comp.parallel
From: cmcl2!allan.ultra.nyu.edu!gottlieb@uunet.UU.NET (Allan Gottlieb)
Subject: Re: Stanford DASH system - any information
Apparently-To: uunet!comp-parallel
Organization: New York University, Ultracomputer project
Date: Tue, 6 Oct 1992 17:33:56 GMT

In article <1992Oct5.201049.5820@hubcap.clemson.edu> schuette@roadkill.nrl.navy.mil (Larry Schuette) writes:

	   Can anyone point me to information on the Stanford University
   DASH computer system.  It is a Distributed Shared Memory system built
   from multiple Silicon Graphics 4D platforms.  
	   Are there any papers published that I can grab off the net?  
   Any journals that I can go read?

Sure can.  Check out the proceedings of the 1992 International
Symposium on Computer Architecture (ISCA) held at Gold Coast
Australia.  It is available from ACM and IEEE, the joint sponsors.

ISCA 92 is perhaps most noted for its program chairman, who combined
the wisdom and judgement of maturity with the vigor and good looks of
youth. :-) :-)

Newsgroups: comp.parallel,comp.arch
From: subbarao@cs.wisc.edu (Subbarao Palacharla)
Subject: Experiences with DECmpp12000/MasPar MP-1
Apparently-To: uunet!comp-parallel
Organization: University of Wisconsin, Madison -- Computer Sciences Dept.
Date: Tue, 29 Sep 1992 15:05:52 GMT

***********************************************************************
PLEASE MAIL YOUR REPLIES TO rao@auti1.iitsg.nrc.ca
***********************************************************************


Hi,

We might be buying a DECmpp 12000 or MasPar MP-1 in the near future. I
have very little experince in parallel computing. So I would
appreciate if the users of these machines can send me their
experiences (comments). Some of the issues we are interested -
	
	What is a good system configuration - no. of pe's, memory,
		front end machine etc.?
	How easy/difficult is it to program? How good are the compilers in
		parallelizing a serial code? Any comments on the image
		processing and math libraries are also welcome.
	What kind of sustained performance do you get?
	How much did you pay for the complete system?

Any other comments are also appreciated.

thanx in advance
paparao 

e-mail: rao@auti1.iitsg.nrc.ca
	


Dr. Paparao Palacharla
Photonic Systems, IIT		|	Smail: Building M-50, Montreal Road
National Research Council	|	Ottawa, Ontario, Canada K1A 0R6
Phone: 613-991-6159		| 	Internet: rao@autsrv.iitsg.nrc.ca
Fax:   613-952-0215		| 	Home telephone : 613-731-2470



Newsgroups: comp.parallel
From: levie@dutiws.TWI.TUDelft.NL (M.Levie.TA-tel-7230)
Subject: Pacific Sierra Corporation address needed
Followup-To: comp.compilers
Organization: Delft University of Technology
Date: 1 Oct 92 19:32:29 GMT


Hi everybody,

I'm looking for a company called Pacific Sierra Corporation (or so they were
called in 1988) , the makers of a product called VAST.

If anyone on Usenet has a clue whether they still exist, and if they do,
what their address and phone number is (e-mail is fine too), please
e-mail me.

My address is : levie@dutiws.twi.tudelft.nl

Thanks a million

M. Levie
levie@dutiws.twi.tudelft.nl
PS: This message is posted to comp.parallel and comp.compilers



Newsgroups: comp.parallel
From: venu@iastate.edu (Venu M Padakanti)
Subject: Looking for info on NCUBE 
Apparently-To: comp-parallel@beaver.cs.washington.edu
Keywords: References
Reply-To: venu@iastate.edu (Venu M Padakanti)
Organization: Iowa State University
Date: Sat, 26 Sep 1992 15:12:54 GMT


Hello,

	I am interested in preparing a Tutorial for the 
usage of NCUBE. I have access to the manuals but they 
are very descriptive for many portions. 

	Can someone out there suggest me some good references 
for this purpose.

Thanks in advance
..venu

Newsgroups: comp.parallel
From: johng%anableps.Berkeley.EDU@ucbvax.Berkeley.EDU (John Gregor)
Subject: Oregon job opportunity posted in misc.jobs.offered
Followup-To: sender
Organization: Oregon State University, College of Oceanography
Date: 29 Sep 1992 17:16:50 GMT

Hello,

I just wanted to let you know that I have just posted a job opening in
misc.jobs.offered that might be of interest to the readers of this
group.  The message-id is <BvB3v1.MKH@news.orst.edu> and the subject is
'Information Systems Developer, Corvallis Oregon'.

If, for some reason, you can't find the post, let me know and I'll mail
you a copy.

-JohnG

P.S. If you've seen this twice, my apologies.  Our campus newsserver
hung shortly after my first post.  So I'm using an alternate site
(which explains why this note may claim to be from Berkeley).

-- 
         John A. Gregor			USmail:	College of Oceanography
 E-mail: johng@oce.orst.edu			Oregon State University
Voice #: +1 503 737-3022			Oceanography Admin Bldg. #104
  Fax #: +1 503 737-2064			Corvallis, OR  97331-5503

Newsgroups: comp.parallel
From: ganapathy.ramachandran@acadiau.ca (Ganapathy R.)
Subject: Re: Help in understanding concurrent programming concepts
Apparently-To: uunet!comp-parallel
Organization: Acadia University
Date: Mon, 5 Oct 1992 18:53:02 GMT

isc20210@nusunix1.nus.sg (BU SEE TIANG) writes:

>Hi, 
>   Can someone out the tell me more about concurrent programming. I am
>currently doing a study about concurrency in programming languages. Does
>anyone have any paper on concurrency in programming languages,
>especially those about its concepts. Would you please kindly email me
>the paper. Is there also any kind soul out there that can recomment me
>some books on concurrent programming languages. Thank in advance.

Concurrent Programming: Principles And Practice
	By Gregory R. Andrews

>   My email is buseetia@iscs.nus.sg



-- 
*******************************************************************************
Ganapathy Ramachandran   ganapathy.r@acadiau.ca	 Believe In Imagination And 
P.O. Box 112, Wolfville  Acadia University	 It Will Bring You To  
N.S. Canada B0P 1X0      Tel : 542-9920		 Never Never Land.........      ******************************************************************************* 

Newsgroups: comp.parallel
From: srikant@skorpio.USask.ca (Srikant Subramaniam)
Subject: Info needed on KSR machine
To: uunet!comp-parallel@uunet.UU.NET
Apparently-To: uunet!comp-parallel
Organization: University of Saskatchewan, Saskatoon, Canada
Date: Fri, 2 Oct 1992 13:05:22 -0600

I would appreciate receiving some references to the Kendall Square Research
machine. 

Thanks,
-- 
----- 
 |\/\/\/|      Srikant Subramaniam.
 |      |      srikant@cs.usask.ca 
Newsgroups: comp.parallel
From: ob00@ns1.cc.lehigh.edu (OLCAY BOZ)
Subject: References on Parallel Genetic Algorithms
Organization: Lehigh University
Date: Sun, 4 Oct 1992 13:42:29 GMT

Hi,
I am looking for references on Parallel Genetic Algorithms. Any help will be
greatly appreciated.
-- 


         -----------------------------------------------------------------
         |  OLCAY BOZ                     |  OB00@NS1.CC.LEHIGH.EDU      |
         |  LEHIGH UNIVERSITY             |                              |
         |  COMPUTER SCIENCE DEPARTMENT   |                              |
         |  Ph. D. Student                |  phone : (215) 758-1886      |

Newsgroups: comp.parallel
From: sandee@Think.COM (Daan Sandee)
Subject: Re: Are the Livermore Loops benchmarks PD ?
Organization: TMC
Date: 5 Oct 1992 13:08:05 GMT

In article <1992Oct5.121221.23418@hubcap.clemson.edu>, davis@csrg2.ee.iastate.edu (Jim Davis) writes:
|> Are the Livermore Loops benchmarks public domain; and if so, where
|> can I ftp them from?

They're in NISTLIB ; send mail to nistlib@cmr.ncsl.nist.gov
with one text line
       send index from benchmark
and proceed from there.
Last time I looked, that was an ancient version. The current version
should be dated 22DEC86. If you can't find it, ask
mcmahon@ocfmail.ocf.llnl.gov (Frank McMahon)


Daan Sandee                                           sandee@think.com
Thinking Machines Corporation
Cambridge, Mass 02142                                 (617) 234-5044

Newsgroups: comp.parallel
From: "Aggeliki Balou (+44-71-387-7050 ext.3721)" <A.Balou@cs.ucl.ac.uk>
Subject: Info on pthreads
Organization: Clemson University
Date: Mon, 05 Oct 92 18:34:36 +0100

Is there any information available on pthreads (UNIX V Rel. 4 - threads) ?
I would be grateful for any pointers.


Many thanks in advance

Aggeliki


|Aggeliki Balou            |   JANET:aggeliki@uk.ac.ucl.cs                   |
|Dept. of Computer Science |  BITNET:aggeliki%uk.ac.ucl.cs@UKACRL            |
|University College London |Internet:aggeliki%cs.ucl.ac.uk@nsfnet-relay.ac.uk|
|Gower Street              | ARPANet:aggeliki@cs.ucl.ac.uk                   |
|London WC1E 6BT           |    UUCP:...!mcvax!ukc!ucl-cs!aggeliki           |
Newsgroups: comp.parallel
From: rajagopa@memstvx1.memst.edu
Subject: applications of parallel procesing to business problems
News-Moderator: Approval required for posting to comp.parallel
Keywords: parallel
Reply-To: rajagopa@memstvx1.memst.edu
Organization: Memphis State University
Date: 5 Oct 92 02:56:31 -0600

Anyone that has had experience with applying parallel processing to problems
in the business world. For example, in the areas of risk management, simulation
of economic systems,....Please let me know your ideas/thoughts on the project
you worked on. I am looking for a problem that will benefit from applying 
p.processing.

thanx 

rajagopalan b.

e-mail address:  "rajagopa@memstvx1.memst.edu"