Mixing
Multithreading via Baristi / synchronization
Theoretical construct:
I have a very big lounge there are working about 64 baristi (Threads).
There are comming about 1000 customers at once to get a coffee .
The customers are germans so they stay in 64 chains in front of 64 baristi.
Every baristi will have about 15-16 customers in his queue.
The baristi are very fast, the fastest is about 10ms fast, and the slowest is a maximum of 50ms fast.
Every barista work by first-in-first-out.
I simulate this in a Program and its a Unit-Test.
public class MassiveWorkTest {
private int timeFac = 10;
private int worksFinished = 0;
private boolean endCalled = false;
public void testBarista() {
byte baristi = (byte) 64;
BaristiQueuePool b = new BaristiQueuePool(baristi, "TestBarista", new Runnable() {
@Override
public void run() {
endCalled = true;
}
});
Random r = new SecureRandom();
long theoreticalWorkTime = 0;
for (int i = 0; i < 10000; i++) {
final int time = 10+r.nextInt(40);
theoreticalWorkTime += time;
b.execute(new Runnable() {
@Override
public void run() {
try {
Thread.currentThread().sleep(time);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
});
}
theoreticalWorkTime /= baristi;
long theoreticalOverallTime = theoreticalWorkTime + theoreticalWorkTime / 5;
assert b.awaitTermination((int) theoreticalOverallTime, TimeUnit.MILLISECONDS);
assert endCalled;
assert worksFinished == 0;
}
}
Now, my computer is pretty fast, but others might not. I increase the timeout by 20%.
Sometimes 20% is not enough and the test fails. This is bad because someone can not build.
How to calculate the perfect not-working-time of the baristi?
java multithreading simulation
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
add a comment |
Theoretical construct:
I have a very big lounge there are working about 64 baristi (Threads).
There are comming about 1000 customers at once to get a coffee .
The customers are germans so they stay in 64 chains in front of 64 baristi.
Every baristi will have about 15-16 customers in his queue.
The baristi are very fast, the fastest is about 10ms fast, and the slowest is a maximum of 50ms fast.
Every barista work by first-in-first-out.
I simulate this in a Program and its a Unit-Test.
public class MassiveWorkTest {
private int timeFac = 10;
private int worksFinished = 0;
private boolean endCalled = false;
public void testBarista() {
byte baristi = (byte) 64;
BaristiQueuePool b = new BaristiQueuePool(baristi, "TestBarista", new Runnable() {
@Override
public void run() {
endCalled = true;
}
});
Random r = new SecureRandom();
long theoreticalWorkTime = 0;
for (int i = 0; i < 10000; i++) {
final int time = 10+r.nextInt(40);
theoreticalWorkTime += time;
b.execute(new Runnable() {
@Override
public void run() {
try {
Thread.currentThread().sleep(time);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
});
}
theoreticalWorkTime /= baristi;
long theoreticalOverallTime = theoreticalWorkTime + theoreticalWorkTime / 5;
assert b.awaitTermination((int) theoreticalOverallTime, TimeUnit.MILLISECONDS);
assert endCalled;
assert worksFinished == 0;
}
}
Now, my computer is pretty fast, but others might not. I increase the timeout by 20%.
Sometimes 20% is not enough and the test fails. This is bad because someone can not build.
How to calculate the perfect not-working-time of the baristi?
java multithreading simulation
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39
add a comment |
Theoretical construct:
I have a very big lounge there are working about 64 baristi (Threads).
There are comming about 1000 customers at once to get a coffee .
The customers are germans so they stay in 64 chains in front of 64 baristi.
Every baristi will have about 15-16 customers in his queue.
The baristi are very fast, the fastest is about 10ms fast, and the slowest is a maximum of 50ms fast.
Every barista work by first-in-first-out.
I simulate this in a Program and its a Unit-Test.
public class MassiveWorkTest {
private int timeFac = 10;
private int worksFinished = 0;
private boolean endCalled = false;
public void testBarista() {
byte baristi = (byte) 64;
BaristiQueuePool b = new BaristiQueuePool(baristi, "TestBarista", new Runnable() {
@Override
public void run() {
endCalled = true;
}
});
Random r = new SecureRandom();
long theoreticalWorkTime = 0;
for (int i = 0; i < 10000; i++) {
final int time = 10+r.nextInt(40);
theoreticalWorkTime += time;
b.execute(new Runnable() {
@Override
public void run() {
try {
Thread.currentThread().sleep(time);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
});
}
theoreticalWorkTime /= baristi;
long theoreticalOverallTime = theoreticalWorkTime + theoreticalWorkTime / 5;
assert b.awaitTermination((int) theoreticalOverallTime, TimeUnit.MILLISECONDS);
assert endCalled;
assert worksFinished == 0;
}
}
Now, my computer is pretty fast, but others might not. I increase the timeout by 20%.
Sometimes 20% is not enough and the test fails. This is bad because someone can not build.
How to calculate the perfect not-working-time of the baristi?
java multithreading simulation
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
Theoretical construct:
I have a very big lounge there are working about 64 baristi (Threads).
There are comming about 1000 customers at once to get a coffee .
The customers are germans so they stay in 64 chains in front of 64 baristi.
Every baristi will have about 15-16 customers in his queue.
The baristi are very fast, the fastest is about 10ms fast, and the slowest is a maximum of 50ms fast.
Every barista work by first-in-first-out.
I simulate this in a Program and its a Unit-Test.
public class MassiveWorkTest {
private int timeFac = 10;
private int worksFinished = 0;
private boolean endCalled = false;
public void testBarista() {
byte baristi = (byte) 64;
BaristiQueuePool b = new BaristiQueuePool(baristi, "TestBarista", new Runnable() {
@Override
public void run() {
endCalled = true;
}
});
Random r = new SecureRandom();
long theoreticalWorkTime = 0;
for (int i = 0; i < 10000; i++) {
final int time = 10+r.nextInt(40);
theoreticalWorkTime += time;
b.execute(new Runnable() {
@Override
public void run() {
try {
Thread.currentThread().sleep(time);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
});
}
theoreticalWorkTime /= baristi;
long theoreticalOverallTime = theoreticalWorkTime + theoreticalWorkTime / 5;
assert b.awaitTermination((int) theoreticalOverallTime, TimeUnit.MILLISECONDS);
assert endCalled;
assert worksFinished == 0;
}
}
Now, my computer is pretty fast, but others might not. I increase the timeout by 20%.
Sometimes 20% is not enough and the test fails. This is bad because someone can not build.
How to calculate the perfect not-working-time of the baristi?
java multithreading simulation
java multithreading simulation
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
asked Nov 21 '18 at 13:40
Peter RaderPeter Rader
4,38372874
4,38372874
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39
add a comment |
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39
add a comment |
0
active
oldest
votes
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%2f53413356%2fmultithreading-via-baristi-synchronization%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
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%2f53413356%2fmultithreading-via-baristi-synchronization%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
Such calculations usually are made with some simulation library. They act in model time and so work very fast. Just google for "java simulation library".
– Alexei Kaigorodov
Nov 21 '18 at 16:39