lock-free Questions
4
I have a question about the use of lock free queues.
Suppose I have a single-producer single-consumer queue, where the
producer and consumer are bound to separate cores. The queue elements
are buf...
Dentiform asked 7/8, 2011 at 19:33
3
Solved
Does anyone know if it is possible to do lock-free programming in Haskell? I'm interested both in the question of whether the appropriate low-level primitives are available, and (if they are) on an...
4
Solved
Is there a library that implements lock-free algorithms(queue, linked list and others) written in C (not in C++)? I've taken a look at some libraries like Intel's, but I would like to use generic l...
6
Solved
I'm implementing a lock-free single producer single consumer queue for an intensive network application. I have a bunch of worker threads receiving work in their own separate queues, which they the...
2
Solved
I have been searching lately for information on how to construct a lock-free priority queue in C#. I have yet to even find an implementation in any language, or a decent paper on the matter. I have...
Pea asked 15/5, 2011 at 1:35
3
I'm trying to understand the low-level mechanics of CAS on x86/x64 and I'd really appreciate some help/insight.
The reason I've been thinking about this is that I'm trying to reason about exponent...
Funderburk asked 19/4, 2011 at 17:5
3
Solved
Here is some code from a lock-free queue using compareAndSet (in Java):
public void enq(T value) {
Node newNode = new Node(value);
while(true) {
Node last = tail.get();
Node next = last.next.g...
Reticulate asked 23/3, 2011 at 13:11
3
Solved
Anyone have any good experience with a lock-free memory allocator for C/c++?
I have looked into boost, and libcds, but I am unsure about which library to use.
Background, I have been researching ...
Calcifuge asked 25/3, 2011 at 4:28
3
Solved
Is there a lock-free & thread-safe data structure that implements IList?
Naturally by lock-free I mean an implementation that makes no use of locking primitives in .NET but rather uses interlo...
Coquito asked 21/2, 2011 at 19:46
7
Solved
I'm told that Clojure has lockless concurrency and that this is Important.
I've used a number of languages but didn't realize they were performing locks behind the scenes.
Why is this an advantag...
Nascent asked 1/9, 2009 at 5:53
1
Solved
I am reading up on Transactional Memory (TM), and one of the papers I'm reading says[1]:
Indeed, it was two nonblocking algorithms, the obstruction-free DSTM and lock-free FSTM that reinvigorated ...
Sennet asked 13/12, 2010 at 19:7
21
Solved
In my multithreaded application and I see heavy lock contention in it, preventing good scalability across multiple cores. I have decided to use lock free programming to solve this.
How can I write...
Bettencourt asked 18/9, 2008 at 13:18
5
Solved
I know when reading from a location of memory which is written to by several threads or processes the volatile keyword should be used for that location like some cases below but I want to know more...
Massie asked 9/11, 2010 at 18:1
3
In preperation for my upcoming Concurrent Systems exam, I am trying to complete some questions from the text book "The Art of Multiprocessor Programming". One question is bugging me:
Exercise 12...
Abomasum asked 29/10, 2010 at 13:22
4
Solved
I have a bunch of threads that are doing lots of communication with each other.
I would prefer this be lock free.
For each thread, I want to have a mailbox, where other threads can send it message...
5
I've found following article: Use GCC-provided atomic lock operations to replace pthread_mutex_lock functions
It refers to GCC Atomic Builtins.
What the article suggest, is to use GCC atomic buil...
Gazette asked 21/7, 2009 at 8:47
9
Solved
Is there any small library, that wrapps various processors' CAS-like operations into macros or functions, that are portable across multiple compilers?
PS. The atomic.hpp library is inside boost::i...
Irita asked 21/7, 2009 at 10:25
2
Solved
I need to implement a lock-free skip list. I tried to look for papers. Unfortunatly all I found was lock-free single linked lists (in many flavors). However how to implement lock-free skip list?
Estipulate asked 13/8, 2010 at 16:52
3
Solved
I am trying to improve my understanding of memory barriers. Suppose we have a weak memory model and we adapt Dekker's algorithm. Is it possible to make it work correctly under the weak memory model...
Pignus asked 21/7, 2010 at 23:57
1
Solved
Joe Duffy, gives 6 rules that describe the CLR 2.0+ memory model (it's actual implementation, not any ECMA standard) I'm writing down my attempt at figuring this out, mostly as a way of rubber duck...
Priapism asked 31/5, 2010 at 3:39
4
I have got an in memory data structure that is read by multiple threads and written by only one thread. Currently I am using a critical section to make this access threadsafe. Unfortunately this ha...
Blurt asked 26/5, 2009 at 7:48
3
I intend to perform opening for reading a single file from many threads using std::ifstream. My concern is if std::ifstream is thread-safe & lock-free?
More details:
I use g++ 4.4 on Ubuntu &a...
Libnah asked 2/5, 2010 at 17:34
1
Possible Duplicate:
Is there a production ready lock-free queue or hash implementation in C++
I am looking for a well-tested, publicly available C/C++ implementation of a lock free qu...
3
Solved
In my attempt to develope a thread-safe C++ weak pointer template class, I need to check a flag that indicating the object is still alive, if yes then increment the object's reference count and I n...
Roquelaure asked 4/3, 2010 at 4:22
2
I'm looking for a lock-free design conforming to these requisites:
a single writer writes into a structure and a single reader reads from this structure (this structure exists already and is safe...
Camphorate asked 25/2, 2010 at 15:7
© 2022 - 2024 — McMap. All rights reserved.