The Library
On the semantics of fair parallelism
Tools
Tools
Tools
Park, David (1979) On the semantics of fair parallelism. University of Warwick. Department of Computer Science. (Theory of Computation Report). (Unpublished)
|
Text
WRAP_Park_cs-rr-031.pdf - Published Version Download (1463Kb) | Preview |
Abstract
Suppose that a programming language involves, among other familiar ways of composing commands Ci, a "parallel" construct (C1 par C2) .
One expects, when using this language, that a sequence such as
x := O; y := 1; (x := 1 par (while x=0 do y := y+1)) should be guaranteed to terminate in whatever context it is executed.
| Item Type: | Report |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science |
| Library of Congress Subject Headings (LCSH): | Parallel programming (Computer science) |
| Series Name: | Theory of Computation Report |
| Publisher: | University of Warwick. Department of Computer Science |
| Official Date: | October 1979 |
| Number: | Number 31 |
| Number of Pages: | 23 |
| DOI: | CS-RR-031 |
| Status: | Not Peer Reviewed |
| Publication Status: | Unpublished |
| Access rights to Published version: | Open Access (Creative Commons) |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
