Welcome to the Linux Foundation Forum!

Deadlock problem

Posts: 1
edited September 2015 in Kernel Development

I believe that the deadlock problem can be solved if we add a bounded time to the circular wait. By doing so we can eliminate the hold and wait criteria for the deadlock, thus deadlock is prevented. Picture a 4 way traffic stop and all the lights turn read, a timer then goes on which allows pedestrians to walk in all directions. Without the time, there would be a deadlock because the cars would not be able to move but when the time hits zero the light on one direction turns green. Coding this can be possible adding a time constraint in the while loop or busy wait which illustrates the circular wait. Is this possible?

Welcome!

It looks like you're new here. Sign in or register to get started.
Sign In

Welcome!

It looks like you're new here. Sign in or register to get started.
Sign In

Categories

Upcoming Training