• Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

Processor Scheduling

Extracts from this document...

Introduction

Assignment 3 Operating Systems Task 2 Introduction In this assignment we shall be looking at the four main memory management functions of an operating system. They are Process Management, Main-memory management, File and Disk management and Input/Output memory management. They shall be looked at further and in more detail within the task 3 section of the assignment. Process Management Scheduling Techniques There are three main states within the process management sub system. They are waiting, ready and running. Each process is started with the operation of system calls. Above can be seen a diagram of the scheduling operations within a system. The job queue is full of processes waiting to be entered into the ready queue, but must pass through admission to do so. When the job enters the ready queue it must wait for the processor to continue its processing method until it is time for the job to be dispatched. When dispatched it will enter the CPU where it will be executed. However, there are two errors that may occur. ...read more.

Middle

Looking at the figures above it comes as no surprise that this method is rarely used in a day to day environment. Shortest Job First The processor will execute each job in order of the completion time from lowest to highest. However; the first job received in the processor will be executed first even if it's bigger than any of the others in the queue. This method can reduce time and is far more efficient than FCFS. It can only work though if the CPU is aware if each processes burst time and then when this is achieved order can be obtained. This is a form of processing scheduling which has the lowest average waiting time using its algorithm. It's also a very clever processing technique. The processor cannot actually define the burst times individually so the operating system takes into account the previous burst times and then makes an average. This is a very clever feature. Process Arrival Time Burst Time P1 0 7 P2 2 4 P3 4 1 P4 5 4 0 7 8 12 16 Average waiting time = (0 + 6 +2 +7) ...read more.

Conclusion

When exceeded, the process shall be placed at the back of the queue and will be given an interrupt. It can be said that the round robin technique is a fair one. * If there are n processes in the ready queue and the time quantum is q then each process gets 1/nth of the CPU. * No process waits more than (n-1)q time units before receiving CPU allocation * It typically has a higher turnaround time than SRTF but a better average response time. The table below works on the basis of a time quantum of 4ms. Process Burst P1 24 P2 3 P3 3 0 4 7 10 14 18 22 26 30 Above can be seen a time quantum dictating the length of a process in the CPU. It can be said for definite that the process cannot exceed the quantum even if their are no other processes in the queue. We can also see that the P1 uses a whole time quantum; P2 and P3 however only use a part of it. P1 waits 0 + 6 = 6, P2 waits for 4 and P3 waits for 7 Average time = (6 + 4 + 7) / 3 = 5.66ms ...read more.

The above preview is unformatted text

This student written piece of work is one of many that can be found in our AS and A Level Computer Science section.

Found what you're looking for?

  • Start learning 29% faster today
  • 150,000+ documents available
  • Just £6.99 a month

Not the one? Search for your essay title...
  • Join over 1.2 million students every month
  • Accelerate your learning by 29%
  • Unlimited access from just £6.99 per month

See related essaysSee related essays

Related AS and A Level Computer Science essays

  1. Peer reviewed

    information systems assignment 2

    4 star(s)

    The different ways of viewing forms are automatically stored into the databases memory and can be accessed at any times. Spreadsheets Spreadsheets are an application which is used and created on Microsoft Excel. It is used to store data and information in a grid like format.

  2. Free essay

    Hardware and Functions of a Micro Processor

    It is important to remember tat computers only work in values of zeroes and ones, zero representing low voltage and one representing high voltage. To make the computer system function, by processing useful information these binary values need to be converted in to meaningful logic.

  1. What is transaction processing?

    processing software are placed on the market, as well as the overall cost of the software and possibility of upgrading the PC. Overall on this application the advantages over weigh the disadvantages and it is felt that this program is an essential item of the business community.

  2. Programming Techniques

    The while loop iterates on a true Boolean condition whereas in a repeat..until, it iterates on a false boolean condition (3) The repeat..until loop will execute at least once whereas the while loop may not execute at all The for loop (For...next loop)

  1. Batch Processing

    Above is an example this of a data flow diagram, which shows what happens in a batch processing system. BATCH PROCESSING ALGORITHM During the processing phase (represented in the bottom half of the flowchart above) all of the records are copied from the master file to the new master file.

  2. Smart Card System

    Therefore, we studying JCE 1.2.1 and make use of its cryptographic strengths. Chapter 3: Smart Card Technology 3.1. About The Java Card Technology In the Java Card specifications enable JavaTM technology to run on smart cards and other devices with limited memory.

  1. Internal Operations

    - 2 = 1= 1 1 - 1 = 0 = 1 so 27 = 00011011 in 8-bit binary This means that hexadecimal is 1 and 8 + 2 + 1 = 1B * 187 - 187 - 128 = 59 = 1 59 - 64 = 0 59 -

  2. CP3 - Proposed Solution to a Realistic Problem - Apartment Administration software

    However, it may be difficult to navigate around a database, the user would have to open Access then select a database and the navigation within can be confusing unless you are experienced with using the program.

  • Over 160,000 pieces
    of student written work
  • Annotated by
    experienced teachers
  • Ideas and feedback to
    improve your own work