Laynetworks  
Web laynetworks.com Google
Home | Site Map | Tell a friends
Journal of Management
Management Tutorials
Download
Tutorials
History
Computer Science
Networking
OS - Linux and Unix
Source Code
Script & Languages
Protocols
Glossary
IGNOU
Quiz
About Us
Contact Us
Feedback
 
Sign up for our Email Newsletter
 
Get Paid for Your Tech Turorials / Tips

 

 

Home > Computer Science > Operating Systems
 
CS 01 CS 02 CS 03 CS 04 CS 05 CS 06 CS 07 CS 08 CS 09 CS 10 CS 11 CS 12 CS 13 CS 14 CS 15 CS 16 CS 17
Page : 1 2 3 4 5 6
Operating Systems
 
1. The dining philosophers problem:

This example will illustrate the correspondance between the OOP paradigm, the formal description techniques and validation.

The goal of the problem is to create a program that simulates the behavior of 5 philosophers gathered around a table to think and eat. Each philosopher thinks for a while, then eats then thinks again, and so on, independently of the others. Each philosopher has one fork, but needs two forks to eat. Thus the philosophers decide to share their forks. When a philosopher wants to eat, he takes the fork on his left, when it is available, then the fork on his right, eats, and then puts both forks back.

After the philosophers have thought and eaten several times, it may happen that all philosophers simultaneously decide to eat. They take their left fork, and find the right fork already taken by their right neighbor. In this case, if nothing has been foreseen, the philosophers will stay in that situation (deadlock) indefinitely. The program should avoid that situation.

The descriptions below are based on a free interpretation of the OMT models. This example puts the emphasis on the dynamic, and the functional models, which are less well understood than the object model.

Object model:

The philosophers have no data, only a behavior, described below.

The forks have only one piece of data, the boolean indicating when the fork is available, and two operations that act upon it.

201 class Fork {

202 int available;

203 public:

204 void get() { }

205 void put() { }

206 };

Dynamic model:

The graphs of Figure 4 model the behavior of a fork and the one of a philosopher. The first delay in the philosopher's graph represents the time during which the philosopher thinks. The second the delay during which he eats. Fi.get represents the action of taking the fork number i .

Functional model (data flow, sources and sinks of signals):

Usually, one would rather embed these objects within a entity-relationship schema. However, as the philosophers and the forks are not a passive database on which one simply execute operations, the functional diagram is closer to reality. Moreover, this specification can be coded and compiled in a straight manner. The arrows represent signal or message passing, and they can be implemented as calls to (active object) methods.


Fig: Data flow of the dining philosophers
  • RSA ALGORITHM
  • RSA MD5Source Code(rsa algorithm in Visual C++ source code)
  • RSA Algorithm program in JAVA (RSA Signature and Calculations) by Orlin from his java cryptography page
  • RSA Algorithm Implementation in C language
  • The Cigarette-Smokers Problem.
    The Cigarette-smokers problem: Consider a system with three smoker processes and one agent process. Each smoker continuously rolls a cigarette and then smokes it. But to roll and cigarette and then smokes it. But to roll and smoke a cigarette, the smoker needs three ingredients: tobacco, paper and matches. One of the smoker processes has an infinite supply of all the three materials. The agent places two of the ingredients on the table. The smoker who has the remaining ingredient then makes the smokes a cigarette, signaling the agent on completion. The agent then puts out another two of the three ingredients, and the cycle repeats. Write a program to synchronize the agent and the smokers.
TOP
 
Page : 1 2 3 4 5 6