Programming languages with algorithmically parallelizing problem
R. Nuriyev
TL;DR
This paper investigates the inherent limitations of programming language constructs that prevent automatic parallelization and proposes modifications to overcome these barriers, enabling algorithmic solutions for parallelizing problems.
Contribution
It identifies language features causing algorithmic insolvability of parallelization and introduces modifications to make such problems algorithmically solvable.
Findings
Identified language constructs that hinder automatic parallelization.
Proposed modifications enable algorithmic solutions for parallelizing problems.
Provides a framework for designing languages with better parallelization capabilities.
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Processing Techniques · Graph Theory and Algorithms · Distributed and Parallel Computing Systems