[OSC] Day8:Virtualization

Virtualization

Fundamental idea: Virtual Machines
  • Abstract hardware of a single computer into several different execution environments.
  • Similar to layered approach, but layer creates virtual system(virtual machine, or VM) on which operation systems or applications can run several components
  • The base is hardware, and there is a VMM, on the top is different server on different OS
We have already seen that an OS virtualises(Why?)
Virtual Memory
Virtual file system
However, a VM virtualises an entire physical machine:
Providing the illusion that software has full control over the hardware
As implication, you can run multiple instances of an OS(or different OS) on the same physical machine

Components

Host -underlying hardware system
Virtual machine manager(VMM) or hypervisor - creates and runs virtual machines by providing an interface that is identical to the host(Except in the case of paravirtualization)
Guest -process provided with virtual copy of the host(usually an operating system)

Main properties

  • Isolation: each VM is independent, so failures do not affect the host
  • Encapsulation: state can be captured into a file(checking pointing, migration. It is easier than migrating processes. We merely have to move the memory image that contains OS tables)
  • Interposition: All guest actions go through the monitor(VMM), which can inspect, modify, deny operations
  • Fewer physical machines saves money on hardware and electricity
  • Run legacy applications

Requirements for virtualisation

  • Safety: the hypervisor should have full control of the virtualised resources(Resources sharing)
  • Fidelity: the behaviour of a program on a VM should be identical to that of the same program running on bare hardware. What if we run privileged instructions?(Virtualisation Technology(VT) - hardware support)
  • Efficiency: much of the code in the VM should run without intervention by the hypervisor(Overheads)
It is not like java VM. A java VM is very different from the physical machine that runs it. A hardware-level VM reflects underlying processor architecture
It is not like simulator or emulator. Simulators generally have very high overhead. A hardware-level VM utilises the underlying physical processor directly

Approaches to virtualisation

Full Virtualisation: It tries to trick the guest into believing that is has the entire system
Paravirtualisation: VM does not simulate hardware. It offers a set of hypercalls which allows the guest to send explicit requests to the hypervisor(as a system call offers kernel services to applications)
Process-level virtualisation: The aim is to simply allow a process that was written for a different OS to run. For instance, “Wine” in Linux to run Windows applications, “Cygwin” to run Linux shell on Windows.

Types of hypervisors

There are two main types of VMMs:
  • Natives(Type 1): Technically, it is like an OS, since it is the only program running in the most privileged mode. Its job is to support multiple copies of the actual hardware.
  • Hosted(Type 2): It relies on a OS to allocate and schedule resources, very much like a regular process
  • Both VMMs act as real hardware
  • enter image description here

Native Virtual Machines(Type 1 Hypervisors)

Hypervisor installs directly on hardware
The hypervisor is the real kernel
(Unmodified) OS runs in the user mode:
  • It seems to be in kernel model: virtual kernel mode
  • Privileged instructions need to be processed by the hypervisor
  • Hardware VT technology will be necessary
    Paravirtualisation-based VMs are typically based on type 1 hypervisors.
    Examples: VMware ESX Server, Xen, Microsoft Viridian (2008)

Hosted Virtual Machines(Type 2 Hypervisors)

Installs and runs VMs as an application on an existing OS.
Relies on host scheduling. Therefore, it may not be suitable for intensive VM workloads.
I/O path is slow because it requires world switch.
Process-level virtualisation will rely on type 2 hypervisors. It needs an OS.
Examples: VMware Player/Workstation/Server, Microsoft Virtual PC/Server, Parallels Desktop
A hypervisor must virtualise:
  • Privileged instructions (Exceptions and interruptions)
  • CPU
  • Memory
  • I/O devices

What do we need to Virtualise?

Virtualising Privileged Instructions
It is not safe to let guest kernel run in kernel mode
So a VM needs two modes: virtual user mode and virtual kernel mode. Both of which run in real user mode!
What happens when the guest OS executes an instruction that is allowed only when the CPU really is in kernel mode?(e.g. map virtual pages to physical pages)
  • Type 1 hypervisors: In CPUs without Virtual Techonology (VT), the instruction fails, and the OS crashes.
How does switch from virtual user mode to virtual kernel mode occur?
  • Attempting a privileged instruction in user mode causes an error -> trap
  • VMM gains control, analyses error, executes operation as attempted by guest
  • Returns control to guest in user mode
  • Known as trap-and-emulate
  • enter image description here

评论

发表评论

此博客中的热门博文

[MLE] Linear Classification

图片
Linear Classification Discriminant functions Least squares for classification Fisher’s linear discriminant K-Nearest Neighbour(KNN) Classification What’s decision boundaries/linearly separable? The goal in classification is to take an input vector x and to assign it to one of K discrete classes \(C_k\) where k = 1,…,K. In the most common scenario, the classes are taken to be disjoint, so that each input is assigned to one and only one class. The input space is thereby divided into decision regions whose boundaries are called decision boundaries or decision surfaces. In this blog, we consider linear models for classification , by which we mean that the decision surfaces are linear functions of the input vector x and hence are defined by (D-1) -dimensional hyperplanes within the D-dimensional input space. For example: in 3D input space, the decision boundary will be a 2D surface What is Linear Separability Linearly separable data: Datasets whose classes can be separated by
阅读全文

[AIM] MetaHeuristics

图片
Day2 Outline Metaheuristics -definition Single point based search method(simple stochastic local search) Iterated local search Scheduling Tabu Search Metaheuristic what is a metaheuristic? A metaheuristic is a high-level problem independent algorithmic framework that provides a set of guidelines or strategies to develop heuristic optimization algorithms. what is the difference between heuristic and metaheuristic? Heuristic : Heuristics are problem-dependent techniques. As such, they usually are adapted to the problem at hand and they try to take full advantage of the particularities of this problem. However, because they are often too greedy, they usually get trapped in a local optimum and thus fail, in general, to obtain the global optimum solution. Metaheuristic : Meta-heuristics, on the other hand, are problem-independent techniques . As such, they do not take advantage of any specificity of the problem and, therefore, can be used as black boxes . In general, t
阅读全文

[CS231] Neural Networks

图片
Neural Network Table of Contents: Quick intro without brain analogies Modeling one neuron Biological motivation and connections Single neuron as a linear classifier Commonly used activation functions Neural Network architectures Layer-wise organization Summary Additional references Quick intro It is possible to introduce neural networks without appealing to brain analogies. In the section on linear classification we computed scores for different visual categories given the image using the formula \( s = W x \), where \(W\) was a matrix and \(x\) was an input column vector containing all pixel data of the image. In the case of CIFAR-10, \(x\) is a [3072x1] column vector, and \(W\) is a [10x3072] matrix, so that the output scores is a vector of 10 class scores. An example neural network would instead compute \( s = W_2 \max(0, W_1 x) \). Here, \(W_1\) could be, for example, a [100x3072] matrix transforming the image into a 100-dimensional intermediate vector. The funct
阅读全文