All Questions
Tagged with process-scheduling concurrency
11 questions
6
votes
1
answer
295
views
How to use Parallel Semaphores for Dining Philosophers Problem
I am in an intro to OS class and we are learning about mutual exclusion and semaphores. One classical problem we learned about was the dining philosophers problem. My professor touched on the ...
5
votes
1
answer
5k
views
example for weakly fair v.s. strongly fair scheduling in concurrency
I am having difficult time understanding the difference between weakly fair and strongly fair schedulers. Can someone provide an example and explain how they are different?
for reference, here are ...
- 153
3
votes
1
answer
4k
views
User level threads are transparent to the kernel?
Find whether given statement True or False? Explain.
User level threads are transparent to the kernel?
My attempt :
False. Since, user level threads are managed by a user level library however, they ...
3
votes
2
answers
2k
views
Is bounded waiting ensured in given version of Dekker's solution for critical section problem?
William Stallings discuss various step by step process in developing Dekker's algorithm in his Operating Systems book. In process, he reaches to following version of algorithm (which is incomplete as ...
- 1,773
2
votes
0
answers
134
views
Processes concurrency
I am getting ready for my end of year exams and I got stuck on this question.
Consider the following 3-process concurrent program which uses semaphores S1,
...
- 21
2
votes
0
answers
45
views
How can I talk about priority inversion if it's impossible to specify priority?
In the paper:
Leslie Lamport: What It Means for a Concurrent Program to
Satisfy a Specification: Why No One Has Specified Priority; ACM Symp Principles of Programming Languages, (POPL-12):78-83, ...
- 17.8k
1
vote
3
answers
2k
views
How can a spinlock progress when it's busy-waiting?
I read that in spinlock, process keeps on waiting for the lock continuously in a loop until it receives signal(lock) or ...
- 993
1
vote
1
answer
54
views
Why does taking advantage of locality matter in multithreaded systems?
As we all know, when a given thread/process reaches a memory address it does not have cached, the execution will (for the most part) freeze up until said data is fetched from memory. What I don't ...
- 13
1
vote
1
answer
551
views
Can a schedule be conflict serializable but not serializable?
A schedule is called conflict serializable if it can be transformed into a serial schedule by swapping non-conflicting operations. Then,
My question is: Can a schedule be conflict serializable but ...
user97496
0
votes
3
answers
88
views
Trading time for work; does this concurrency phenomenon have a name?
Recently, my girlfriend and I were trying to get out of the house, when I encountered a phenomenon which I thought might be analogous to a tradeoff in concurrent systems.
Here's the real world setup.
...
- 133
-3
votes
1
answer
131
views
Which process comes first?
Let's say we have 3 processes:
Process 1 service time 6 arrival time 0
Process 2 service time 2 arrival time 1
Process 3 service time 5 arrival time 3
We know that:
after 1 time, process 2 will ...
user45664