Examples of problems for parallel computing

Question

Currently, there are many paradigms and parallel programming methods. Programmatic transactional memory, actors, general concurrency state, tuple spaces, and much, much more.

However, I find it missing, this is a library of interesting test problems for concurrency. One well-known example is the “Dining Philosophers Problem,” which is neither complex, motivating, nor realistic. Then there are many parallel algorithms (matrix multiplication, rendering, common nested parallelism data) that require only work distribution, but not real concurrency with communication between execution threads.

So, can someone point me to some interesting problems that require real concurrency in an interactive, perhaps even distributed environment that are simple enough to use as examples of concurrency paradigms? Ideally, I want to find a set of problems to serve as a “test flaw” for the concurrency paradigms (or emphasize their differences, since each paradigm has its own strengths and weaknesses).

Any help is much appreciated :)

Answer 1

Earlier, I considered this exact problem by first proposing to myself some parallel programming paradigms: p

, , -, . , , , ( ).

parallelism, . parallelism (.. , , , ), , , . , , . , , concurrency. concurrency , , , , ( ), . "" , (.. "" "" , ).

, , , , . Erlang, Occam ( Occam-pi), Alice, CML, Concurrent Haskell .., , , , ( , , !). , , , pi-calculus, CCS CSP, , . , , .