question
active
question:which-parallel-language-should-be-used-for-new-compute-intensive-applicationsWhich parallel language should be used for new compute-intensive applications?
Motivating question for the paper's comparative analysis of parallel programming approaches.
Neighborhood — ranked by edge-count
Claims (1)
claim
- The central thesis of the paper, stated explicitly in the introduction.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Argument that recursion equations are inappropriate for many important parallel programs.
- Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
- Asserts that Linda's uncoupled style reduces cognitive load.
- Claim that OOP per se does not solve any parallel programming problems.
- Strong assertion that the enthusiasm for 'concurrent object-oriented programming' is misplaced; objects do not inherently help with parallelism.
- Central design question underlying the comparison with functional approaches.
- A major competing approach to parallel programming based on instantiating objects with embedded active processes and monitors for synchronization.