In what meaningful ways does Erlang prevent race conditions in concurrent programming?
Reading about concurrency in Erlang, reminds me of the Akka concurrency toolkit. Both give you tools to prevent or limit race conditions. But you can send links to mutable data to other processes using the Akka toolkit, which is still unsafe. I see Akka as a useful tool, but it does not provide protection against out-of-order access to objects and data leading to race-conditions, deadlock, and/or starvation. It doesn’t prevent you from writing unsafe code the way Java or C# protects you from writing most of the kinds of memory leaks you can write in C++ (you can still create memory leaks in Java by tricking the garbage collector, but it is less of a problem than having to remember to free every byte you allocate).
What is a good script language for writing server administration tasks? [closed]
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for […]
Why five dining philosophers?
I was wondering why the Dining philosophers problem is based on a five philosophers case. Why not four?
How bad would it be to obtain a lock on every object?
Imagine a hypothetical programming environment that is largely like Java or .NET, i.e. object-oriented, garbage-collected, etc., but with one small change:
The difference between “concurrent” and “parallel” execution?
What is the difference between the terms concurrent and parallel execution? I’ve never quite been able to grasp the distinction.
Multiple threads and single output source
For the sake of an exercise, say you have an input file with a series of lines of text with the objective of reversing their respective character sequences.
How can I benchmark concurrent key-value stores?
I have some concurrent key-value store implementations that are implemented with hash tables and search trees that I would like to compare. I would like to benchmark them with a real world application where several threads stresses the key-value stores.
Would Task-based programming in C++ require new language standard features?
So I saw this video on Youtube with all these C++ masters on GoingNative 2012 : Interactive panel where everybody could ask the questions.
Uses of persistent data structures in non-functional languages
Languages that are purely functional or near-purely functional benefit from persistent data structures because they are immutable and fit well with the stateless style of functional programming.
Which parallel pattern to use?
I need to write a server application that fetches mails from different mail servers/mailboxes and then needs to process/analyze these mails.
Traditionally, I would do this multi-threaded, launching a thread for fetching mails (or maybe one per mailbox) and then process the mails.