Popek and Goldberg virtualization requirements
From Free net encyclopedia
The Popek and Goldberg virtualization requirements are a set of sufficient conditions for a computer architecture to efficiently support system virtualization. They were introduced by Gerald J. Popek and Robert P. Goldberg in their 1974 article "Formal Requirements for Virtualizable Third Generation Architectures"<ref>Template:Cite journal</ref>. Even though the requirements are derived under simplifying assumptions, they still represent a convenient way of determining whether a computer architecture support efficient virtualization and provide guidelines for the design of virtualizable computer architectures.
Contents |
Introduction
System virtual machines are virtual machines capable of virtualizing a full set of hardware resources, including a processor (or processors), memory and storage resources and peripheral devices. A virtual machine monitor (VMM) is the piece of software that provides the abstraction of a virtual machine. There are three properties of interest when analyzing the environment created by a VMM:
- Equivalence: a program running under the VMM should exhibit a behavior essentially identical to that demonstrated when running on the original machine directly.
- Resource control: the VMM must be in complete control of the virtualized resources.
- Efficiency.
In Popek and Goldberg terminology, a VMM must present all 3 properties. In today's terminology, VMM are typically assumed to satisfy the equivalence and resource control properties. So, in a sense, Popek and Goldberg's VMMs are today's efficient VMM.
The problem addressed by Popek and Goldberg then is determining what are the characteristics that the Instruction Set Architecture (ISA) of the original machine must possess in order to allow the creation of VMMs with the above mentioned properties. Their analysis derives such characteristics for a model of "third generation architectures" (e.g., IBM 360, Honeywell 6000, DEC PDP-10), but is general enough to be naturally extended to current machines. The model includes a processor that can operate either in system or user mode and a linear, uniformly addressable memory. It is assumed that a subset of the instruction set is available only when in system mode and that memory is addressed relative to a relocation register. I/O and interrupts are not modeled.
Virtualization Requirements
To derive their virtualization requirements, Popek and Goldberg introduce a classification of instructions of a ISA into 3 different groups:
- Privileged instructions are those that trap if the processor is in user mode and do not trap if it is in system mode.
- Control sensitive instructions are those that attempt to change the configuration of resources in the system.
- Behavior sensitive instructions are those whose behavior or result depends on the configuration of resources (the content of the relocation register or the processor's mode).
The main result of Popek and Goldberg's analysis can then be expressed as follows.
Theorem 1. For any conventional third generation computer, a VMM may be constructed if the set of sensitive instructions for that computer is a subset of the set of privileged instructions.
Intuitively, the theorem states that to build a VMM it is sufficient that all instructions that could affect the correct functioning of the VMM (sensitive instructions) always trap and pass control to the VMM. This guarantees the resource control property. Non privileged instructions must instead be executed natively (efficiency). The holding of the equivalence property also follows.
A related problem is that of deriving the ISA requirements for recursive virtualization, that is, the conditions under which a VMM that can run on a copy of itself can be built. Popek and Goldberg presents the following (sufficient) conditions.
Theorem 2. A conventional third generation computer is recursively virtualizable if i) is virtualizable and ii) a VMM without any timing dependencies can be constructed for it.
Handling critical instructions
The conditions for ISA virtualization expressed in Theorem 1 are sufficient and non necessary. Indeed, VMMs for non virtualizable ISA (in the Popek and Goldberg's sense) have routinely been built, at the expense of the efficiency property.
The virtualization of such architectures requires to handle correctly critical instructions, i.e., sensitive but unprivileged instructions. One approach, known as patching adopts techniques commonly used in dynamic recompilation: critical instructions are discovered at run-time and replaced with a trap into the VMM. Various mechanisms, such as the caching of emulation code or hardware assists, have been proposed to make the patching process more efficient. A different approach is that of paravirtualization, that requires guest operating systems to be modified (ported) before running in the virtual environment.
Instruction Sets
In this section some relevant architectures and how they relate to the virtualization requirements are presented.
PDP-10
The PDP-10 architecture has a few instructions which are sensitive (alter or query the processor's mode) but not privileged<ref>Template:Cite conference </ref>:
- JSR: jump to subroutine
- JSP: jump and save program counter
- PUSHJ: push down and jump
- JRST: jump and restore
System/370
All sensitive instructions in the System/370 are privileged: it satisfies the virtualization requirements.
IA-32 (x86)
The IA-32 instruction set contains 17 sensitive, unprivileged instructions<ref>Template:Cite conference</ref>. They can be categorized in two groups:
- Sensitive register instructions: read or change sensitive registers and/or memory locations such as a clock register or interrupt registers:
- SGDT, SIDT, SLDT
- SMSW
- PUSHF, POPF
- Protection system instructions: reference the storage protection system, memory or address relocation system:
- LAR, LSL, VERR, VERW
- POP
- PUSH
- CALL, JMP, INT n, RET
- STR
- MOVE
IA-64
The effort needed to support virtualization on the Itanium processor is described in <ref>Template:Cite conference</ref>
References
<references/>