Map
Index
Random
Help
th

QuoteRef: mayD_1987

topics > all references > ThesaHelp: references m-o



ThesaHelp:
references m-o
Topic:
massively parallel processors
Topic:
Petri net
Topic:
examples of distributed systems and applications
Topic:
efficiency
Topic:
parallel programming languages
Topic:
synchronous communication through a channel
Topic:
specification and design of distributed systems
Topic:
calculus of communicating processes
Topic:
message queues for communication
Topic:
remote procedure call
Topic:
synchronized processing
Topic:
event time
Topic:
proving concurrent programs

Reference

May, D., Shepherd, R., Keane, C., "Communicating process architecture: transputers and Occam", in Treleaven, P., Vanneschi, M. (ed.), Future Parallel Computers, Lecture Notes in Computer Science, 272, Berlin, Springer-Verlag, 1987, pp. 35-81. Google

Quotations
36 ;;Quote: the aim of occam is to describe arbitrarily large systems in terms of localized processing and communication
36 ;;Quote: designed occam for efficiency in an distributed implementation; same program is then also valid for a single computer
36+;;Quote: many concurrent languages simulate concurrency on a sequential machine; may be poor for real concurrency
37 ;;Quote: primitive occam processes for assigning values to variables, outputing value to channel, and inputting values from channel
37 ;;Quote: combine occam process by sequence, conditional, parallel, or alternative
38 ;;Quote: synchronized communication simplifies programming, no buffers, efficient, data not lost, one process waits for the other
38 ;;Quote: with unsynchronized communication, failure to acknowledge data can lead to timing effects
42 ;;Quote: time in occam represented by a counter; different parts of a program may use different timers; easier than global time
69 ;;Quote: occam has a formal semantics; used an interactive transformation system to prove that an occam program satisfied the IEEE floating point standard

Related Topics up

ThesaHelp: references m-o (268 items)
Topic: massively parallel processors (29 items)
Topic: Petri net (44 items)
Topic: examples of distributed systems and applications (24 items)
Topic: efficiency (96 items)
Topic: parallel programming languages (14 items)
Topic: synchronous communication through a channel (28 items)
Topic: specification and design of distributed systems (14 items)
Topic: calculus of communicating processes (13 items)
Topic: message queues for communication (36 items)
Topic: remote procedure call (44 items)
Topic: synchronized processing (35 items)
Topic: event time (44 items)
Topic: proving concurrent programs (37 items)

Collected barberCB 11/87
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.