Design and Development of a Dynamic Boot Loader for Loading an Operating System: An Update | Chapter 6 | Research Updates in Mathematics and Computer Science Vol. 1

 The purpose of this paper is to design a dynamic boot loader which removes the BIOS dependency and allows user to boot from USB without changing CMOS settings. Boot Loader is the crucial program that loads the operating system in memory and initializes the system. In today’s world people are constantly on the move and portable system are in demand specially the USB devices due to its portability and accessibility compared to CD/DVD drives. To boot from USB, the user needs to change the boot order and choose the USB to start the booting process from USB. The available boot process is static which is dependent on user changing the BIOS settings. The USB is devised as plug and play portable system with puppy Linux and newly developed dynamic boot loader. The device is experimented on a computer machine with 8 GB RAM, i5 processor, 64-bit Operating system and windows 7 and observed that nearly 50% reduction in booting time i.e., the time spent in changing the boot order is eliminated compared to the static boot loader. The time spent in the BIOS is dependent on the user knowledge in changing the boot priority. The portable system allows the user to work in ease in any environment with minimum requirement of Windows XP and USB 2.0 compatible system. Since the OS runs from the USB and not dependent on the operating system of the machine, the proposed design achieves security for the data stored as well as make the environment secure. The kernel image can be customized as per the requirement of the user. This will greatly improve the loading time of the OS to the host machine.

Author(s) Details:

Alycia Sebastian,
Department of Information Technology, Al Zahra College for Women, Oman.

K. Siva Sankar,
Department of Information Technology, Noorul Islam Centre for Higher Education, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/RUMCS-V1/article/view/13673

Keywords: Boot loader, dynamic, operating system, USB, open-source OS

Practicing Hand Book for Operating System Laboratory | Book Publisher International

 The book Practicing Hand Book for Operating System Laboratory was created with the objective of making it easier for students to practise their lab exercises in an operating system laboratory. Basic operating system commands, process management commands, memory management exercises, and file systems concepts are among the topics covered in this practise handbook's syllabus. Students will become familiar with UNIX system calls for process management and inter-process communication, as well as simulation/implementation of process scheduling and other operating system functions, through laboratory activities.

Author(S) Details

Sathish Kumar Ravichandran
Department of Computer Science and Engineering, School of Engineering and Technology, Christ University, Bangalore, Karnataka-560001, India.

Archana Sasi
Department of Computer Science and Engineering, School of Engineering, Presidency University, Bangalore, Karnataka-560025, India.

View Book:- https://stm.bookpi.org/PHBOSL/article/view/3415

An Experimental Approach to Improve the Performance of FCFS Disk Scheduling Algorithm | Chapter 5 | Theory and Practice of Mathematics and Computer Science Vol. 1

 

One of the functions of the Operating System is serve the pending I/O requests from disk queue to the

requesting processes. Once a request is served, the operating system has to determine which request will be

served next. This process involves a careful examination of pending requests to determine the most efficient

way to service the requests. The aim of most of the disk scheduling algorithms is to reduce seek times for a set

of pending I/O requests. Some of the important disk scheduling algorithms are First-Come-First-Served (FCFS),

Shortest Seek Time First (SSTF), SCAN, Circular Scan (C-SCAN) and LOOK. Out of these disk scheduling

algorithms, the simplest and fair is the FCFS which serves the I/O requests based on their arrival. FCFS is

simple and easy to implement but usually it does not provide the efficient service. Here, I am proposing an

approach which can improve the performance of FCFS and reduce the seek time. This approach can be called

Improved First-Come-First-Served (IFCFS). After applying the suggested improvement, it has been found that

the service is fast and seek time has been reduced drastically. This has been proved with the experimental results with some sets of pending I/O requests.

 

Author (s) Details

Manish Kumar Mishra
Department of Computer Science, University of Gondar, Ethiopia.

View Book :-https://bp.bookpi.org/index.php/bpi/catalog/book/237