Producer/Consumer : 1 producer, multiple consumers - 1 semaphore, 1 mutex, 1 conditional variable
I'm implementing the Producer/Consumer problem in C with some specific criteria:
- 1 producer, multiple consumers
- using only one mutex, one semaphore, one conditional variable
- All consumers have to consume (like a broadcast), and then, when all that producer have produced is already consumed by consumers, producer will produce more.
I don't know how to implement it using only what I should according to criteria above.
Here is the pseudo code I've wrote using 3 mutexes only and I can't do it according to criteria.
Any help will be appreciated, I have no idea how to use here just one mutex, where to put semaphore and conditional variable.
Pseudo code:
WRITER:
glock(); //lock from reader
write_lock(); //wait till there is no readers
//write the data
write_unlock();
g_unlock();
READER:
g_lock(); //so reader can't read when writer locked g and writting
g_unlock();
read_lock();
reader++;
if (reader == 1)
write_lock(); ///all consumers have consume
//read the data
read_lock();
reader--;
if (reader == 0)
write_unlock();
read_lock();
c producer-consumer
add a comment |
I'm implementing the Producer/Consumer problem in C with some specific criteria:
- 1 producer, multiple consumers
- using only one mutex, one semaphore, one conditional variable
- All consumers have to consume (like a broadcast), and then, when all that producer have produced is already consumed by consumers, producer will produce more.
I don't know how to implement it using only what I should according to criteria above.
Here is the pseudo code I've wrote using 3 mutexes only and I can't do it according to criteria.
Any help will be appreciated, I have no idea how to use here just one mutex, where to put semaphore and conditional variable.
Pseudo code:
WRITER:
glock(); //lock from reader
write_lock(); //wait till there is no readers
//write the data
write_unlock();
g_unlock();
READER:
g_lock(); //so reader can't read when writer locked g and writting
g_unlock();
read_lock();
reader++;
if (reader == 1)
write_lock(); ///all consumers have consume
//read the data
read_lock();
reader--;
if (reader == 0)
write_unlock();
read_lock();
c producer-consumer
add a comment |
I'm implementing the Producer/Consumer problem in C with some specific criteria:
- 1 producer, multiple consumers
- using only one mutex, one semaphore, one conditional variable
- All consumers have to consume (like a broadcast), and then, when all that producer have produced is already consumed by consumers, producer will produce more.
I don't know how to implement it using only what I should according to criteria above.
Here is the pseudo code I've wrote using 3 mutexes only and I can't do it according to criteria.
Any help will be appreciated, I have no idea how to use here just one mutex, where to put semaphore and conditional variable.
Pseudo code:
WRITER:
glock(); //lock from reader
write_lock(); //wait till there is no readers
//write the data
write_unlock();
g_unlock();
READER:
g_lock(); //so reader can't read when writer locked g and writting
g_unlock();
read_lock();
reader++;
if (reader == 1)
write_lock(); ///all consumers have consume
//read the data
read_lock();
reader--;
if (reader == 0)
write_unlock();
read_lock();
c producer-consumer
I'm implementing the Producer/Consumer problem in C with some specific criteria:
- 1 producer, multiple consumers
- using only one mutex, one semaphore, one conditional variable
- All consumers have to consume (like a broadcast), and then, when all that producer have produced is already consumed by consumers, producer will produce more.
I don't know how to implement it using only what I should according to criteria above.
Here is the pseudo code I've wrote using 3 mutexes only and I can't do it according to criteria.
Any help will be appreciated, I have no idea how to use here just one mutex, where to put semaphore and conditional variable.
Pseudo code:
WRITER:
glock(); //lock from reader
write_lock(); //wait till there is no readers
//write the data
write_unlock();
g_unlock();
READER:
g_lock(); //so reader can't read when writer locked g and writting
g_unlock();
read_lock();
reader++;
if (reader == 1)
write_lock(); ///all consumers have consume
//read the data
read_lock();
reader--;
if (reader == 0)
write_unlock();
read_lock();
c producer-consumer
c producer-consumer
edited Nov 22 '18 at 6:59
Ruks
1,091213
1,091213
asked Nov 22 '18 at 6:28
AnnAnn
177
177
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
Here is solution which uses 1 mutex and two conditional variables which can support multiple producers-consumers. Pseudo code is in c++
First read the thread safe buffer queue implementation here.
Then check producer consumer solution https://codeistry.wordpress.com/2018/03/09/unordered-producer-consumer/.
add a comment |
Your Answer
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: "1"
};
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: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
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
});
}
});
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%2fstackoverflow.com%2fquestions%2f53425039%2fproducer-consumer-1-producer-multiple-consumers-1-semaphore-1-mutex-1-con%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Here is solution which uses 1 mutex and two conditional variables which can support multiple producers-consumers. Pseudo code is in c++
First read the thread safe buffer queue implementation here.
Then check producer consumer solution https://codeistry.wordpress.com/2018/03/09/unordered-producer-consumer/.
add a comment |
Here is solution which uses 1 mutex and two conditional variables which can support multiple producers-consumers. Pseudo code is in c++
First read the thread safe buffer queue implementation here.
Then check producer consumer solution https://codeistry.wordpress.com/2018/03/09/unordered-producer-consumer/.
add a comment |
Here is solution which uses 1 mutex and two conditional variables which can support multiple producers-consumers. Pseudo code is in c++
First read the thread safe buffer queue implementation here.
Then check producer consumer solution https://codeistry.wordpress.com/2018/03/09/unordered-producer-consumer/.
Here is solution which uses 1 mutex and two conditional variables which can support multiple producers-consumers. Pseudo code is in c++
First read the thread safe buffer queue implementation here.
Then check producer consumer solution https://codeistry.wordpress.com/2018/03/09/unordered-producer-consumer/.
answered Dec 13 '18 at 8:52
Ashish KhurangeAshish Khurange
5616
5616
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f53425039%2fproducer-consumer-1-producer-multiple-consumers-1-semaphore-1-mutex-1-con%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