Critical section around given key
$begingroup$
I would like to know if there is any pre-existing implmentation of my solution. So I don't have to reinvent the wheel.
What I'm trying to create is an utility which allows me to create critical section around given object. Can you check my code if there are any errors in my implemention?
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;
public class MultiCriticalSection {
private final ConcurrentHashMap<Object, ExtendReentrantLock> locks = new ConcurrentHashMap<>();
private final Object globalLock = new Object();
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public <T> T doWithLock(final Object key, Callable<T> fce) throws Exception {
ExtendReentrantLock lock = getLock(key);
try {
return fce.call();
} finally {
freeLock(key, lock);
}
}
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public void doWithLock(final Object key, Runnable fce) {
ExtendReentrantLock lock = getLock(key);
try {
fce.run();
} finally {
freeLock(key, lock);
}
}
/**
* Release the lock. If there are no threads waiting and the lock is marked for removal it will be removed.
*/
private void freeLock(final Object key, final ExtendReentrantLock lock) {
synchronized (globalLock) {
if (!lock.hasQueuedThreads() && lock.remove) {
locks.remove(key);
}
lock.remove = true;
lock.unlock();
}
}
/**
* Acquire lock. If there are no locks for given object it is created.
* If there is a lock for given object and it is locked the removal flag is cleared. This way the currently running thread will not
* remove the lock from memory.
*/
private ExtendReentrantLock getLock(final Object key) {
ExtendReentrantLock lock;
synchronized (globalLock) {
lock = locks.computeIfAbsent(key, o -> new ExtendReentrantLock());
if (lock.isLocked()) {
lock.remove = false;
}
}
lock.lock();
return lock;
}
/**
* Utility class adding a flag to ReentrantLock.
*/
private class ExtendReentrantLock extends ReentrantLock {
boolean remove = true;
}
}
The goal is not to allow 2 concurrent threads to operate on the same data. That is only one object can operate on given object at same time.
The other thread will be blocked, until the working thread is finished. The locks are automatically cleared when there are no threads running.
Thanks for any tips.
java concurrency locking
New contributor
$endgroup$
add a comment |
$begingroup$
I would like to know if there is any pre-existing implmentation of my solution. So I don't have to reinvent the wheel.
What I'm trying to create is an utility which allows me to create critical section around given object. Can you check my code if there are any errors in my implemention?
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;
public class MultiCriticalSection {
private final ConcurrentHashMap<Object, ExtendReentrantLock> locks = new ConcurrentHashMap<>();
private final Object globalLock = new Object();
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public <T> T doWithLock(final Object key, Callable<T> fce) throws Exception {
ExtendReentrantLock lock = getLock(key);
try {
return fce.call();
} finally {
freeLock(key, lock);
}
}
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public void doWithLock(final Object key, Runnable fce) {
ExtendReentrantLock lock = getLock(key);
try {
fce.run();
} finally {
freeLock(key, lock);
}
}
/**
* Release the lock. If there are no threads waiting and the lock is marked for removal it will be removed.
*/
private void freeLock(final Object key, final ExtendReentrantLock lock) {
synchronized (globalLock) {
if (!lock.hasQueuedThreads() && lock.remove) {
locks.remove(key);
}
lock.remove = true;
lock.unlock();
}
}
/**
* Acquire lock. If there are no locks for given object it is created.
* If there is a lock for given object and it is locked the removal flag is cleared. This way the currently running thread will not
* remove the lock from memory.
*/
private ExtendReentrantLock getLock(final Object key) {
ExtendReentrantLock lock;
synchronized (globalLock) {
lock = locks.computeIfAbsent(key, o -> new ExtendReentrantLock());
if (lock.isLocked()) {
lock.remove = false;
}
}
lock.lock();
return lock;
}
/**
* Utility class adding a flag to ReentrantLock.
*/
private class ExtendReentrantLock extends ReentrantLock {
boolean remove = true;
}
}
The goal is not to allow 2 concurrent threads to operate on the same data. That is only one object can operate on given object at same time.
The other thread will be blocked, until the working thread is finished. The locks are automatically cleared when there are no threads running.
Thanks for any tips.
java concurrency locking
New contributor
$endgroup$
add a comment |
$begingroup$
I would like to know if there is any pre-existing implmentation of my solution. So I don't have to reinvent the wheel.
What I'm trying to create is an utility which allows me to create critical section around given object. Can you check my code if there are any errors in my implemention?
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;
public class MultiCriticalSection {
private final ConcurrentHashMap<Object, ExtendReentrantLock> locks = new ConcurrentHashMap<>();
private final Object globalLock = new Object();
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public <T> T doWithLock(final Object key, Callable<T> fce) throws Exception {
ExtendReentrantLock lock = getLock(key);
try {
return fce.call();
} finally {
freeLock(key, lock);
}
}
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public void doWithLock(final Object key, Runnable fce) {
ExtendReentrantLock lock = getLock(key);
try {
fce.run();
} finally {
freeLock(key, lock);
}
}
/**
* Release the lock. If there are no threads waiting and the lock is marked for removal it will be removed.
*/
private void freeLock(final Object key, final ExtendReentrantLock lock) {
synchronized (globalLock) {
if (!lock.hasQueuedThreads() && lock.remove) {
locks.remove(key);
}
lock.remove = true;
lock.unlock();
}
}
/**
* Acquire lock. If there are no locks for given object it is created.
* If there is a lock for given object and it is locked the removal flag is cleared. This way the currently running thread will not
* remove the lock from memory.
*/
private ExtendReentrantLock getLock(final Object key) {
ExtendReentrantLock lock;
synchronized (globalLock) {
lock = locks.computeIfAbsent(key, o -> new ExtendReentrantLock());
if (lock.isLocked()) {
lock.remove = false;
}
}
lock.lock();
return lock;
}
/**
* Utility class adding a flag to ReentrantLock.
*/
private class ExtendReentrantLock extends ReentrantLock {
boolean remove = true;
}
}
The goal is not to allow 2 concurrent threads to operate on the same data. That is only one object can operate on given object at same time.
The other thread will be blocked, until the working thread is finished. The locks are automatically cleared when there are no threads running.
Thanks for any tips.
java concurrency locking
New contributor
$endgroup$
I would like to know if there is any pre-existing implmentation of my solution. So I don't have to reinvent the wheel.
What I'm trying to create is an utility which allows me to create critical section around given object. Can you check my code if there are any errors in my implemention?
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.locks.ReentrantLock;
public class MultiCriticalSection {
private final ConcurrentHashMap<Object, ExtendReentrantLock> locks = new ConcurrentHashMap<>();
private final Object globalLock = new Object();
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public <T> T doWithLock(final Object key, Callable<T> fce) throws Exception {
ExtendReentrantLock lock = getLock(key);
try {
return fce.call();
} finally {
freeLock(key, lock);
}
}
/**
* Run critical section guarded by given object. It is potentionally blocking code!
*/
public void doWithLock(final Object key, Runnable fce) {
ExtendReentrantLock lock = getLock(key);
try {
fce.run();
} finally {
freeLock(key, lock);
}
}
/**
* Release the lock. If there are no threads waiting and the lock is marked for removal it will be removed.
*/
private void freeLock(final Object key, final ExtendReentrantLock lock) {
synchronized (globalLock) {
if (!lock.hasQueuedThreads() && lock.remove) {
locks.remove(key);
}
lock.remove = true;
lock.unlock();
}
}
/**
* Acquire lock. If there are no locks for given object it is created.
* If there is a lock for given object and it is locked the removal flag is cleared. This way the currently running thread will not
* remove the lock from memory.
*/
private ExtendReentrantLock getLock(final Object key) {
ExtendReentrantLock lock;
synchronized (globalLock) {
lock = locks.computeIfAbsent(key, o -> new ExtendReentrantLock());
if (lock.isLocked()) {
lock.remove = false;
}
}
lock.lock();
return lock;
}
/**
* Utility class adding a flag to ReentrantLock.
*/
private class ExtendReentrantLock extends ReentrantLock {
boolean remove = true;
}
}
The goal is not to allow 2 concurrent threads to operate on the same data. That is only one object can operate on given object at same time.
The other thread will be blocked, until the working thread is finished. The locks are automatically cleared when there are no threads running.
Thanks for any tips.
java concurrency locking
java concurrency locking
New contributor
New contributor
New contributor
asked 1 hour ago
cervotoccervotoc
61
61
New contributor
New contributor
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
cervotoc is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f211901%2fcritical-section-around-given-key%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
cervotoc is a new contributor. Be nice, and check out our Code of Conduct.
cervotoc is a new contributor. Be nice, and check out our Code of Conduct.
cervotoc is a new contributor. Be nice, and check out our Code of Conduct.
cervotoc is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f211901%2fcritical-section-around-given-key%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown