Programming languages with algorithmically parallelizing problem

2008/10/31 by Nuriyev, R.
#Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)

paper · doi:10.48550/arxiv.0810.5596

Abstract

The study consists of two parts. Objective of the first part is modern language constructions responsible for algorithmically insolvability of parallelizing problem. Second part contains several ways to modify the constructions to make the problem algorithmically solvable

Related

• Non procedural language for parallel programs
• Development of parallel programs on shared data-structures -- Revised version
• Language properties and Grammar of Parallel and Series Parallel Languages
• Structured Parallel Programming
• Is Parallel Programming Hard, And, If So, What Can You Do About It? (Release v2023.06.11a)