scholarly journals A Comparative Analysis of Disk Scheduling Algorithms

2021 ◽  
Vol 8 (2) ◽  
pp. 184-195
Author(s):  
Bishwo Prakash Pokharel
Keyword(s):  
Operating System ◽  
Comparative Analysis ◽  
Scheduling Algorithm ◽  
Access Time ◽  
Secondary Memory ◽  
Disk Scheduling ◽  
Secondary Storage ◽  
Storage Devices ◽  
First Come First Serve ◽  
System Disk

In an operating system, disk scheduling is the process of managing the I/O request to the secondary storage devices such as hard disk. The speed of the processor and primary memory has increased in a rapid way than the secondary storage. Seek time is the important factor in an operating system to get the best access time. For the better performance, speedy servicing of I/O request for secondary memory is very important. The goal of the disk-scheduling algorithm is to minimize the response time and maximize throughput of the system. This work analyzed and compared various basic disk scheduling techniques like First Come First Serve (FCFS), Shortest Seek Time First (SSTF), SCAN, LOOK, Circular SCAN (C-SCAN) and Circular LOOK (C-LOOK) along with the corresponding seek time. From the comparative analysis, the result show that C-LOOK algorithm give the least head movement and seek time in different cases as compared to other algorithm. Therefore, it maximizes the throughput for the storage devices.

DEVS OS (Discrete Even Visualization and Simulation Operating System)

2018 ◽  
Author(s):  
Adnan Hajar
Keyword(s):  
Operating System ◽  
Operating Systems ◽  
Scheduling Algorithm ◽  
The Novel ◽  
Priority Scheduling ◽  
First Come First Serve ◽  
Multiple Cycles ◽  
Visualization And Simulation ◽  
Traditional Approaches

The use of traditional approaches to teach Operating Systems usually lacks the visual aspect. The following research investigates the novel use of DEVS (Discrete Even Visualization and Simulation) in simulating the operation of an operating system. Cd boost++ was the framework of choice for this project. The simulation successfully mimicked the work of an operating system by simulating multiple cycles of program requests. This simulation is capable of further enhance the explanation of how an operating system works. The cases studied in this work include: 1- two processes running concurrently doing multiple IO’s, 2-four processes running concurrently based on a first come first serve scheduling algorithm, and 3- 20 processes running concurrently using highest priority scheduling algorithm. Output observation of the last case show promising results of successful use of DEVS and cd boost++ as a framework to build an operating system.

scholarly journals Performance of Movable Head Disk Storage Devices with Various Disk Scheduling Algorithms

2019 ◽  
Vol 9 (2S) ◽  
pp. 486-490
Keyword(s):  
Scheduling Algorithms ◽  
Access Time ◽  
Processing Unit ◽  
Disk Scheduling ◽  
Efficient Manner ◽  
Hard Drives ◽  
Storage Devices ◽  
Disk Storage ◽  
Central Processing ◽  
The One

Hard drives are the one which needs to be accessed in an efficient manner so that it is feasible to get better recital of the central processing unit. Now a day’s magnetic disks are capable of providing more input output bandwidth yet a huge amount of this bandwidth is lost due to the access time of the hard disk. This paper discusses an analysis of performance of various disk scheduling algorithms with their merits and demerits

scholarly journals Hybrid Page Replacement Algorithm in real time Operating System

2020 ◽  
pp. 433-439
Author(s):  
Pallab Banerjee ◽  
Biresh Kumar ◽  
Amarnath Singh ◽  
Shipra Sinha ◽  
Medha Sawan
Keyword(s):  
Operating System ◽  
Execution Time ◽  
Virtual Memory ◽  
Primary Memory ◽  
Page Fault ◽  
Secondary Storage ◽  
Real Time Operating System ◽  
Storage Devices ◽  
Replacement Algorithm ◽  
Replacement Technique

Programming codes are of variable length. When the size of codes becomes greater than that of primary memory, the concept of virtual memory comes into play. As the name suggests, virtual memory allows to outstretch the use of primary memory by using storage devices such as disks. The implementation of virtual memory can be done by using the paging approach. Allocation of memory frames to each and every program is done by the operating system while loading them into the memory. Each program is segregated into pages as per the size of frames. Equal size of pages and frames enhance the usability of memory. As, the process or program which is being executed is provided with a certain amount of memory frames; therefore, swap out technique is necessary for the execution of each and every page. This swap out technique is termed as Page Replacement. There are many algorithms proposed to decide which page needs to be replaced from the frames when new pages come. In this paper, we have proposed a new page replacement technique. This new technique is based on the approach of reading and counting of the pages from secondary storage. Whenever the page fault is detected, the needed page is fetched from the secondary storage. This process of accessing the disc is slow as compared to the process in which the required page is retrieved from the primary storage. In the proposed technique, the pages having least occurrence will be replaced by the new page and the pages having same count will be replaced on the basis of LRU page replacement algorithm. In this method, the paged are retrieved from the secondary storage hence, possibility of page hit will be increased and as a result, the execution time of the processes will be decreased as the possibility of page miss will be decreased.

scholarly journals An Improved Round Robin CPU Scheduling Algorithm based on Priority of Process

2018 ◽  
Vol 7 (4.5) ◽  
pp. 238 ◽  
Author(s):  
Govind Prasad Arya ◽  
Kumar Nilay ◽  
Devendra Prasad
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Process Scheduling ◽  
Cpu Scheduling ◽  
Average Waiting Time ◽  
Time Quantum ◽  
First Come First Serve ◽  
Time Changes

The most important and integral part of a computer system is its operating system. Scheduling various resources is one of the most critical tasks an operating system needs to perform. Process scheduling being one of those tasks, involves various techniques that define how more than one processes can be executed simultaneously. The primary aim here is to the system more efficient and faster. The fundamental scheduling algorithms are: First Come First Serve (FCFS), Round Robin, Priority Based Scheduling, and Shortest Job First (SJF). This paper focuses on Round Robin Scheduling algorithm and various issues related to it. One major issue in RR scheduling is determining the length of Time Quantum. If the Time Quantum is too large RR scheduling behaves as FCFS. On the other hand, if it is too small it forces considerable increase in the number of context switches. Our main objective is to overcome this limitation of traditional RR scheduling algorithm and maximize CPU utilization, further, leading to more efficient and faster system. Here we propose an algorithm that categorizes available processes into High Priority processes and Low Priority process. The proposed algorithm reduces the average waiting time of High Priority processes in all cases and of Low Priority processes in not all but some cases. The overall waiting time changes on the basis of set of processes considered. The simulation results justify that the proposed schemes reduces the overall average waiting time when compared to the existing schemes. 

An Hybridized Disk Scheduling Algorithm (HDSA)

2019 ◽  
Vol 9 (3) ◽  
pp. p8789
Author(s):  
Akanmu T.A. ◽  
Aadegoke B.O. ◽  
Oladoye S.F.
Keyword(s):  
Scheduling Algorithm ◽  
Disk Scheduling

scholarly journals On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1400
Author(s):  
Muhammad Adnan ◽  
Jawaid Iqbal ◽  
Abdul Waheed ◽  
Noor Ul Amin ◽  
Mahdi Zareei ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Quality Of Service ◽  
Traffic Management ◽  
Vehicular Networks ◽  
Scheduling Algorithm ◽  
Main Research ◽  
First Come First Serve ◽  
Computing Framework ◽  
Simulation Results

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.

scholarly journals Multi-Dependency and Time Based Resource Scheduling Algorithm for Scientific Applications in Cloud Computing

Electronics ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 1320
Author(s):  
Vijay Prakash ◽  
Seema Bawa ◽  
Lalit Garg
Keyword(s):  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Scientific Applications ◽  
Virtual Machine Migration ◽  
Simulation Based ◽  
First Come First Serve ◽  
Minimum Completion Time ◽  
Burst Time ◽  
Parent Node

Workflow scheduling is one of the significant issues for scientific applications among virtual machine migration, database management, security, performance, fault tolerance, server consolidation, etc. In this paper, existing time-based scheduling algorithms, such as first come first serve (FCFS), min–min, max–min, and minimum completion time (MCT), along with dependency-based scheduling algorithm MaxChild have been considered. These time-based scheduling algorithms only compare the burst time of tasks. Based on the burst time, these schedulers, schedule the sub-tasks of the application on suitable virtual machines according to the scheduling criteria. During this process, not much attention was given to the proper utilization of the resources. A novel dependency and time-based scheduling algorithm is proposed that considers the parent to child (P2C) node dependencies, child to parent node dependencies, and the time of different tasks in the workflows. The proposed P2C algorithm emphasizes proper utilization of the resources and overcomes the limitations of these time-based schedulers. The scientific applications, such as CyberShake, Montage, Epigenomics, Inspiral, and SIPHT, are represented in terms of the workflow. The tasks can be represented as the nodes, and relationships between the tasks can be represented as the dependencies in the workflows. All the results have been validated by using the simulation-based environment created with the help of the WorkflowSim simulator for the cloud environment. It has been observed that the proposed approach outperforms the mentioned time and dependency-based scheduling algorithms in terms of the total execution time by efficiently utilizing the resources.

Sign in / Sign up

Export Citation Format

Share Document