Operating system ( race condition)

Question

1.00/5 (1 vote)

See more:

The pseudocode of Figure 6.15 illustrates the basic push() and pop() operations of the based stack
array. Assuming that this algorithm can be used in a concurrent execution environment, return
answer the following questions:
a. Which data has competitive status?
b. How can the competitive situation be corrected?

What I have tried:

push(item){
    if (top < SIZE){
        stack[top] = item;
        top++;
    }
    else
        ERROR
}

pop(){
    if (!isempty()){
        top--;
        return stack[top];
    }
    else
        ERROR
}

isempty(){
    if (top == 0)
        return true;
    else
        return false;
}

Posted 3-Aug-21 23:33pm

Nguyễn Tiến Phát

Updated 4-Aug-21 2:08am

Add a Solution

Comments

CHill60 4-Aug-21 6:27am

Do you have a specific question or are you just asking us to do your homework assignment for you?

Nguyễn Tiến Phát 4-Aug-21 9:35am

No. I just want the way to approach the problem

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Greg Utas · Accepted Answer · 2021-08-04T02:08:00

To answer part (a), look at each function and think about what would happen if software on CPU1 calls the function and software on CPU2 also calls the same function (or even another of the stack functions), so that both processors are using the stack at the same time.

Even on a single-processor system, a similar thing happens if one thread calls a stack function, is preempted somewhere in the middle of that function, and the next thread also calls a stack function.

Once you've found ways that concurrent calls to push() and pop() could corrupt the stack, or isempty() could return the wrong result, you can answer part (b) by choosing a technique that eliminates race conditions. Here, minimizing overhead is the goal, and the techniques chosen could be different on a single-processor system and a multiprocessor system.