Parallel algorithms and correctness in parallel programs
From MaRDI portal
Parallel algorithms (PA) models represented are examined as an asynchronous generalization of sequential statement algorithms. Languages that allow non-deadlocking and uniqueness of parallel programs to be established in their text under the conditions of cycle completeness are proposed for writing and marking PAs.
Recommendations
Cited in
(19)- Boolean models and planning methods for parallel abstract programs
- P-functions and Boolean matrix factorization. A unified approach for wired, programmed and microprogrammed implementations of discrete algorithms
- Checking the performance of parallel programs with common data
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic
- On the correctness of parallel algorithms
- Analysis of the correctness of a parallel program for set partitioning
- Parallel program schemata
- Parallel programs implementing abstract data type operations
- scientific article; zbMATH DE number 4133475 (Why is no real title available?)
- scientific article; zbMATH DE number 4199622 (Why is no real title available?)
- Correctness properties in a shared-memory parallel language
- scientific article; zbMATH DE number 6533780 (Why is no real title available?)
- scientific article; zbMATH DE number 4020458 (Why is no real title available?)
- scientific article; zbMATH DE number 4087003 (Why is no real title available?)
- scientific article; zbMATH DE number 4092753 (Why is no real title available?)
- scientific article; zbMATH DE number 4117855 (Why is no real title available?)
- Generic parallel algorithms
- scientific article; zbMATH DE number 3892585 (Why is no real title available?)
- Correctness of recursive parallel nondeterministic flow programs
This page was built for publication: Parallel algorithms and correctness in parallel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079951)
