Presentation is loading. Please wait.

Presentation is loading. Please wait.

More on Semaphores Andy Wang Operating Systems COP 4610 / CGS 5765.

Published byElfrieda McCoy Modified over 8 years ago

Similar presentations

Presentation on theme: "More on Semaphores Andy Wang Operating Systems COP 4610 / CGS 5765."— Presentation transcript:

1 More on Semaphores Andy Wang Operating Systems COP 4610 / CGS 5765

2 The Pigeon Network Scenario Pigeons are good message carriers Pigeons are good message carriers Reasonably reliable Reasonably reliable Relatively fast for less developed rural areas Relatively fast for less developed rural areas Can sense magnetic field lines Can sense magnetic field lines

3 Here is the Story… There are two towns—Mars and Venus There are two towns—Mars and Venus Mars has all male pigeons Mars has all male pigeons Venus has all female pigeons Venus has all female pigeons Each town delivers messages to the other Each town delivers messages to the other By sending a pigeon through the shared flying path By sending a pigeon through the shared flying path And waiting for the same pigeon to fly back as an acknowledgement And waiting for the same pigeon to fly back as an acknowledgement

4 Here is the Story… Based on experience Based on experience Whenever both towns send messages simultaneously, the reliability drops significantly Whenever both towns send messages simultaneously, the reliability drops significantly Pigeons of opposite genders decide to take excursions Pigeons of opposite genders decide to take excursions Goals of a pigeon network: Goals of a pigeon network: Efficiency Efficiency Fairness Fairness

5 Developing the Solution Can we map it to already solved problems? Can we map it to already solved problems? Standard synchronization problems: Standard synchronization problems: Bounded buffer (producers and consumers) Bounded buffer (producers and consumers) Fairness (readers and writers) Fairness (readers and writers) Resource allocation (dining philosophers) Resource allocation (dining philosophers) Pigeon network is under the reader-writer category Pigeon network is under the reader-writer category

6 Step 1: Visualization Identify Identify Shared resources Shared resources Scope of shared resources Scope of shared resources Mars Venus flying path

7 Step 1: Visualization Identify Identify Shared resource: flying path Shared resource: flying path Scope of the shared resource: global Scope of the shared resource: global Mars Venus flying path

8 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

9 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

10 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path something you don’t see everyday…

11 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

12 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

13 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

14 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

15 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

16 Simplest Implementation semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath);P(flyingPath); V(flyingPath); Mars Venus flying path

17 Simplest Implementation + Simple + Fair - Not efficient Only one pigeon can fly at a time Only one pigeon can fly at a time Venusians love to fly in groups… Venusians love to fly in groups…

18 Allowing Multiple Venusians in Transit Resources and scopes: flying path (global), a counter for Venusians in transit (Venus) Resources and scopes: flying path (global), a counter for Venusians in transit (Venus) Mars Venus flying path

19 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

20 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; // == 1 if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

21 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; // == 2 if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

22 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; // == 2 if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

23 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; // == 2 if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

24 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

25 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path

26 Allowing Multiple Venusians in Transit semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); int VenusiansInTransit = 0; ++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);} Mars Venus flying path Date? Sure.

27 Allowing Multiple Venusians in Transit Revised semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

28 Allowing Multiple Venusians in Transit Revised semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

29 Allowing Multiple Venusians in Transit Revised semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

30 Allowing Multiple Venusians in Transit Revised semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);} // send the message --VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path Wait!

31 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

32 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

33 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

34 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

35 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

36 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

37 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

38 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

39 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

40 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

41 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

42 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

43 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

44 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

45 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

46 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

47 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

48 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

49 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

50 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

51 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

52 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

53 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

54 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

55 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

56 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

57 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

58 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

59 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

60 Allowing Multiple Venusians in Transit Revised Again semaphore flyingPath = 1; P(flyingPath); // send the message V(flyingPath); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock); Mars Venus flying path

61 Allowing Multiple Venusians in Transit Revised Again Efficient for Venusians Efficient for Venusians Not fair for Martians Not fair for Martians

62 Allowing Multiple Venusians and Martians in Transit semaphore flyingPath = 1; semaphore MartianLock = 1; int MartiansInTransit = 0; P(MartianLock);++MartiansInTransit; if (MartiansInTransit == 1) { P(flyingPath);}V(MartianLock); // send the message P(MartianLock);--MartiansInTransit; if (MartiansInTransit == 0) { V(flyingPath);}V(MartianLock); semaphore VenusianLock = 1; int VenusiansInTransit = 0; P(VenusianLock);++VenusiansInTransit; if (VenusiansInTransit == 1) { P(flyingPath);}V(VenusianLock); // send the message P(VenusianLock);--VenusiansInTransit; if (VenusiansInTransit == 0) { V(flyingPath);}V(VenusianLock);

63 Allowing Multiple Venusians and Martians in Transit Both sides can transmit efficiently Both sides can transmit efficiently One side can completely block off the traffic from the other side One side can completely block off the traffic from the other side Fair, since both sides are equally selfish… Fair, since both sides are equally selfish… Fortunately, pigeons do sleep Fortunately, pigeons do sleep Daily cycles will break a starvation condition… Daily cycles will break a starvation condition…

64 Proving the Correctness Safety (mutual exclusion): Safety (mutual exclusion): At most one thread is in the critical section at any time At most one thread is in the critical section at any time All necessary locks are acquired at the entrance of a critical section All necessary locks are acquired at the entrance of a critical section All shared resources are protected All shared resources are protected

65 Proving the Correctness Liveness (progress): Liveness (progress): If more than one thread is interested in executing the critical section, some processes will eventually do so (deadlock free) If more than one thread is interested in executing the critical section, some processes will eventually do so (deadlock free) Fairness (bounded waiting): Fairness (bounded waiting): Every thread that wants to execute the critical section will eventually do so (no starvation) Every thread that wants to execute the critical section will eventually do so (no starvation)

66

Download ppt "More on Semaphores Andy Wang Operating Systems COP 4610 / CGS 5765."

Similar presentations

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
Synchronization with Eventcounts and Sequencers

Synchronization with Eventcounts and Sequencers
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community.

Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community.
Ch. 7 Process Synchronization (1/2) 2015-04-17. 7.I Background F Producer - Consumer process :  Compiler, Assembler, Loader, · · · · · · F Bounded buffer.

Ch. 7 Process Synchronization (1/2) I Background F Producer - Consumer process :  Compiler, Assembler, Loader, · · · · · · F Bounded buffer.
Concurrent Programming Problems OS Spring 2011. Concurrency pros and cons Concurrency is good for users –One of the reasons for multiprogramming Working.

Concurrent Programming Problems OS Spring Concurrency pros and cons Concurrency is good for users –One of the reasons for multiprogramming Working.
1 Concurrency: Mutual Exclusion and Synchronization Chapter 5.

1 Concurrency: Mutual Exclusion and Synchronization Chapter 5.
Monitors Chapter 7. The semaphore is a low-level primitive because it is unstructured. If we were to build a large system using semaphores alone, the.

Monitors Chapter 7. The semaphore is a low-level primitive because it is unstructured. If we were to build a large system using semaphores alone, the.
Classic Synchronization Problems

Classic Synchronization Problems
Informationsteknologi Wednesday, September 26, 2007 Computer Systems/Operating Systems - Class 91 Today’s class Mutual exclusion and synchronization 

Informationsteknologi Wednesday, September 26, 2007 Computer Systems/Operating Systems - Class 91 Today’s class Mutual exclusion and synchronization 
1 Concurrency: Mutual Exclusion and Synchronization Chapter 5.

1 Concurrency: Mutual Exclusion and Synchronization Chapter 5.
Concurrency: Deadlock and Starvation Chapter 6. Revision Describe three necessary conditions for deadlock Which condition is the result of the three necessary.

Concurrency: Deadlock and Starvation Chapter 6. Revision Describe three necessary conditions for deadlock Which condition is the result of the three necessary.
Concurrency CS 510: Programming Languages David Walker.

Concurrency CS 510: Programming Languages David Walker.
Concurrency: Mutual Exclusion, Synchronization, Deadlock, and Starvation in Representative Operating Systems.

Concurrency: Mutual Exclusion, Synchronization, Deadlock, and Starvation in Representative Operating Systems.
1 Concurrency: Deadlock and Starvation Chapter 6.

1 Concurrency: Deadlock and Starvation Chapter 6.
Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic,

Chapter 6 Concurrency: Deadlock and Starvation Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic,
CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 2 (19/01/2006) Instructor: Haifeng YU.

CS4231 Parallel and Distributed Algorithms AY 2006/2007 Semester 2 Lecture 2 (19/01/2006) Instructor: Haifeng YU.
Semaphores and Bounded Buffer Andy Wang Operating Systems COP 4610 / CGS 5765.

Semaphores and Bounded Buffer Andy Wang Operating Systems COP 4610 / CGS 5765.
CS 153 Design of Operating Systems Spring 2015 Lecture 11: Scheduling & Deadlock.

CS 153 Design of Operating Systems Spring 2015 Lecture 11: Scheduling & Deadlock.
© Janice Regan, CMPT 300, May 2007 0 CMPT 300 Introduction to Operating Systems Classical problems.

© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Classical problems.
6.3 Peterson’s Solution The two processes share two variables: Int turn; Boolean flag[2] The variable turn indicates whose turn it is to enter the critical.

6.3 Peterson’s Solution The two processes share two variables: Int turn; Boolean flag[2] The variable turn indicates whose turn it is to enter the critical.

Similar presentations

Ads by Google