Skip to content

**This repository contains the solution of all the exam tests of the degree course in computer engineering at the University of Rome Tor Vergata, of Operating Systems. Course held by Prof.F.Quaglia.**

Notifications You must be signed in to change notification settings

SimoneRemoli/Sync

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Semaphores structure.

🧘‍♂️ The semaphore structure is particularly useful for managing synchronization tasks between processes and threads.

🤓 Using System V technology.

Semaphores enable processes to query or alter status information. They are often used to monitor and control the availability of system resources such as shared memory segments. Semaphores can be operated on as individual units or as elements in a set. The semaphore set must be initialized using semget. The semaphore creator can change its ownership or permissions using semctl. Any process with permission can use semctl to do control operations. Semaphore operations are performed by semop. This interface takes a pointer to an array of semaphore operation structures. Each structure in the array contains data about an operation to perform on a semaphore. Any process with read permission can test whether a semaphore has a zero value. Operations to increment or decrement a semaphore require write permission. Only one process at a time can update a semaphore. Simultaneous requests by different processes are performed in an arbitrary order. When an array of operations is given by a semop call, no updates are done until all operations on the array can finish successfully.

🤓 Synch

The codes you will find will have to manage the synchronization between threads and processes. You will also be able to see the management of synchronization between different processes where each of them will have an arbitrary number of threads to manage.

Execution from Unix and Library

Use "lpthread" means link with a library called pthread.

For example, gcc file_name.c -lpthread and ./a.out param1 param2 param3 param4 ... The double argv character pointer is used to retrieve the parameters. In fact, in all codes you can assign the argc parameter to a global variable to maintain passed information.

There is a need to include the pthread library:#include <pthread.h>.

However, that's not the only library to include. After each traffic light operation we must check whether the operation we have performed is blocking. If a blocking operation is activated the system call has aborted. Consequently, the ERRNO environment variable is set to EINTR. And so you need to include the following library: #include <errno.h>.

The inclusion of the standard library signal.h allows the use of functions for handling signals between processes: #include <signal.h>.

Signal

void (*signal( int sig, void (*handler) (int))) (int);

Sets the error handler for signal sig. The signal handler can be set so that default handling will occur, signal is ignored, or a user-defined function is called.

Parameters

The parameters of this function are the following:

  • sig: the signal to set the signal handler to. It can be an implementation-defined value or one of the following values: SIGABRT SIGFPE SIGILL SIGINT SIGSEGV SIGTERM.

  • handler: the signal handler. This must be one of the following:

    • SIG_DFL macro. The signal handler is set to default signal handler.

    • SIG_IGN macro. The signal is ignored.

    • Pointer to a function. The signature of the function must be equivalent to the following: void fun(int sig);.

Semaphores Array[]

You have to imagine the busy world .

In Rome there is a large national road called "Via Tiburtina" (spoiler: the whole city of Rome is busy) where there is a traffic light every two hundred metres, and a very long queue forms, especially around 6pm. 😵 However, this traffic must be managed.

The road is a shared resource and many cars find themselves, at a certain moment of time, on this resource and take up space.

If there were no traffic lights to regulate the flow of traffic there would be accidents. 🥴 So we need to be able to understand which and how many threads or processes (or both) to pass through to correctly manage the flow.

A Linux semaphore cannot have a negative value, so when all threads have taken their token, the semaphore remains set to zero. The concept of the semaphore array is important, because thanks to it we are able to atomically perform a specific operation assigned to just one (!) thread.

The thread/process accesses the shared resource by taking a token and returns the token to whoever wants: it can return it to the same semaphore structure to which it belongs, or another structure not necessarily an array. Typically if the main thread has to handle simple operations the traffic light configuration is not an array, but a single token dispenser.

Each process/thread will have an element[s] available to perform withdrawal or supply operations. About what? Of the token. 🚦 Please note that this operation must be correctly managed by the programmer.

This concept was invented by Edsger Dijkstra.

Simone Remoli 😉

I hope to see you there!

About

**This repository contains the solution of all the exam tests of the degree course in computer engineering at the University of Rome Tor Vergata, of Operating Systems. Course held by Prof.F.Quaglia.**

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages