AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1455582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ |
scientific article; zbMATH DE number 1455582 |
Statements
AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (English)
0 references
5 June 2000
0 references
bulk-synchronous parallel computation
0 references
0 references
0 references
0 references
0 references
0.8554065
0 references
0.84912187
0 references
0.84821916
0 references
In Bulk-Synchronous Parallel (BSP) computation a superstep comprises a collection of concurrently executed processes with initial and terminal synchronizations. Data transfer between processes is realized through asynchronous communications. BSP programs can be organized either as explicit compositions of supersteps or as parallel compositions of threads (processes) which include synchronization alignment operations. In this paper axiomatic semantics for the two approaches are proposed: in both cases the semantics are based on a new form of multiple substitution -- predicate substitution which generalizes previous definitions of substitution. Predicate substitution together with global synchronization provide a means of linking state based and process semantics of BSP. Features of both models are illustrated through correctness proofs of matrix multiplication programs.
0 references
