Resource Management IB Computer Science.

Slides:



Advertisements
Similar presentations
So far Binary numbers Logic gates Digital circuits process data using gates – Half and full adder Data storage – Electronic memory – Magnetic memory –
Advertisements

?  Able to explain the 6 key functions of system software  Able to explain each using a suitable example  Identify three different system software.
Computer Architecture
Lecture 11: Operating System Services. What is an Operating System? An operating system is an event driven program which acts as an interface between.
WHAT IS AN OPERATING SYSTEM? An interface between users and hardware - an environment "architecture ” Allows convenient usage; hides the tedious stuff.
FIU Chapter 7: Input/Output Jerome Crooks Panyawat Chiamprasert
OS Fall ’ 02 Introduction Operating Systems Fall 2002.
1 Computer System Overview OS-1 Course AA
OS Spring’03 Introduction Operating Systems Spring 2003.
Advanced OS Chapter 3p2 Sections 3.4 / 3.5. Interrupts These enable software to respond to signals from hardware. The set of instructions to be executed.
Chapter 11 Operating Systems
Device Management.
Computer Organization and Architecture
What do operating systems do? manage processes manage memory and computer resources provide security features execute user programs make solving user.
CHAPTER 2 OPERATING SYSTEM OVERVIEW 1. Operating System Operating System Definition A program that controls the execution of application programs and.
Operating Systems  By the end of this session, you will know: What an Operating System is. The functions it performs.
1 Computer System Overview Chapter 1. 2 n An Operating System makes the computing power available to users by controlling the hardware n Let us review.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Principles of I/0 hardware.
CHAPTER 3 TOP LEVEL VIEW OF COMPUTER FUNCTION AND INTERCONNECTION
Operating Systems David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS 432.
OSes: 3. OS Structs 1 Operating Systems v Objectives –summarise OSes from several perspectives Certificate Program in Software Development CSE-TC and CSIM,
CS 390 Unix Programming Environment
IT3002 Computer Architecture
1 Process Description and Control Chapter 3. 2 Process A program in execution An instance of a program running on a computer The entity that can be assigned.
1 Device Controller I/O units typically consist of A mechanical component: the device itself An electronic component: the device controller or adapter.
Operating System (Reference : OS[Silberschatz] + Norton 6e book slides)
System Software (1) The Operating System
Multiprogramming. Readings r Chapter 2.1 of the textbook.
Computer Organisation
Operating Systems & System Software
Chapter 13: I/O Systems Modified by Dr. Neerja Mhaskar for CS 3SH3.
Lecture 1: Operating System Services
Processes and threads.
Resource Management IB Computer Science.
Operating Systems CMPSC 473
Operating System.
Component 2 6G, H, I, J, K.
Lesson Objectives Aims Key Words Interrupt, Buffer, Priority, Stack
Lesson Objectives Aims Key Words
Operating Systems (CS 340 D)
Lecture Topics: 11/1 Processes Process Management
Computer System Overview
Introduction to Operating System (OS)
Operating Systems What are they and why do we need them?
Real-time Software Design
Quick Introduction to OS
Systems Software Keywords Operating Systems
CSCI 315 Operating Systems Design
OPERATING SYSTEMS.
Multicultural Social Community Development Institute ( MSCDI)
GEOMATIKA UNIVERSITY COLLEGE CHAPTER 2 OPERATING SYSTEM PRINCIPLES
Computer System Overview
Processor Fundamentals
Process & its States Lecture 5.
Operating Systems.
Process Description and Control
Lecture Topics: 11/1 General Operating System Concepts Processes
CSE 451: Operating Systems Autumn 2003 Lecture 2 Architectural Support for Operating Systems Hank Levy 596 Allen Center 1.
CSE 451: Operating Systems Autumn 2001 Lecture 2 Architectural Support for Operating Systems Brian Bershad 310 Sieg Hall 1.
Interrupt handling Explain how interrupts are used to obtain processor time and how processing of interrupted jobs may later be resumed, (typical.
CS149D Elements of Computer Science
Week 4 Lecture-1 Operating Systems.
CSE 451: Operating Systems Winter 2003 Lecture 2 Architectural Support for Operating Systems Hank Levy 412 Sieg Hall 1.
Software - Operating Systems
Process State Model -Compiled by Sheetal for CSIT
Contact Information Office: 225 Neville Hall Office Hours: Monday and Wednesday 12:00-1:00 and by appointment. Phone:
Chapter 13: I/O Systems.
An Introduction to Operating Systems
Presentation transcript:

Resource Management IB Computer Science

HL Topics 1-7, D1-4 1: System design 2: Computer Organisation 3: Networks 4: Computational thinking 5: Abstract data structures 6: Resource management 7: Control D: OOP

HL only 6 Overview 1: System design 2: Computer Organisation Systemresources Identify the resources that need to be managed within a computer system Evaluate the resources available in a variety of computer systems 3: Networks Identify the limitations of a range of resources in a specified computer system Describe the possible problems resulting from the limitations in the resources in a computer system Role of the operating system Explain the role of the operating system in terms of managing memory, peripherals and hardware interfaces 6.1.7 Outline OS resource management techniques: scheduling, policies, multitasking, virtual memory, paging, interrupt, polling 4: Computational thinking 5: Abstract data structures 6: Resource management Discuss the advantages of producing a dedicated operating system for a device Outline how an operating system hides the complexity of the hardware from users and applications 7: Control D: OOP

Topic 6.1.7 Outline OS resource management techniques: scheduling, policies, multitasking, virtual memory, paging, interrupt, polling

Scheduling Scheduling is the method by which work is assigned to resources that complete the work. The work could be processes which are in turn scheduled onto hardware resources such as processors, network links or expansion cards. The algorithm used may be as simple as round-robin in which each process is given equal time (for instance 1 ms, usually between 1 ms and 100 ms) in a cycling list. So, process A executes for 1 ms, then process B, then process C, then back to process A.

Policies The policies what is to be done while the mechanism specifies how it is to be done. For instance, the timer construct (limiting the time a process can use the CPU for) thereby ensuring CPU protection is mechanism. On the other hand, the decision of how long the timer is set for a particular user is a policy decision. The separation of mechanism and policy is important to provide flexibility to a system.

Multitasking Multitasking, in an operating system, is allowing a user to perform more than one computer task (such as the operation of an application program) at a time. The operating system is able to keep track of where you are in these tasks and go from one to the other without losing information. Almost all of today's operating systems can do this. When you open your Web browser and then open Word at the same time, you are causing the operating system to do multitasking.

Virtual memory Virtual memory is a feature of an operating system (OS) that allows a computer to compensate for shortages of physical memory by temporarily transferring pages of data from random access memory (RAM) to disk storage. Eventually, the OS will need to retrieve the data that was moved to temporarily to disk storage -- but remember, the only reason the OS moved pages of data from RAM to disk storage to begin with was because it was running out of RAM.

Paging When using virtual memory, the OS needs to retrieve the data that was moved to temporarily to disk storage; the only reason the OS moved pages of data from RAM to disk storage to begin with was because it was running out of RAM. To solve the problem, the operating system will need to move other pages to hard disk so it has room to bring back the pages it needs right away from temporary disk storage. This process is known as paging or swapping and the temporary storage space on the hard disk is called a pagefile or a swap file. Swapping, which happens so quickly that the end user doesn't know it's happening, is carried out by the computer’s memory manager unit (MMU). The memory manager unit may use one of several algorithms to choose which page should be swapped out, including Least Recently Used (LRU), Least Frequently Used (LFU) or Most Recently Used (MRU).

Interrupt hardware interrupts software interrupts An interrupt is a signal to the processor emitted by hardware or software indicating an event that needs immediate attention. An interrupt alerts the OS to a high-priority condition requiring the interruption of the current code the processor is executing. The OS responds by suspending its current activities, saving its state, and executing a function called an interrupt handler to deal with the event. This interruption is temporary, and, after the interrupt handler finishes, the processor resumes normal activities. There are two types of interrupts: hardware interrupts software interrupts

Polling Polling is the process where the computer or controlling device waits for an external device to check for its readiness or state, often with low-level hardware. For example, when a printer is connected via a parallel port, the computer waits until the printer has received the next character. Alternative to polling?: interrupts (signals generated by devices or processes to indicate that they need attention) Although polling can be very simple, in many situations (e.g., multitasking operating systems) it is more efficient to use interrupts because it can reduce processor usage and/or bandwidth consumption.

For the exams: know when & why Technique When is it used? Why is it used? Scheduling Policies Multi-tasking Virtual memory Interrupts Polling