steliospapamichail / distributedairlinereservationsystem

A distributed flight reservation system for airline companies

Distributed system for producing and managing flight reservations

System Overview

In the image below, the top A^2 circles represent the agency threads. Agencies are responsible for producing flight reservations.

In the middle section, we see the flights table containing A flights in total, each with its own pending and completed reservations. Each flight's completed reservations, are stored in a shared stack using coarsed-grained synchronization, while its pending reservations are stored in an unbounded total queue with sentinel locks.

Lastly, in the bottom part of the image, we see A airline companies represented by threads, which are responsible for managing their assigned flights and communicating with the reservations management center that is seen at the bottom. The center is implemented using a linked list with lazy synchronization. The communication between the different parts of the system is described in the next section.

Implementation

There are two families of threads (threads), the agencies, which perform the production of the flight reservations, and the airline companies, which perform the management of flight reservations. Also, there is an additional thread, the controller, which performs some checks to ensure the correctness of the system. More specifically, the program accepts an integer A as an argument to the main function upon execution. The number of airlines will be A and the multitude of of agencies will be P = A2. Each airline has a unique identifier, which takes a fixed value from 1 to A. Each airline operates only one flight, so the number of available flights is A. There is an array named flights, of size A, which represents the available flights that can be booked. Each table position in the flights array contains a pointer to a struct, the flight_reservations, which contains pointers to the structures that store the flight reservations. For each position i of the flights table, the reservations located at position i belong to the airline with identifier i+1.

struct flight_reservations {
  struct stack *completed_reservations; 
  struct queue *pending_reservations;
}

In the above struct, the field completed_reservations is a pointer to a shared stack containing the flight reservations that have been completed, and the field pending_reservations is a pointer to a shared queue that contains the pending flight reservations. Each stack has a limited capacity. However, it is implemented as a dynamic stack. When a flight is full, additional reservations related to that flight are placed in the flight queue.

struct stack {
  struct stack_reservation* top?
  pthread_mutex_t top_lock; 
  int size;
  int capacity;
}

Each node of the stack is represented by the struct:

struct stack_reservation {
  struct Reservation reservation; 
  struct stack_reservation *next;
}

The capacity is the stack capacity, i.e. the maximum number of reservations they can to be stored on this stack. The size is the size of the stack, i.e. the number of reservations stored on the stack. The capacity of each stack depends on its position in the flights table. Specifically, the stack capacity of the latter table position (i.e. position A-1) should be equal to (3/2)*A2, and the stack of each previous position of the array should have a capacity of A elements less than the stack of the next position. Therefore:

• The stack of the penultimate position of the array (i.e. position A-2) will have a capacity of (3/2)*A2– A
• The stack of the previous position (i.e. position A-3) will have capacity(3/2)A2– 2A
• . . .
• The first position stack (ie position0) will have a capacity of (3/2)*A2– (A–1)*A.

The different stack sizes correspond to planes with different numbers of seats. Each reservation, regardless of whether it will be stored on the stack or the queue, is represented by the struct:

struct Reservation {
  int agency_id;
  int reservation_number;
}

In the above struct, the agency_id is the identifier of the agency that produced it reservation. Each agency has a unique identifier, which takes a fixed value from 1 to P. To reservation_number is the reservation number. When a flight is full, additional reservations related to that flight are placed in the flight queue.

struct queue {
  struct queue_reservation *head;
  struct queue_reservation *tail;
  pthread_mutex_t head_lock; 
  pthread_mutex_t tail_lock;
}

Each node of the queue is represented by the struct:

struct queue_reservation {
  struct Reservationreservation; 
  struct queue_reservation *next;
}

The agency with identifier agency_id produces a total of A bookings with the following numbers reservation: i*P + agency_id where Π is the number of agencies, while i takes the values 0 ≤ i ≤ A–1. Therefore:

• The agency withagency_id=1produces reservations (struct Reservation) with numbers: 1, Π+1, 2Π+1, 3Π+1, ..., (A-1)*Π + 1.
• The agency withagency_id=2produces bookings with numbers: 2, Π+2, 2Π+2, 3Π+2, ..., (A-1)*Π + 2.
• . . .
• The agency withagency_id=Pproduces bookings with numbers: P, 2P, 3P, 4P, ..., AP.

Therefore, the total number of reservations that will be made in the entire system is A^3. The reservation output and stack capacities have been chosen so that:

1. The total capacity of all stacks is sufficient for all bookings.
2. Some stacks (about half) are filled and the remaining reservations for the same flight are entered in the flight queue, while in the rest the number of items entered is not enough to fill them (so there are queues that will remain empty). These stacks will eventually serve the reservations stored in the queues.

Execution Flow

The implementation of the shared flight reservation system is divided into two phases. The first phase is the phase of creating and inserting the reservations into the stacks and queues of the flights table. The second phase is the phase of managing the reservations by the airlines.

Flight reservation generation phase

In the first phase, which is the phase of creating and inserting the reservations, the agencies generate the reservations and insert them into the flight stacks and queues of the flights table. More specifically, the agency with agency_id=X will insert its bookings into the flight queue or stack located at position ((X-1) mod A) of the flights table. Provided that there are A^2 agencies in the system, A agencies place reservations simultaneously on the stack and in the queue of each seat, due to the way capacities have been assigned to stacks. So, overall, in every position of the table flights(queue and stack) will become A^2 reservations. This is done in the following way:

First, each agency will insert its reservations into the flight stack. When the flight stack is full, the agency continues to insert its reservations into that flight's queue. It should be noted that creating and inserting reservations into the stacks and queues of the flights tables is carried out simultaneously by all agencies.

After all bookings have been created and inserted into the flight stacks and queues, the first phase is completed with a controller check. The controller is a special thread whose ID is 0. At the end of the first phase, it performs the following checks:

1. Stack overflow check: The number of reservations each flight's stack contains must be less than or equal to the capacity of the respective stack. After this check is completed for each position i of the flights table, this message is printed on the screen: Flight i : stack overflow check passed (capacity: X, found: Y) where X is the stack capacity of position i and Y is the number of stack elements.
2. Total size check: The total number of bookings from all flights must equal the predicted value (A^3). After this check is completed, this message is printed on the screen: total size check passed (expected: X, found: Y) where X is the predicted value of the total number of reservations from all flights and Y is the total number of reservations found on all flights, after a traversal of the stacks and queues of the flights table by the controller.
3. Total keysum check: The sum of reservation_number of reservations from all flights must be equal to the prescribed total ((A6+ A3)/2). After this check is completed, this messsage is printed on the screen: total keysum check passed (expected: X, found: Y) where X is the predicted value of the sum of reservation_numbers of reservations from all flights and Y is the sum of reservation_numbers of reservations found on all flights, after a traversal of the stacks and queues of the flights table by the controller.

If any of the above checks fail, the program displays an appropriate error message (showing which check failed and why) and execution terminates. After completing these checks, the controller should count the number of queues in the table flights that contain at least one object (ie are not empty). The total will stored in a global variable of integer type, named number_of_inserter_airlines. This variable is used in the second phase to aid termination detection by airlines. To make sure that the checker starts checking after all reservation entries on the stacks and queues have finished, a barrier is used, called barrier_start_1st_phase_checks.

Reservations Management phase

In the second phase, which is the reservation management phase, each airline manages the reservations of the flight it owns. Reservations are managed in the following way:

Any airline that has reservations in its flight queue then deletes those reservations one by one from that queue and inserts them into another structure called the reservation management center. After it has finished inserting all the reservations in the center, it should decrement the integer number_of_inserter_airlines by one unit. At the same time, any airline that has no reservations in its flight queue and still has room in its flight stack, deletes reservations one by one from the reservation management center and inserts them into its flight stack, until: Either that stack is full, or the management center is empty and the integer number_of_inserter_airlines has reached 0.

struct list {
  struct list_reservation *head; 
  struct list_reservation *tail;
}

Each node in the list is represented by the struct:

struct list_reservation {
  struct Reservation reservation; 
  int marked;
  pthread_mutex_t lock; struct 
  list_reservation *next;
}

P.S. Bookings in the management center are sorted based on the reservation_number of each booking.

After all bookings have been managed, the second phase will be completed with a review by the controller. At the end of the second phase, the controller performs the following checks:

1. Stack overflow check.
2. Total size check.
3. Total keysum check.
4. Reservations completion check: Checks if the reservation management center as well and all queues are empty. It also checks if the integer number_of_inserter_airlines has the value 0. After this check is completed, this message is printed on the screen: reservations completion check passed. If any of the above checks fail, the program displays an appropriate error message (showing which check failed and why) and execution terminates.

To make sure that reservation management starts after the first phase check by the controller is over, a barrier is used, which is called barrier_start_2nd_phase. The airlines will start their execution by waiting at this barrier while the controller will continue its execution (after the end of the first phase check) by waiting at this barrier. To make sure that the controller will start the second phase control after all the bookings have been managed, another barrier is used, which will is called barrier_start_2nd_phase_checks. Airlines will terminate their execution by waiting at this barrier while the controller will continue its execution waiting at this barrier.

Compilation

Simply run make or make all.

You can also use make clean to delete the generated files.

Execution

You can run the program by executing the generated executable like so:

./bin/main A where A is the number of flights.