Theory of Structured Parallel Programming.

Format:

Book

Author/Creator:

Wang, Yong.

Language:

English

Subjects (All):

Parallel programming (Computer science).

Physical Description:

1 online resource (160 pages)

Edition:

1st ed.

Place of Publication:

San Diego : Elsevier Science & Technology, 2024.

Summary:

Theory of Structured Parallel Programming is a comprehensive guide to structured parallel programming corresponding to traditional structured sequential programming. The book provides readers with comprehensive coverage of theoretical foundations of structured parallel programming, including analyses of parallelism and concurrency, truly concurrent process algebras, building block-based structured parallel programming, modelling and verification of parallel programming language, modelling and verification of parallel programming patterns, as well as modeling and verification of distributed systems. There have been always two ways to approach parallel computing: one is the structured way, and the other is the graph-based (true concurrent) way. The structured way is often based on the interleaving semantics, such as process algebra CCS. Since the parallelism in interleaving semantics is not a fundamental computational pattern (the parallel operator can be replaced by alternative composition and sequential composition), the parallel operator often does not occur as an explicit operator, such as in the mainstream programming languages C, C++, Java, et al.

Contents:

Front Cover

Theory of Structured Parallel Programming

Copyright

Contents

1 Introduction

2 Parallelism and concurrency

2.1 Unstructured parallelism - true concurrency

2.2 Structured parallelism

2.3 From unstructured parallelism to structured parallelism

2.4 Foundation of unstructured and structured parallelism

3 Truly concurrent process algebra

3.1 Operational semantics

3.2 Proof techniques

3.3 Basic algebra for true concurrency

3.4 Algebra for parallelism in true concurrency

3.5 Recursion

3.6 Abstraction

3.7 Placeholder

3.8 Axiomatization for hhp-bisimilarity

3.8.1 APTC with left parallel composition

3.8.2 Recursion

3.8.3 Abstraction

3.9 APTC with asynchronous communication

3.10 Applications

4 Guarded APTC

4.1 Operational semantics

4.2 BATC with guards

4.3 APTC with guards

4.4 Recursion

4.5 Abstraction

5 Distributed APTC

5.1 Static location bisimulations

5.2 BATC with static localities

5.3 APTC with static localities

5.4 Recursion

5.5 Abstraction

6 Building blocks based structured parallel programming

6.1 Orchestration and choreography

6.2 The building block in parallel programming

6.3 Building blocks based parallel programming

7 Modeling and verification of parallel programming languages

7.1 Numbers and arithmetic expressions

7.2 Truth values and Boolean expressions

7.3 Storage locations and assign command

7.4 Commands

7.5 Verification of parallel programs

8 Modeling and verification of parallel programming patterns

8.1 Parallel control patterns

8.1.1 Fork-Join

8.1.2 Map

8.1.3 Stencil

8.1.4 Reduction

8.1.5 Scan

8.1.6 Recurrence

8.2 Parallel data management patterns

8.2.1 Pack

8.2.2 Pipeline

8.2.3 Geometric decomposition

8.2.4 Gather

8.2.5 Scatter.

8.3 Other parallel patterns

8.3.1 Superscalar sequences

8.3.2 Speculative selection

8.3.3 Workpile

8.3.4 Search

8.3.5 Segmentation

8.3.6 Expand

8.3.7 Category reduction

8.3.8 Term graph rewriting

8.4 Verification of parallel programming patterns

9 Modeling and verification of distributed systems

9.1 A model of distributed computations

9.2 Distributed transactions

9.2.1 Two-phase commit protocol

9.2.2 Three-phase commit protocol

9.3 Authentication in distributed systems

9.3.1 Protocols based on symmetric cryptosystems

9.3.2 Protocols based on asymmetric cryptosystems

A A parallel programming language

A.1 Syntax

A.2 Operational semantics

A.2.1 Operational rules of Aexp

A.2.2 Operational rules of Bexp

A.2.3 Operational rules for Com

A.3 Denotational semantics

A.3.1 Denotational semantics of Aexp

A.3.2 Denotational semantics of Bexp

A.3.3 Denotational semantics of Com

A.4 Relations between operational and denotational semantics

A.5 Axiomatic semantics

A.5.1 Extended Hoare rules for parallelism

A.5.2 Soundness of the extended Hoare rules

A.5.3 Completeness of the extended Hoare rules

A.6 Non-determinism

A.7 Communications

A.8 Conflictions

A.9 Structuring algorithm

References

Index

Back Cover.

Notes:

Description based on publisher supplied metadata and other sources.

ISBN:

0-443-24815-X

OCLC:

1432158295