An Airline Reservation Application

(MULTI-USER TRANSACTION AND REAL TIME PROCESSING)

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 Group 3 Assignment Solution By :

OLATUNJI Michael A.
ALABI Rukayat Oyenike
AJADI Abosede Olayemi
NDUKWE Jeremiah Ifeanyi
OKAFOR Jude
OTOIGHILE Osaze

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 Table Of Content
1. Assignment Problem
2. Introduction to Airline Seat Reservation Application : Real Time Tasks and Processes
3. Assumptions and scope of the Airline Seat Reservation System
4. Features of an Airline Seat Reservation System
5. Possible Task Involved in an Airline Seat Reservation/Booking System
6. Classifications and justification Table Under Hard or Soft Task
7. Proposed Scheduling Policies for the Application
8. Conclusion
9. References

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 Introduction
An airline seat reservation/booking system is an online system that automate the process of booking airline ticket and reserving seat for
passengers. In today’s world, people travels mostly by planes to different part of the world and as a result of the increase number of
people; the manual approach of getting airline could not serve the potential passengers properly which has led to the development of the
airline seat reservation/booking system. The passengers can now at the comfort of their home book for airline and reserve a seat.
An Airline Seat Reservation System is part of the Passenger Service Systems (PSS), which are applications supporting the direct contact with
the passenger. The Airline Seat Reservations System (ASRS) was one of the earliest changes to improve efficiency. The Airline Seat
Reservations System (ASRS) eventually evolved into the Computer Reservations System (CRS). A Computer Reservation System is used for the
reservations of a particular airline and interfaces with a Global Distribution System (GDS) which supports travel agencies and other
distribution channels in making reservations for most major airlines in a single system.
Airline Seat Reservations Systems contain airline schedules, fare tariffs, passenger reservations and ticket records. An airline's direct
distribution works within their own reservation system, as well as pushing out information to the GDS. A second type of direct distribution
channel is consumers who use the internet or mobile applications to make their own reservations. Travel agencies and other indirect
distribution channels access the same Global Distribution System (GDS) as those accessed by the airlines' reservation systems, and all
messaging is transmitted by a standardized messaging system that functions on two types of messaging that transmit on a High Level
Network. These message types are called Type A for remarks-like communications and Type B for secured information

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
Assignment Problem
Identify possible tasks or processes in an airline seat reservation/booking application which supports
multi-user transaction and real time processing. Classify the tasks into soft and hard real time tasks
and justify the classification. Also develop with justification scheduling policies for an operating system
that will drive this application.
Keywords: reservation, booking, real time, multiuser, online, hard task, soft task, scheduling policies

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
Assumptions and scope of the Airline Seat
Reservation System
There are no free seating, everyone must book a seat.
 The system assumes there is online payment for seat reservation.
 The airline uses the same type of aircraft as other airlines.

Scope: The system takes into consideration online check-in after booking payment, to check in luggage, obtain seat and
boarding pass.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
Features Of An Airline Seat Reservation System
Updates real-time status on seats available
A Central Database holds the key to system Multi-Lingual System
Post Booking Management Easy Cancellation Process
User-Friendly Interface Traveler can compare the prices
All forms are html templates driven Display the arrangement of seats on the screen thus enabling
customers to book seats accordingly
Customer can select package according to his requirements.
Routine tasks are easily performed
Different Payment options/ modes and multiple payment
gateways for a safe and secure transaction It is cost effective
Integration among all functional areas.
Automation of redundant tasks

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 Possible Task Involved in an Airline Seat
Reservation/Booking System
The basic tasks that we identified from an airline seat reservation/booking system referencing www.arikair.com includes:
Flight Selection: This is the first task required for the user to perform. It involves searching if the flight selected is
available or not. If the flight is available the passenger can book. Details needed include: Round trip, One way(from, to,
adult, child, infant), Depart and Arrival.
Departure: This task involves the passenger to select the type of seat he or she wants. They are Economy, Premium
Economy and Business.
Your Flight Information: The system displays the summary of the flight which includes the departure date and time, the
arrival date and time, the flight code and cabin
Passenger Information: The is where the passenger is required to enter his/her personal information such as Gender,
Title, Name, Date of Birth, Passport Number etc.
Payment: This task involves the payment of the cost of the flight either by cash, Mastercard or visa or verve card.
Confirmation: This is the final task where the passenger confirms the flight booking and a confirmation message is
displayed.
Post-Confirmation: This is a optional task where a passenger enters luggage quantity and selects his/her seat number.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 Classification & Justification Table
Possible Tasks/ Processes Hard/Soft Real time task Classification Justification

Flight Selection Hard Task This task is classified as a hard task

because the system will ensure that
passengers would not be able to select a
flight that is about two hours to take off
or the date is past. Hence the passenger
must select an appropriate time,
departure and arrival.
Departure Hard Task This is classified as an hard task because
the system must ensure that the seat to
be reserve is available to ensure
integrity
Your Flight Information Soft Task This task can be said to be a soft task
because it would not necessarily cause
any error while the whole process is
going on. It only displaces the summary
of the flight details.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
Classification & Justification Table
Possible Tasks/ Processes
Passenger Information
Payment
Confirmation
CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
Hard/Soft Real time task Classification Justification
Hard Task This task is classified as an hard task
because the passenger must complete
the required fields to register the
passenger’s information. This could lead
to error if the passenger fails to meet
the requirement.
Hard Task This is a hard task because the user must
pay for the flight to get the ticket he or
she desires. Without carrying out this
task the whole process would be
terminated.
Hard Task This is considered a hard task
because all the operation earlier
will be verified and save into the
system which must run to
completion successfully.
Classification & Justification Table
Possible Tasks/ Processes Hard/Soft Real time task Classification Justification
Post-Confirmation Soft This has no fatal error on the system if
deadline delayed.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
 PROPOSED SCHEDULING POLICY FOR THE
APPLICATION
In systems with real-time constraints, pre-emption is, oddly enough, sometimes not needed because the
processes know that they may not run for long periods of time and usually do their work and block quickly. To
determine a scheduling algorithm, one has to consider;
CPU utilization: On a real system CPU usage should range from 50% (lightly loaded) to 95% (heavily loaded.)
Throughput: Number of processes completed per unit time.
Turnaround time: Time required for a particular process to complete, from submission time to completion.
Waiting time: How much time processes spend in the ready queue waiting their turn to get on the CPU.
Load average: The average number of processes sitting in the ready queue waiting their turn to get into the CPU.
Response time: The time taken in an interactive program from the issuance of a command to the
commencement of a response to that command.
A pre-emptive scheduling policy will be best suited here in order to allow for interrupts during process execution.
It however needs to allot time to processes from different users to avoid hoarding of resources and delay of other
processes. Variants of the scheduling policy that will be desirable include;

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
PROPOSED SCHEDULING POLICY FOR THE
APPLICATION
Earliest Deadline First: Earliest deadline first (EDF) or least time to go is a dynamic scheduling
algorithm used in real-time operating systems to place processes in a priority queue. Whenever a
scheduling event occurs (a task finishes, new task is released), the queue will be searched for the
process closest to its deadline, which will be the next to be scheduled for execution. This policy is
proposed to handle the hard real time task in this system to ensure efficiency.
Justification of Earliest Deadline First Scheduling
In EDF we can fully utilize the processor
Less context switch
Meeting of process deadline

First Come First Served: This will also be a scheduling policy since there is multi-user interaction and
the policy will ensure users are served on a first come, first served basis.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
PROPOSED SCHEDULING POLICY FOR THE
APPLICATION
Dynamic Round Robin Scheduling: The round-robin (RR) scheduling algorithm is designed
especially for timesharing systems. Hence, it would be very suitable for a soft real time task
considering an airline seat reservation/booking system. It is similar to FCFS scheduling, but pre-
emption is added to enable the system to switch between processes. A small unit of time, called
a time quantum or time slice, is defined. A time quantum is generally from 10 to 100
milliseconds in length. The ready queue is treated as a circular queue. The algorithm is based on
dynamic time quantum approach where the system adjust the time quantum according to the
burst time of processes found in the ready queue.
Justification of Dynamic Round Robin Scheduling
It improved the efficiency of round robin by changing the idea of fixed time quantum to
dynamic calculated quantum without the interference of the user.
It reduces the context switch, turnaround time and the waiting time.
The complexity of the mean of the process is very small.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
CONCLUSION
On considering an airline seat reservation/booking application, we have been able to
understand what this application is, the processes that are involved and propose two scheduling
policies that will allow the operating system manages the process in a fair and efficient manner.
An optimal scheduling algorithm for an airline seat reservation/booking application must put
into consideration the time constraints on the processes, concurrency; as each terminal is trying
to access the resources at the same time and the level of priority of each task. Hence an ideal
algorithm will characterize pre-emption, priority scheduling and time slicing and this has been
considered in selecting the algorithms listed above. The preferred algorithm however will be
Earliest deadline first for the hard real time task and Dynamic Quantum Round Robin Scheduling
Policy for the soft real time task.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
REFERENCES
 Uwadia C., (2019), Operating System Types, [PowerPoint Slides] (Presented: 25th April 2019).

 Tanenbaum, A. S., & BOS, H. (2015). Modern Operating Systems. New Jersey: Pearson Education, Inc.

 Tenenbaum, A. S., & Woodhull, A. S. (2006). Operating System Design and Implementation(Third Edition). Amherst, Massachusetts: Prentice
Hall.

 (2019). Retrieved from Arik Air : www.arikair.com

 D. Zmaranda, G. G. (2011). Using Fixed Priority Pre-emptive Scheduling in Real-Time. Int. J. of Computers, Communications & Control.

 Hammar. (1995). Introduction to real time systems. In Real Time Systems (pp. 1-19).

 Introduction. (n.d.). Retrieved 2 9, 2017, from http://user.it.uu.se/~yi/courses/rts/dvp-rts-07/notes/Introduction.pdf

 Nadadur, V. (2015). What are time sharing and multiuser operating systems, and what are some examples?

 Rotatori, D. (2015). Real time systems are changing the reality of payments.

 Silberschatz, A. (ND). Operating System Concepts.

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)
REFERENCES
TANENBAUM, A. S., & BOS, H. (2015). MODERN OPERATING SYSTEMS. New Jersey: Pearson Education, Inc.

William S., (April 26 2019), Operating Systems, 7th edition., (Accessed: 5th May 2019).

Stalling W., (2009), Operating Systems, 6th edition., (Accessed: 7 February 2017).

Online Source : https://en.wikipedia.org/wiki/

CSC810: ADVANCED OPERATING SYSTEMS AND COMPUTER ARCHITECTURE (14TH MAY, 2019)