Persistent (aka immutable) data structures in functional programming sidestep issues of shared memory mutual exclusion, and thus also issues such as data races that arise and which may be difficult to debug. But persistence requires more memory resources. On the other hand, wait-free versions of data structures guarantee that the crash of other threads will not affect the execution of a thread. Can anything be said about the circumstances that determine which solution is preferable?

| cite | improve this question | | | | |

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.