Skip to content

Home

Jump to bottom
Rohit edited this page Apr 20, 2019 · 3 revisions

Welcome to the OS-Simulator wiki!

OPERATING SYSTEM SIMULATOR

DEMONSTRATION OF ALL THE PROGRAMS RELATED TO OPERATING SYSTEM

FOLLOWING CONCEPTS ARE DEMONSTRATED IN THE SIMULATOR :

  1. Process Scheduling
  2. Process Synchronization
  3. Banker's Algorithm
  4. Memory Management
  5. Page Replacement
  6. Disk Scheduling
  7. File Allocation

PROCESS SCHEDULING

DESCRIPTION

The process scheduling is the activity of the process manager that handles the removal of the running process from the CPU and the selection of another process on the basis of a particular strategy.Process scheduling is an essential part of a Multiprogramming operating systems. Such operating systems allow more than one process to be loaded into the executable memory at a time and the loaded process shares the CPU using time multiplexing.

FOLLOWING PROBLEMS ARE DEMONSTRATED IN THE SIMULATOR :

  1. Shortest Job First
  2. First Come First Served
  3. Round Robin
  4. Priority Scheduling
  5. Shortest Remaining Time First
    DEMO:

PROCESS SYNCHRONIZATION
DESCRIPTION
Process Synchronization means sharing system resources by processes in a such a way that, Concurrent access to shared data is handled thereby minimizing the chance of inconsistent data. Maintaining data consistency demands mechanisms to ensure synchronized execution of cooperating processes.

FOLLOWING PROBLEMS ARE DEMONSTRATED IN THE SIMULATOR :

  1. Producer Consumer Problem
  2. Reader - Writer Problem
  3. Dining Philosopher Problem DEMO:

BANKER'S ALGORITHM DESCRIPTION The banker’s algorithm is a resource allocation and deadlock avoidance algorithm that tests for safety by simulating the allocation for predetermined maximum possible amounts of all resources, then makes an “s-state” check to test for possible activities, before deciding whether allocation should be allowed to continue.

DEMO: resume MEMORY MANAGEMENT DESCRIPTION The memory management function keeps track of the status of each memory location, either allocated or free. It determines how memory is allocated among competing processes, deciding which gets memory, when they receive it, and how much they are allowed. When memory is allocated it determines which memory locations will be assigned. It tracks when memory is freed or unallocated and updates the status.

FOLLOWING PROBLEMS ARE DEMONSTRATED IN THE SIMULATOR : Memory Management DEMO: PAGE REPLACEMENT TECHNIQUES DESCRIPTION The page replacement algorithm decides which memory page is to be replaced. The process of replacement is sometimes called swap out or write to disk. Page replacement is done when the requested page is not found in the main memory (page fault).

FOLLOWING PROBLEMS ARE DEMONSTRATED IN THE SIMULATOR : 1.Least recently used 2. most recently used 3. optimal page replacement 4. most frequently used 5. second chance (clock replacement)

DEMO: WIKI: DISK SCHEDULING TECHNIQUES DESCRIPTION Disk scheduling is the method that computer operating systems use to decide in which order the block I/O operations will be submitted to storage volumes. I/O scheduling is sometimes called disk scheduling.

DEMO: FILE ALLOCATION TECHNIQUES DESCRIPTION The allocation method defines how the files are stored in the disk blocks. The direct access nature of the disks gives us the flexibility to implement the files. In many cases, different files or many files are stored on the same disk. The main problem that occurs in the operating system is that how we allocate the spaces to these files so that the utilization of disk is efficient and the quick access to the file is possiblets advantages and disadvantages. The main idea behind contiguous allocation methods is to provide : • Efficient disk space utilization • Fast access to the file blocks

DEMO: TEAM MEMBERS

Clone this wiki locally