On a Method of Multiprogramming

By: D. Gries (Foreword by), Wim Feijen, A.J.M. van Gasteren

Write A Review

Hardcover | 11 June 1999

At a Glance

Hardcover
396 Pages

Dimensions(cm)
24.77 x 16.51 x 2.54

Hardcover

$249.75

or 4 interest-free payments of $62.44 with

Ships in 5 to 7 business days

Among all the interests in parallelism, there is an essential and fundamental one that has remained largely unexplored, namely the question of how to design parallel programs from their specification. And that is what this book is about. It proposes a method for the formal development of parallel programs - multiprograms as we have preferred to call them -, and it does so with a minimum of formal gear, viz. with the predicate calculus and with the meanwhile well-established theory of Owicki and Gries. The fact that one can get away with just this theory will probably not convey anything to the uninitiated, but it may all the more come as a surprise to those who were exposed earlier to correctness of multiprograms. Contrary to common belief, the Owicki/Gries theory can indeed be effectively put to work for the formal development of multiprograms, regardless of whether these algorithms are distributed or not. That is what we intend to exemplify with this book.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Software Engineering Algorithms & Data Structures Operating Systems Object-Oriented Programming or OOP Computer Science

Foreword	p. vii
Preface	p. xi
On Our Computational Model	p. 1
Our Program Notation and Its Semantics	p. 7
The notation	p. 7
Hoare-triples and the wlp	p. 9
Properties of Hoare-triples and the wlp	p. 10
Definition of the wlp's	p. 11
The skip, the assignment, and the composition	p. 12
The alternative construct	p. 14
The repetitive construct	p. 18
On our choice of formalism	p. 19
The Core of the Owicki/Gries Theory	p. 23
Annotating a multiprogram	p. 24
Two examples	p. 28
Postconditions	p. 32
Two Disturbing Divergences	p. 35
Bridling the Complexity	p. 41
Private variables and orthogonality	p. 42
System Invariants	p. 45
Mutual Exclusion	p. 50
Co-assertions and Strengthening the Annotation	p. 55
Three Theorems and Two Examples	p. 61
Synchronization and Total Deadlock	p. 75
Guarded Statements	p. 76
Progress issues	p. 77
Some examples	p. 80
Total Deadlock	p. 82
More examples	p. 83
Individual Progress and the Multibound	p. 89
Concurrent Vector Writing	p. 97
More Theorems and More Examples	p. 111
The Yellow Pages	p. 123
A Summary	p. 124
Predicate Calculus	p. 124
Our computational model	p. 125
Annotation	p. 125
The Core of the Owicki/Gries theory	p. 126
Variables	p. 127
Atomicity	p. 127
Progress	p. 128
Rules and Lemmata	p. 129
Exercises	p. 130
The Safe Sluice	p. 153
Peterson's Two-Component Mutual Exclusion Algorithm	p. 163
Re-inventing a Great Idea	p. 171
On Handshake Protocols	p. 177
Phase Synchronization for Two Machines	p. 187
The Parallel Linear Search	p. 201
The Initialization Protocol	p. 207
Co-components	p. 219
The Initialization Protocol Revisited	p. 229
The Non-Blocking Write Protocol	p. 237
Mutual Inclusion and Synchronous Communication	p. 243
A Simple Election Algorithm	p. 257
Peterson's General Mutual Exclusion Algorithm	p. 265
Monitored Phase Synchronization	p. 281
Distributed Liberal Phase Synchronization	p. 287
Distributed Computation of a Spanning Tree	p. 299
Shmuel Safra's Termination Detection Algorithm	p. 313
The Alternating Bit Protocol	p. 333
Peterson's Mutual Exclusion Algorithm Revisited	p. 347
Epilogue	p. 357
References	p. 361
Index	p. 367
Table of Contents provided by Syndetics. All Rights Reserved.

On a Method of Multiprogramming

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Object-Oriented Programming or OOP

Effective Modern C++

42 Specific Ways to Improve Your Use of C++11 And C++14

Statistical Analysis with R For Dummies

For Dummies (Computer/Tech)

PHP, MySQL, & JavaScript All-In-One For Dummies

For Dummies

Design Patterns

Elements of Reusable Object-Oriented Software

Programming Rust

Fast, Safe Systems Development 2nd Edition

Head First Design Patterns

Building Extensible and Maintainable Object-Oriented Software 2nd Edition

Object-Oriented and Classical Software Engineering - Global Edition

8th Edition

Concurrency in C# Cookbook

2nd Edition - Asynchronous, Parallel, and Multithreaded Programming

Head First Python

3rd Edition - A Learner's Guide to the Fundamentals of Python Programming, a Brain-Friendly Guide

Learning Python

Powerful Object-Oriented Programming

Getting Started with Arduino 4e

The Open Source Electronics Prototyping Platform

Head First Objects-Oriented Analysis and Design

The Best Introduction to Object Orientated Programming

Learning C# 3.0

OREILLY

Python in easy steps

In Easy Steps

Computer Science Why

Answers to Computer Science Questions They Don't Cover in Class

Computer Science Why

Answers to Computer Science Questions They Don't Cover in Class

Mastering Regular Expressions

OREILLY

C++ Primer

Refactoring 2ed

Improving the Design of Existing Code

Objects First with Java 6ed

A Practical Introduction Using BlueJ, Global Edition

C# Programming in easy steps

Master C# fundamentals!

Taking Testing Seriously

The Rapid Software Testing Approach

97 Things Every Programmer Should Know

OREILLY

Programming F# 3.0

OREILLY AND ASSOCIATE

This product is categorised by