operating system - al-aqsa...

73
Dr.Khaled Kh. Sharaf Faculty Of Computers And Information Technology First Term 2019- 2020 Operating System

Upload: others

Post on 30-Jan-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

  • Dr.Khaled Kh. Sharaf

    Faculty Of Computers

    And Information

    Technology

    First Term

    2019- 2020

    Operating System

  • Introduction

    Chapter 1: Introduction

  • Chapter 1: Introduction

    Objectives

    • To describe the basic organization of computer

    systems.

    • To provide a grand tour of the major components of

    operating systems.

    • To give an overview of the many types of computing

    environments.

    • To explore several open-source operating systems.

  • What is an Operating System?

    • An operating system is a program that manages a

    computer’s hardware

    • A program that acts as an intermediary between a user

    of a computer and the computer hardware.

    • Because an operating system is large and complex, it

    must be created piece by piece.

    • Each of these pieces should be a well-delineated

    portion of the system, with carefully defined inputs,

    outputs, and functions

    • The purpose of an operating system is to provide an

    environment in which a user can execute programs in a

    convenient and efficient manner

    Chapter 1: Introduction

  • Operating System Goals?

    • Execute user programs and make solving user

    problems easier

    • Make the computer system convenient to use

    • Use the computer hardware in an efficient manner

    Chapter 1: Introduction

  • Computer System Structure

    • Computer system can be divided into four

    components:

    • Hardware – provides basic computing

    resources

    • CPU, memory, I/O devices

    • Operating system

    • Controls and coordinates use of hardware

    among various applications and users

    • Application programs – define the ways in

    which the system resources are used to solve

    the computing problems of the users

    • Word processors, compilers, web browsers,

    database systems, video games

    • Users

    • People, machines, other computers

    Chapter 1: Introduction

  • Four Components of a Computer System

    Chapter 1: Introduction

  • What Operating Systems Do

    Depends on the point of view

    1- User View

    • Users want convenience, ease of use and good

    performance

    • Don’t care about resource utilization

    • But shared computer such as mainframe or

    minicomputer must keep all users happy

    • Users of dedicate systems such as workstations have

    dedicated resources but frequently use shared

    resources from servers

    • Handheld computers are resource poor, optimized for

    usability and battery life

    • Some computers have little or no user interface,

    such as embedded computers in devices and

    automobiles

    Chapter 1: Introduction

  • What Operating Systems Do

    Depends on the point of view

    2- System View

    - The operating system is the program most intimately

    involved with the hardware.

    - In this context, we can view an operating system as

    a resource allocator.

    - A computer system has many resources that may be

    required to solve a problem: CPU time, memory space,

    file-storage space, I/O devices, and so on.

    - The operating system acts as the manager of these

    resources.

    Chapter 1: Introduction

  • What Operating Systems Do

    Depends on the point of view

    1- System View

    - An operating system is a control program.

    - A control program manages the execution of user

    programs to prevent errors and improper use of the

    computer.

    - It is especially concerned with the operation and

    control of I/O devices.

    Chapter 1: Introduction

  • Operating System Definition

    • OS is a resource allocator

    • Manages all resources

    • Decides between conflicting requests

    for efficient and fair resource use

    • OS is a control program

    • Controls execution of programs to

    prevent errors and improper use of the

    computer

    Chapter 1: Introduction

  • Operating System Definition (Cont.)

    • No universally accepted definition

    • “Everything a vendor ships when you order an operating system” is a good approximation

    • But varies wildly

    • Amore common definition, and the one that we usually

    follow, is that the operating system is the one

    program running at all times on the computer—usually

    called the kernel.

    • Along with the kernel, there are two other types of

    programs:

    1. system programs, which are associated with the

    operating system but are not necessarily part

    of the kernel.

    2. application programs, which include all programs

    not associated with the operation of the system.

    Chapter 1: Introduction

  • Operating System Definition (Cont.)

    • Today, however, if we look at operating systems for

    mobile devices, we see that once again the number of

    features constituting the operating system is

    increasing.

    • Mobile operating systems often include not only a core

    kernel but also middleware—a set of software

    frameworks that provide additional services to

    application developers.

    • For example,

    • each of the two most prominent mobile operating

    systems—Apple’s iOS and Google’s Android—features a

    core kernel along with middle ware that supports

    databases, multimedia, and graphics (to name a only

    few).

    Chapter 1: Introduction

  • Computer Startup

    • For a computer to start running—for instance, when it

    is powered up or rebooted—it needs to have an initial

    program to run.

    • This initial program, or bootstrap program, tends to

    be simple.

    • Typically, it is stored within the computer hardware

    in read-only memory (ROM) or electrically erasable

    programmable read-only memory (EEPROM), known by the

    general term firmware.

    • It initializes all aspects of the system, from CPU

    registers to device controllers to memory contents.

    Chapter 1: Introduction

  • Computer Startup

    • The bootstrap program must know how to load the

    operating system and how to start executing that

    system.

    • To accomplish this goal, the bootstrap program must

    locate the operating-system kernel and load it into

    memory.

    Chapter 1: Introduction

  • Computer System Organization

    • A modern general-purpose computer system consists of

    one or more CPUs and a number of device controllers

    connected through a common bus that provides access to

    shared memory.

    • Each device controller is in charge of a specific type

    of device (for example, disk drives, audio devices, or

    video displays).

    Chapter 1: Introduction

  • Computer System Organization

    • The CPU and the device controllers can execute in

    parallel, competing for memory cycles.

    • To ensure orderly access to the shared memory, a

    memory controller synchronizes access to the memory

    Chapter 1: Introduction

  • Computer-System Operation

    • I/O devices and the CPU can execute concurrently

    • Each device controller is in charge of a particular

    device type

    • Each device controller has a local buffer

    • CPU moves data from/to main memory to/from local

    buffers

    • I/O is from the device to local buffer of controller

    • Device controller informs CPU that it has finished

    its operation by causing an interrupt

    What happen when the CPU is interrupting?

    Chapter 1: Introduction

  • Computer-System Operation

    What happen when the CPU is interrupting?

    When the CPU is interrupted, it stops what it is doing

    and immediately transfers execution to a fixed

    location.

    The fixed location usually contains the starting

    address where the service routine for the interrupt is

    located.

    The interrupt service routine executes; on completion,

    the CPU resumes the interrupted computation

    Chapter 1: Introduction

  • Common Functions of Interrupts

    • Interrupts are an important part of a computer

    architecture.

    • Each computer design has its own interrupt mechanism,

    but several functions are common.

    • Interrupt transfers control to the interrupt service

    routine generally, through the interrupt vector, which

    contains the addresses of all the service routines

    • Interrupt architecture must save the address of the

    interrupted instruction

    • A trap or exception is a software-generated interrupt

    caused either by an error or a user request

    • An operating system is interrupt driven

    Chapter 1: Introduction

  • Interrupt Handling

    • The operating system preserves the state

    of the CPU by storing registers and the

    program counter

    • Determines which type of interrupt has

    occurred:

    • polling

    • vectored interrupt system

    • Separate segments of code determine what

    action should be taken for each type of

    interrupt

    Chapter 1: Introduction

  • Interrupt Timeline

    Chapter 1: Introduction

  • I/O Structure

    • Storage is only one of many types of I/O devices within

    a computer.

    • A large portion of operating system code is dedicated to

    managing I/O, both because of its importance to the

    reliability and performance of a system and because of

    the varying nature of the devices.

    • A general-purpose computer system consists of CPUs and

    multiple device controllers that are connected through a

    common bus

    • Each device controller is in charge of a specific type

    of device.

    • Depending on the controller, more than one device may

    be attached.

    Chapter 1: Introduction

  • I/O Structure

    • seven or more devices can be attached to the small

    computer-systems interface (SCSI) controller

    • A device controller maintains some local buffer storage

    and a set of special-purpose registers

    • The device controller is responsible for moving the

    data between the peripheral devices that it controls and

    its local buffer storage

    • Typically, operating systems have a device driver for

    each device controller

    • This device driver under stands the device controller

    and provides the rest of the operating system with a

    uniform interface to the device

    Chapter 1: Introduction

  • I/O Structure

    • To start an I/O operation, the device driver loads the

    appropriate registers within the device controller.

    • The device controller, in turn, examines the contents

    of these registers to determine what action to take

    (such as “read a character from the keyboard”).

    • The controller starts the transfer of data from the

    device to its local buffer.

    • Once the transfer of data is complete, the device

    controller informs the device driver via an interrupt

    that it has finished its operation.

    Chapter 1: Introduction

  • I/O Structure

    • The device driver then returns control to the operating

    system, possibly returning the data or a pointer to the

    data if the operation was a read.

    • For other operations, the device driver returns status

    information

    • This form of interrupt-driven I/O is fine for moving

    small amounts of data but can produce high over head

    when used for bulk data movement such as disk I/O.

    • To solve this problem, direct memory access (DMA) is

    used

    Chapter 1: Introduction

  • I/O Structure

    • After I/O starts, control returns to user program only

    upon I/O completion

    • Wait instruction idles the CPU until the next

    interrupt

    • Wait loop (contention for memory access)

    • At most one I/O request is outstanding at a time, no

    simultaneous I/O processing

    • After I/O starts, control returns to user program

    without waiting for I/O completion

    • System call – request to the OS to allow user to wait

    for I/O completion

    • Device-status table contains entry for each I/O device

    indicating its type, address, and state

    • OS indexes into I/O device table to determine device

    status and to modify table entry to include interrupt

    Chapter 1: Introduction

  • Storage Definitions and Notation Review

    The basic unit of computer storage is the bit. A bit can contain one

    of two values, 0 and 1. All other storage in a computer is based on

    collections of bits. Given enough bits, it is amazing how many

    things a computer can represent: numbers, letters, images, movies,

    sounds, documents, and programs, to name a few. A byte is 8 bits,

    and on most computers it is the smallest convenient chunk of

    storage. For example, most computers don’t have an instruction to

    move a bit but do have one to move a byte. A less common term is

    word, which is a given computer architecture’s native unit of data.

    A word is made up of one or more bytes. For example, a computer that

    has 64-bit registers and 64-bit memory addressing typically has 64-

    bit (8-byte) words. A computer executes many operations in its

    native word size rather than a byte at a time.

    Computer storage, along with most computer throughput, is generally

    measured and manipulated in bytes and collections of bytes.

    A kilobyte, or KB, is 1,024 bytes

    a megabyte, or MB, is 1,0242 bytes

    a gigabyte, or GB, is 1,0243 bytes

    a terabyte, or TB, is 1,0244 bytes

    a petabyte, or PB, is 1,0245 bytes

    Computer manufacturers often round off these numbers and say that a

    megabyte is 1 million bytes and a gigabyte is 1 billion bytes.

    Networking measurements are an exception to this general rule; they

    are given in bits (because networks move data a bit at a time).

    Chapter 1: Introduction

  • Storage Structure

    • Main memory – only large storage media that the CPU

    can access directly

    • Random access

    • Typically volatile

    • Secondary storage – extension of main memory that

    provides large nonvolatile storage capacity

    • Hard disks – rigid metal or glass platters covered

    with magnetic recording material

    • Disk surface is logically divided into tracks,

    which are subdivided into sectors

    • The disk controller determines the logical

    interaction between the device and the computer

    • Solid-state disks – faster than hard disks,

    nonvolatile

    • Various technologies

    • Becoming more popular

    Chapter 1: Introduction

  • Storage Hierarchy

    • Storage systems organized in hierarchy

    • Speed

    • Cost

    • Volatility

    • Caching – copying information into faster storage

    system; main memory can be viewed as a cache for

    secondary storage

    • Device Driver for each device controller to manage

    I/O

    • Provides uniform interface between controller and

    kernel

    Chapter 1: Introduction

  • Storage-Device Hierarchy

    Chapter 1: Introduction

  • Caching

    • Important principle, performed at many levels in a

    computer (in hardware, operating system, software)

    • Information in use copied from slower to faster

    storage temporarily

    • Faster storage (cache) checked first to determine if

    information is there

    • If it is, information used directly from the cache

    (fast)

    • If not, data copied to cache and used there

    • Cache smaller than storage being cached

    • Cache management important design problem

    • Cache size and replacement policy

    Chapter 1: Introduction

  • Direct Memory Access Structure

    • Used for high-speed I/O devices able to transmit

    information at close to memory speeds

    • Device controller transfers blocks of data from

    buffer storage directly to main memory without CPU

    intervention

    • Only one interrupt is generated per block, rather

    than the one interrupt per byte

    Chapter 1: Introduction

  • How a Modern Computer Works

    A von Neumann

    architecture

    Chapter 1: Introduction

  • Computer-System Architecture

    • Most systems use a single general-purpose processor

    • Most systems have special-purpose processors as well

    • Multiprocessors systems growing in use and importance

    • Also known as parallel systems, tightly-coupled

    systems

    • Advantages include:

    1. Increased throughput

    2. Economy of scale

    3. Increased reliability – graceful degradation or

    fault tolerance

    • Two types:

    1. Asymmetric Multiprocessing – each processor is

    assigned a specie task.

    2. Symmetric Multiprocessing – each processor

    performs all tasks

    Chapter 1: Introduction

  • Symmetric Multiprocessing Architecture

    Chapter 1: Introduction

  • A Dual-Core Design

    • Multi-chip and multicore

    • Systems containing all chips

    • Chassis containing multiple separate systems

    Chapter 1: Introduction

  • Clustered Systems

    • Like multiprocessor systems, but multiple systems

    working together

    • Usually sharing storage via a storage-area

    network (SAN)

    • Provides a high-availability service which

    survives failures

    • Asymmetric clustering has one machine in hot-

    standby mode

    • Symmetric clustering has multiple nodes running

    applications, monitoring each other

    • Some clusters are for high-performance computing

    (HPC)

    • Applications must be written to use

    parallelization

    • Some have distributed lock manager (DLM) to avoid

    conflicting operations

    Chapter 1: Introduction

  • Clustered Systems

    Chapter 1: Introduction

  • Operating System Structure

    • Multiprogramming (Batch system) needed for

    efficiency

    • Single user cannot keep CPU and I/O devices

    busy at all times

    • Multiprogramming organizes jobs (code and data)

    so CPU always has one to execute

    • A subset of total jobs in system is kept in

    memory

    • One job selected and run via job scheduling

    • When it has to wait (for I/O for example), OS

    switches to another job

    Chapter 1: Introduction

  • Operating System Structure

    • Timesharing (multitasking) is logical extension

    in which CPU switches jobs so frequently that

    users can interact with each job while it is

    running, creating interactive computing

    • Response time should be < 1 second

    • Each user has at least one program executing in

    memory process

    • If several jobs ready to run at the same time

    CPU scheduling

    • If processes don’t fit in memory, swapping moves them in and out to run

    • Virtual memory allows execution of processes

    not completely in memory

    Chapter 1: Introduction

  • Memory Layout for Multiprogrammed System

    Chapter 1: Introduction

  • Operating-System Operations

    • Interrupt driven (hardware and software)

    • Hardware interrupt by one of the devices

    • Software interrupt (exception or trap):

    • Software error (e.g., division by zero)

    • Request for operating system service

    • Other process problems include infinite

    loop, processes modifying each other or

    the operating system

    Chapter 1: Introduction

  • Operating-System Operations (cont.)

    • Dual-mode operation allows OS to protect

    itself and other system components

    • User mode and kernel mode

    • Mode bit provided by hardware

    • Provides ability to distinguish when

    system is running user code or kernel

    code

    • Some instructions designated as

    privileged, only executable in kernel

    mode

    • System call changes mode to kernel,

    return from call resets it to user

    • Increasingly CPUs support multi-mode

    operations

    • i.e. virtual machine manager (VMM) mode for

    guest VMs

    Chapter 1: Introduction

  • Transition from User to Kernel Mode

    • Timer to prevent infinite loop / process hogging resources

    • Timer is set to interrupt the computer after some time

    period

    • Keep a counter that is decremented by the physical clock.

    • Operating system set the counter (privileged instruction)

    • When counter zero generate an interrupt

    • Set up before scheduling process to regain control or

    terminate program that exceeds allotted time

    Chapter 1: Introduction

  • Process Management

    A program does nothing unless its instructions are

    executed by a CPU.

    A program in execution, as mentioned, is a process.

    A time-shared user program such as a compiler is a

    process.

    A word-processing program being run by an individual

    user on a PC is a process.

    A system task, such as sending output to a printer, can

    also be a process (or at least part of one).

    For now, you can consider a process to be a job or a

    time-shared program, but later you will learn that

    the concept is more general.

    Chapter 1: Introduction

  • Process Management

    • A process needs certain resources—including CPU time,

    memory, files, and I/O devices—to accomplish its task.

    • These resources are either given to the process when

    it is created or allocated to it while it is running.

    • In addition to the various physical and logical

    resources that a process obtains when it is created,

    various initialization data (input) may be passed

    along.

    Chapter 1: Introduction

  • Process Management • A process is a program in execution. It is a unit

    of work within the system. Program is a passive

    entity, process is an active entity.

    • Process needs resources to accomplish its task

    • CPU, memory, I/O, files

    • Initialization data

    • Process termination requires reclaim of any reusable

    resources

    • Single-threaded process has one program counter

    specifying location of next instruction to execute

    • Process executes instructions sequentially, one at a

    time, until completion

    • Multi-threaded process has one program counter per

    thread

    • Typically system has many processes, some user, some

    operating system running concurrently on one or more

    CPUs

    • Concurrency by multiplexing the CPUs among the

    processes / threads

    Chapter 1: Introduction

  • Process Management Activities

    The operating system is responsible for the

    following activities in connection with process

    management:

    • Creating and deleting both user and system

    processes

    • Suspending and resuming processes

    • Providing mechanisms for process synchronization

    • Providing mechanisms for process communication

    • Providing mechanisms for deadlock handling

    Chapter 1: Introduction

  • Memory Management

    • The main memory is central to the operation of a

    modern computer system.

    • Main memory is a large array of bytes, ranging in

    size from hundreds of thousands to billions.

    • Each byte has its own address.

    • Main memory is a repository of quickly accessible

    data shared by the CPU and I/O devices.

    • The central processor reads instructions from main

    memory during the instruction-fetch cycle and both

    reads and writes data from main memory during the

    data-fetch cycle (on a von Neumann architecture) .

    • As noted earlier, the main memory is generally the

    only large storage device that the CPU is able to

    address and access directly

    Chapter 1: Introduction

  • Memory Management

    • To execute a program all (or part) of the

    instructions must be in memory

    • All (or part) of the data that is needed by the

    program must be in memory.

    • Memory management determines what is in memory and

    when

    • Optimizing CPU utilization and computer response

    to users

    • Memory management activities

    • Keeping track of which parts of memory are

    currently being used and by whom

    • Deciding which processes (or parts thereof) and

    data to move into and out of memory

    • Allocating and deallocating memory space as

    needed

    Chapter 1: Introduction

  • Storage Management

    • OS provides uniform, logical view of information storage

    • Abstracts physical properties to logical storage unit

    - file

    • Each medium is controlled by device (i.e., disk drive,

    tape drive)

    • Varying properties include access speed, capacity,

    data-transfer rate, access method (sequential or

    random)

    • File-System management

    • Files usually organized into directories

    • Access control on most systems to determine who can

    access what

    • OS activities include

    • Creating and deleting files and directories

    • Primitives to manipulate files and directories

    • Mapping files onto secondary storage

    • Backup files onto stable (non-volatile) storage media

    Chapter 1: Introduction

  • Mass-Storage Management

    • Usually disks used to store data that does not fit in

    main memory or data that must be kept for a “long” period of time

    • Proper management is of central importance

    • Entire speed of computer operation hinges on disk

    subsystem and its algorithms

    • OS activities

    • Free-space management

    • Storage allocation

    • Disk scheduling

    • Some storage need not be fast

    • Tertiary storage includes optical storage, magnetic

    tape

    • Still must be managed – by OS or applications

    • Varies between WORM (write-once, read-many-times)

    and RW (read-write)

    Chapter 1: Introduction

  • Performance of Various Levels of Storage

    Movement between levels of storage hierarchy can

    be explicit or implicit

    Chapter 1: Introduction

  • Migration of data “A” from Disk to Register

    • Multitasking environments must be careful to

    use most recent value, no matter where it is

    stored in the storage hierarchy

    • Multiprocessor environment must provide cache

    coherency in hardware such that all CPUs have

    the most recent value in their cache

    • Distributed environment situation even more

    complex

    • Several copies of a datum can exist

    • Various solutions covered in Chapter 17

    Chapter 1: Introduction

  • I/O Subsystem

    • One purpose of OS is to hide peculiarities of

    hardware devices from the user

    • I/O subsystem responsible for

    • Memory management of I/O including buffering

    (storing data temporarily while it is being

    transferred), caching (storing parts of data in

    faster storage for performance), spooling (the

    overlapping of output of one job with input of

    other jobs)

    • General device-driver interface

    • Drivers for specific hardware devices

    Chapter 1: Introduction

  • Protection and Security

    • Protection – any mechanism for controlling access of

    processes or users to resources defined by the OS

    • Security – defense of the system against internal and

    external attacks

    • Huge range, including denial-of-service, worms,

    viruses, identity theft, theft of service

    • Systems generally first distinguish among users, to

    determine who can do what

    • User identities (user IDs, security IDs) include

    name and associated number, one per user

    • User ID then associated with all files, processes

    of that user to determine access control

    • Group identifier (group ID) allows set of users to

    be defined and controls managed, then also

    associated with each process, file

    • Privilege escalation allows user to change to

    effective ID with more rights

    Chapter 1: Introduction

  • Kernel Data Structures

    Many similar to standard programming data

    structures

    Singly linked list

    Doubly linked list

    Circular linked list

    Chapter 1: Introduction

  • Kernel Data Structures

    • Binary search tree

    left

  • Kernel Data Structures

    • Hash function can create a hash map

    • Bitmap – string of n binary digits representing

    the status of n items

    • Linux data structures defined in

    include files ,

    ,

    Chapter 1: Introduction

  • Computing Environments - Traditional

    • Stand-alone general purpose machines

    • But blurred as most systems interconnect with

    others (i.e., the Internet)

    • Portals provide web access to internal systems

    • Network computers (thin clients) are like Web

    terminals

    • Mobile computers interconnect via wireless networks

    • Networking becoming ubiquitous – even home systems

    use firewalls to protect home computers from

    Internet attacks

    Chapter 1: Introduction

  • Computing Environments - Mobile

    • Handheld smartphones, tablets, etc

    • What is the functional difference between

    them and a “traditional” laptop?

    • Extra feature – more OS features (GPS,

    gyroscope)

    • Allows new types of apps like augmented

    reality

    • Use IEEE 802.11 wireless, or cellular data

    networks for connectivity

    • Leaders are Apple iOS and Google Android

    Chapter 1: Introduction

  • Computing Environments – Distributed

    • Distributed computiing

    • Collection of separate, possibly heterogeneous,

    systems networked together

    • Network is a communications path, TCP/IP most

    common

    • Local Area Network (LAN)

    • Wide Area Network (WAN)

    • Metropolitan Area Network (MAN)

    • Personal Area Network (PAN)

    • Network Operating System provides features

    between systems across network

    • Communication scheme allows systems to exchange

    messages

    • Illusion of a single system

    Chapter 1: Introduction

  • Computing Environments – Client-Server

    Client-Server Computing

    Dumb terminals supplanted by smart PCs

    Many systems now servers, responding to

    requests generated by clients

    Compute-server system provides an

    interface to client to request services

    (i.e., database)

    File-server system provides interface

    for clients to store and retrieve files

    Chapter 1: Introduction

  • Computing Environments - Peer-to-Peer

    • Another model of distributed system

    • P2P does not distinguish clients and

    servers

    • Instead all nodes are considered

    peers

    • May each act as client, server or

    both

    • Node must join P2P network

    • Registers its service with central

    lookup service on network, or

    • Broadcast request for service and

    respond to requests for service via

    discovery protocol

    • Examples include Napster and

    Gnutella, Voice over IP (VoIP) such

    as Skype

    Chapter 1: Introduction

  • Computing Environments - Virtualization

    • Allows operating systems to run applications within

    other OSes

    • Vast and growing industry

    • Emulation used when source CPU type different from

    target type (i.e. PowerPC to Intel x86)

    • Generally slowest method

    • When computer language not compiled to native

    code – Interpretation

    • Virtualization – OS natively compiled for CPU,

    running guest OSes also natively compiled

    • Consider VMware running WinXP guests, each

    running applications, all on native WinXP host OS

    • VMM (virtual machine Manager) provides

    virtualization services

    Chapter 1: Introduction

  • Computing Environments - Virtualization

    • Use cases involve laptops and desktops

    running multiple OSes for exploration or

    compatibility

    • Apple laptop running Mac OS X host, Windows as a

    guest

    • Developing apps for multiple OSes without having

    multiple systems

    • QA testing applications without having multiple

    systems

    • Executing and managing compute environments

    within data centers

    • VMM can run natively, in which case they

    are also the host

    • There is no general purpose host then (VMware ESX

    and Citrix XenServer)

    Chapter 1: Introduction

  • Computing Environments - Virtualization

    Chapter 1: Introduction

  • Computing Environments – Cloud Computing

    • Delivers computing, storage, even apps as a service

    across a network

    • Logical extension of virtualization because it uses

    virtualization as the base for it functionality.

    • Amazon EC2 has thousands of servers, millions of

    virtual machines, petabytes of storage available

    across the Internet, pay based on usage

    • Many types

    • Public cloud – available via Internet to anyone

    willing to pay

    • Private cloud – run by a company for the company’s

    own use

    Chapter 1: Introduction

  • Computing Environments – Cloud Computing

    • Hybrid cloud – includes both public and private

    cloud components

    • Software as a Service (SaaS) – one or more

    applications available via the Internet (i.e.,

    word processor)

    • Platform as a Service (PaaS) – software stack

    ready for application use via the Internet (i.e.,

    a database server)

    • Infrastructure as a Service (IaaS) – servers or

    storage available over Internet (i.e., storage

    available for backup use)

    Chapter 1: Introduction

  • Computing Environments – Cloud Computing

    • Cloud computing environments composed of

    traditional OSes, plus VMMs, plus cloud

    management tools

    • Internet connectivity requires security

    like firewalls

    • Load balancers spread traffic across

    multiple applications

    Chapter 1: Introduction

  • Computing Environments – Real-Time Embedded

    Systems

    • Real-time embedded systems most prevalent form of

    computers

    • Vary considerable, special purpose, limited

    purpose OS, real-time OS

    • Use expanding

    • Many other special computing environments as well

    • Some have OSes, some perform tasks without an OS

    • Real-time OS has well-defined fixed time

    constraints

    • Processing must be done within constraint

    • Correct operation only if constraints met

    Chapter 1: Introduction

  • Open-Source Operating Systems

    • Operating systems made available in source-code

    format rather than just binary closed-source

    • Counter to the copy protection and Digital Rights

    Management (DRM) movement

    • Started by Free Software Foundation (FSF), which

    has “copyleft” GNU Public License (GPL)

    • Examples include GNU/Linux and BSD UNIX (including

    core of Mac OS X), and many more

    • Can use VMM like VMware Player (Free on Windows),

    Virtualbox (open source and free on many platforms

    - http://www.virtualbox.com)

    • Use to run guest operating systems for

    exploration

    Chapter 1: Introduction