US 7,127,548 B2Grant
Control register access virtualization performance improvement in the virtual-machine architecture
Issue Date:2006-10-24
•30 Claims
•6 Drawing Sheets
Abstract
In one embodiment, a command pertaining to one or more portions of a register is received from guest software. Further, a determination is made as to whether the guest software has access to all of the requested portions of the register based on indicators within a mask field that correspond to the requested portions of the register. If the guest software has access to all of the requested portions of the register, the command received from the guest software is executed on the requested portions of the register.
Metadata
Assignee
- Intel Corporation
Inventors
- Steve Bennett
- Andrew V. Anderson
- Erik Cota-Robles
- Stalinselvaraj Jeyasingh
- Alain Kagi
- Gilbert Neiger
- Richard Uhlig
- Michael A. Kozuch
Application Information
Application Number:US 10/124,641
Filing Date:2002-04-16
Priority Date:2002-04-16
Art Unit:2154
Classifications
IPC:
G06F12/00
Patent Drawings (6 sheets)
Description
Field of the Invention
[0001] The present invention relates generally to virtual machines, and more specifically to controlling accesses of guest software to registers in the virtual-machine architecture.
Background of the Invention
[0002] A conventional virtual-machine monitor (VMM) typically runs on a computer and presents to other software the abstraction of one or more virtual machines. Each virtual machine may function as a self-contained platform, running its own “guest operating system” (i.e., an operating system hosted by the VMM). The guest operating system expects to operate as if it were running on a dedicated computer rather than a virtual machine. That is, the guest operating system expects to control various computer operations and have access to hardware resources during these operations. The hardware resources may include processor-resident resources (e.g., control registers) and resources that reside in memory (e.g., descriptor tables).
[0003] In a virtual-machine environment, the VMM should be able to have ultimate control over these resources to provide proper operation of virtual machines and for protection from and between virtual machines. To achieve this, the VMM typically intercepts and arbitrates all accesses made by guest software to the hardware resources. Specifically, when guest software requests an operation that requires access to a protected hardware resource, the control over this operation is transferred to the VMM which then assures the validity of the access, emulates the functionality desired by guest software and transfers control back to the guest software, thereby protecting the hardware resources and virtualizing accesses of guest software to hardware resources. Because the number of hardware resource elements that need to be protected from accesses by guest software is large and such accesses may be frequent, there is a significant performance cost associated with this protection and virtualization.
[0004] One example of a hardware resource that is frequently accessed by guest software is a control register. For instance, in the instruction-set architecture (ISA) of the Intel Pentium IV (referred to herein as the IA-32 ISA), there are a number of control registers that are used to configure the processor operating mode, control the memory subsystem configuration and hardware resources, etc. Typically, when guest software attempts to access a bit in a control register, the control is transferred to the VMM which is responsible for maintaining consistency between write and read operations initiated by the guest software with respect to this bit. That is, the VMM controls the value that guest software is allowed to write to each bit of the control register and the value that guest software reads from each bit. Such virtualization of control register accesses creates significant performance overheads.
Brief Description of the Drawings
[0005] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
[0006] FIG. 1 illustrates one embodiment of a virtual-machine environment 100, in which the present invention may operate;
[0007] FIG. 2 is a flow diagram of one embodiment of a process for filtering accesses of guest software to a hardware resource such as a register;
[0008] FIG. 3 is a flow diagram of one embodiment of a process for filtering VM exits using a set of criteria;
[0009] FIG. 4 is a flow diagram of one embodiment of a process for providing an additional filtering of guest software accesses to a hardware resource such as a register; and
[0010] FIG. 5 is flow diagram of one embodiment of a process for controlling access to a hardware resource such as a register during VMX operation using a redirection map.
Description of Embodiments
[0011] A method and apparatus for controlling accesses of guest software to registers in a virtual-machine architecture are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, to one skilled in the art that the present invention can be practiced without these specific details.
[0012] Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer system's registers or memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
[0013] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussions, it is appreciated that throughout the present invention, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or the like, may refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer-system memories or registers or other such information storage, transmission or display devices.
[0014] In the following detailed description of the embodiments, reference is made to the accompanying drawings that show, by way of illustration, specific embodiments in which the invention may be practiced. In the drawings, like numerals describe substantially similar components throughout the several views. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. Other embodiments may be utilized and structural, logical, and electrical changes may be made without departing from the scope of the present invention. Moreover, it is to be understood that the various embodiments of the invention, although different, are not necessarily mutually exclusive. For example, a particular feature, structure, or characteristic described in one embodiment may be included within other embodiments. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims, along with the full scope of equivalents to which such claims are entitled.
[0015] FIG. 1 illustrates one embodiment of a virtual-machine environment 100, in which the present invention may operate. In this embodiment, bare platform hardware 116 comprises a computing platform, which may be capable, for example, of executing a standard operating system (OS) or a virtual-machine monitor (VMM), such as a VMM 112. The VMM 112, though typically implemented in software, may emulate and export a bare machine interface to higher level software. Such higher level software may comprise a standard or real-time OS, may be a highly stripped down operating environment with limited operating system functionality, may not include traditional OS facilities, etc. Alternatively, for example, the VMM 112 may be run within, or on top of, another VMM. VMMs and their typical features and functionality are well-known by those skilled in the art and may be implemented, for example, in software, firmware or by a combination of various techniques.
[0016] The platform hardware 116 includes a processor 118 and memory 120. Processor 118 can be any type of processor capable of executing software, such as a microprocessor, digital signal processor, microcontroller, or the like. The processor 118 may include microcode or hardcoded logic for performing the execution of method embodiments of the present invention.
[0017] The platform hardware 116 can be of a personal computer (PC), mainframe, handheld device, portable computer, set-top box, or any other computing system.
[0018] Memory 120 can be a hard disk, a floppy disk, random access memory (RAM), read only memory (ROM), flash memory, or any other type of machine medium readable by processor 118. Memory 120 may store instructions for performing the execution of method embodiments of the present invention.
[0019] The VMM 112 presents to other software (i.e., “guest” software) the abstraction of one or more virtual machines (VMs), which may provide the same or different abstractions to the various guests. FIG. 1 shows two VMs, 102 and 114. The guest software running on each VM may include a guest OS such as a guest OS 104 or 106 and various guest software applications 108–110. Each of the guest OSs 104 and 106 expects to control access to physical resources (e.g., processor registers, memory and memory-mapped I/O devices) within the VMs 102 and 114 on which the guest OS 104 or 106 is running and to perform other functions.
[0020] The VMM 112 facilitates functionality desired by guest software while retaining ultimate control over privileged hardware resources within the platform hardware 116. Specifically, once guest software attempts to access a privileged resource, the control over the processor is transferred to the VMM 112, which then decides whether to perform a requested operation (e.g., emulate it for the guest software, proxy the operation directly to the platform hardware 116, etc.) or deny access to the resource to facilitate security, reliability or other mechanisms. The act of facilitating the functionality for the guest software may include a wide variety of activities on the part of the VMM 112. The activities of the VMM 112 as well as its characteristics should not limit the scope of the present invention.
[0021] In one embodiment, the transfer of control from guest software to VMM is dictated by control bit settings in a virtual machine control structure (VMCS) 122. Settings in the VMCS 122 may prevent guest software from performing operations that may result in its access of certain privileged hardware resources. Different guest software may execute with different control bit settings in different VMCS memory images, though only one such VMCS is shown in FIG. 1 . The VMCS 122 resides in memory 120 and is maintained by the processor 118. It should be noted that any other data structure (e.g., an on-chip cache, a file, a lookup table, etc.) may be used to store the VMCS 122 or the fields associated with each designated hardware resource without loss of generality.
[0022] When guest software attempts to perform an operation which accesses protected resources, control is transferred to the VMM 112. The VMM 112 has access to all platform hardware 116. When such a transition occurs, the VMM 112 receives control over the operation initiated by guest software. The VMM 112 then may perform this operation or deny access as described above, and may transfer control back to guest software by executing a special instruction. The control of guest software through this mechanism is referred to herein as VMX operation and the transfer of control from the guest software to VMM is referred to herein as a VM exit.
[0023] In one embodiment, the execution of certain instructions, certain exceptions and interrupts and certain platform events may cause a VM exit. These potential causes of VM exits are referred to herein as virtualization events. For example, a VM exit may be generated when guest software attempts to perform an operation (e.g., an instruction) that may result in its access of certain privileged hardware resources (e.g., a control register or an IO port).
[0024] In an embodiment, when a VM exit occurs, components of the processor state used by guest software are saved, and components of the processor state required by the VMM 112 are loaded. This saving and loading of processor state may, depending on the processor ISA, have the effect of changing the active address space (e.g., in the IA-32 ISA, the active address space is determined by the values in the control registers, which may be saved and restored on VM exit). In one embodiment, the components of the processor state used by guest software are stored in a guest-state area of VMCS 122 and the components of the processor state required by the VMM 112 are stored in a monitor-state area of VMCS 122.
[0025] In one embodiment, when a transition from the VMM to guest software occurs, the processor state that was saved at the VM exit is restored and control is returned to the guest OS 104 or 106 or guest applications 108 or 110.
[0026] In an embodiment, when a VM exit occurs, control is passed to the VMM 112 at a specific entry point (e.g., an instruction pointer value) delineated in the VMCS 122. In another embodiment, control is passed to the VMM 112 after vectoring through a redirection structure (e.g., the interrupt-descriptor table in the IA-32 ISA). Alternatively, any other mechanism known in the art can be used to transfer control from the guest software to the VMM 112.
[0027] Because the number of hardware resource elements that need to be protected from accesses by guest software is large and such accesses may be frequent, there is a significant performance cost associated with this protection and virtualization. In addition, an operation initiated by guest software may involve access to a privileged resource, which may pose no problem to the security and proper operation of the VMs 102 and 114. For example, in the IA-32 ISA, control register 0 (CR0) includes a task-switch (TS) bit that is used to optimize context switching by avoiding saving and restoring floating-point state until the state is accessed. The update of the TS bit by the guest OS through the Clear Task-Switched Flag (CLTS) instruction is unlikely to pose a problem to system security and proper operation of the VMs 102 and 114. In contrast, the paging enable (PG) bit of CR0 configures the processor operating mode and as such must be controlled exclusively by the VMM 112. In some cases, the VMM 112 may not allow the guest software to disable paging and therefore must control attempts of the guest software to do so.
[0028] In one embodiment, a filtering mechanism is provided for reducing the number of VM exits caused by accesses of guest software to such hardware resources as registers (e.g., control registers, general purpose registers, model-specific registers, etc.) or memory-based resources (e.g., paging control fields in memory, etc.). It should be noted that while an exemplary embodiment of the present invention is described below with reference to a register, the teachings of the present invention may be applied to any other hardware resource without loss of generality.
[0029] The filtering mechanism functions using one or more fields associated with each designated hardware resource as will be described in greater detail below. In one embodiment, the fields associated with each designated hardware resource are contained in a VMCS 122.
[0030] FIG. 2 is a flow diagram of one embodiment of a process 200 for filtering accesses of guest software to a hardware resource such as a register. The process may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, microcode, etc.), software (such as run on a general purpose computer system or a dedicated machine), or a combination of both.
[0031] Referring to FIG. 2 , process 200 begins with processing logic receiving a command pertaining to one or more portions of a register from guest software (processing block 202). A register portion may be a particular single bit of the register or multiple (contiguous or non-contiguous) bits of the register. The command pertaining to the register portions may be a read command requesting to read data from the register portions or a write command requesting to write data to the register portions. The register may represent a control register (e.g., CR0 or CR4 in the IA-32 ISA), an integer register, or any other register or memory-based resource.
[0032] Next, processing logic reads corresponding indicators from a mask field (processing block 204). The mask field includes a set of indicators corresponding to portions of the register. For example, if the register is a 32-bit control register (e.g., CR0 or CR4 in the IA-32 ISA), the mask field may include 32 indicators, with each indicator corresponding to a particular bit of the control register. Alternatively, the mask field may have fewer indicators than the number of bits in the register because the register may have unused bits, some indicators in the mask field may correspond to two or more bits, or for any other reason. Each indicator in the mask field provides information on whether a portion is under guest control (i.e., the guest software is permitted to access the corresponding portion of the register) or under control of the VMM. In an embodiment of the invention, bits in the register that do not have a corresponding mask bit are assumed to be under guest control. In another embodiment of the invention, they are assumed to be under VMM control.
[0033] At decision box 206, processing logic determines whether guest software is permitted to access all of the requested register portions based on the corresponding indicators from the mask field. If the determination is positive, processing logic executes the command on the requested register portions (processing block 208). That is, processing logic reads data from, or writes data to, the requested register portions.
[0034] Otherwise, if the determination made at decision box 206, is negative, then in one embodiment, processing logic transfers control to the VMM (processing block 210).
[0035] In an alternative embodiment, an extra field is used to further reduce the number of situations in which control is transferred in to the VMM. The extra field is referred to herein as a shadow value field. Each portion of the shadow value field corresponds to a particular portion of the register and stores the value that guest software expects to see in this portion of the register. In an embodiment of the invention, the value of the shadow value field is maintained by the VMM and is stored in the VMCS. In one embodiment, only the register portions with the indicators in the mask field that indicate the inability of guest software to access these register portions have corresponding portions in the shadow value field. For example, in the IA-32 ISA, if guest software is not permitted to access bits 1 through 10 in CR0 as reflected by values of indicators in the mask field, the size of the shadow value field will be limited to 10 bits that correspond to bits 1 through 10 of CR0. In another embodiment, each register portion with an indicator (regardless of its value) in the mask field has a corresponding portion in the shadow value field.
[0036] FIG. 4 is a flow diagram of one embodiment of a process 400 for providing an additional filtering of guest software accesses to a hardware resource such as a register. In one embodiment, process 400 replaces block 210 in FIG. 2 . The process may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, microcode, etc.), software (such as run on a general purpose computer system or a dedicated machine), or a combination of both.
[0037] Referring to FIG. 4 , process 400 begins at processing block 402 with processing logic determining that one or more register portions being accessed are under control of the VMM based on corresponding one or more indicators in a mask field, as discussed above in conjunction with FIG. 2 .
[0038] Next, at decision box 403, processing logic determines whether the access is a command to write data to the requested register portions. If the determination is positive, i.e., the access is a write command, processing logic determines whether the data that the guest wishes to write to each of the portions is equal to data stored in corresponding portions of a read shadow field for all portions under VMM control (decision box 404). If this determination is positive for all requested portions that are under VMM control, the guest is allowed to write data to all portions of the actual register resource that are under guest control (as determined by the corresponding bits in the mask field) (processing block 405) and then process 400 ends. If the determination is negative for any requested portions that are under VMM control, processing logic transfers control to the VMM (processing block 406). The VMM then updates the corresponding portion of the shadow value field and actual register resource as necessary according to its implementation requirements and transfers control back to guest software.
[0039] Alternatively, if the command initiated by guest software is a command to read data from the requested register portions, control is not transferred to the VMM. Specifically, processing logic accesses the corresponding portions of the shadow value field for all requested portions that are under VMM control (processing block 412) and returns data stored in these portions of the shadow value field combined with values from the actual register resource for portions of the resource that are under guest control to guest software (processing block 414).
[0040] One embodiment in which the transfer of control to the VMM is supported via VMX operation discussed in greater detail above with reference to FIG. 1 will now be described in more detail.
[0041] In one embodiment, the VMM maintains a set of control bits to configure which virtualization events will cause a VM exit. This set of control bits is referred to herein as a redirection map. In one embodiment, the redirection map is contained in the VMCS 122 of FIG. 1 . Once an occurrence of a virtualization event is detected, the redirection map is consulted to find an unconditional exit bit associated with this virtualization event. The bit indicates whether this virtualization event will unconditionally result in a VM exit. For example, the redirection map may include two bits for each control register, with one bit controlling VM exits on guest requests to read data from the control register and the other bit controlling VM exits on guest requests to write data to the control register.
[0042] In addition, in one embodiment, for each designated resource (e.g., CR0 or CR4 in the IA-32 ISA), the redirection map includes a bit indicating whether a mask field will be used for this resource and a bit indicating whether a shadow value field will be used for this resource.
[0043] FIG. 5 is flow diagram of one embodiment of a process 500 for controlling access to a hardware resource such as a register during VMX operation using a redirection map. The process may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, microcode, etc.), software (such as run on a general purpose computer system or a dedicated machine), or a combination of both.
[0044] Referring to FIG. 5 , process 500 begins at processing block 502 with processing logic identifying an occurrence of a virtualization event caused by a request of guest software to access a portion of a hardware resource such as a control register. This request is either a command to read data from one or more portions of a particular register or a command to write data to one or more portions of a particular register.
[0045] At processing block 503, processing logic consults the redirection map to determine if the unconditional exit bit associated with this virtualization event is set (decision box 506). If this bit is set, processing logic triggers a VM exit (processing block 522). For example, in the IA-32 ISA the redirection map may include bits to unconditionally cause VM exits on writes to CR2, reads from CR0, writes to CR4, etc.
[0046] Alternatively, if the unconditional exit bit is not set, processing logic further determines whether a mask field is to be used for the register (decision box 508). This determination is made using a designated bit in the redirection map. For example, in the IA-32 ISA there may be bits in the redirection map indicating if a mask is used for CR0, if a mask is used for CR4, etc. If the mask field is not to be used for this register, processing logic executes the requested read or write command on the requested register portions (processing block 514). Otherwise, processing logic reads mask field bits corresponding to the requested register portions (processing block 510). These bits are referred to as the requested mask field bits. The requested mask field bits are examined to determine if one or more of them are set (indicating that one or more of the corresponding register portions are under VMM control) (decision box 512).
[0047] If none of the requested mask field bits are set, i.e., guest software is allowed to access all of the requested register portions, processing logic executes the requested read or write command on the register portions (processing block 514). Otherwise, if any bits in the requested mask field are set, processing logic determines whether a shadow value field will be used for the register based on a designated bit in the redirection map (decision box 516). For example, in the IA-32 ISA there may be bits in the redirection map to indicate if a shadow value is used for CR0 accesses, for CR4 accesses, etc. If the shadow value field is not to be used for the register, processing logic triggers a VM exit (processing box 522).
[0048] If the shadow value field is to be used for the register and the request initiated by guest software is a read command (decision box 517), processing logic reads the bits of the shadow value field that correspond to those register portions that are set in the requested mask field and hence are under VMM control (processing block 518). These bits from the shadow value field are combined with the bits from the actual register that correspond to bits in the requested mask field that are not set and hence are under guest control. These combined values are then returned to guest software. Values of bits in the protected resource which are not represented in the mask and/or shadow value field may be read from the register.
[0049] If the shadow value field is to be used for the register but the request initiated by guest software is a write command, processing logic compares the value requested to be written to register bits under VMM control with the value of corresponding bits in the shadow value field (decision box 520). If these two values are the same, the requested register portions that are under guest control are written (processing block 519). That is, the bits under guest control are written; those under VMM control remain unchanged. In one embodiment, bits in the register which are not represented in the mask and/or shadow value field may be written if they are assumed to be under guest control. In another embodiment, data is not written to the unrepresented bits because they are assumed to be under VMM control. Otherwise, if the two values compared at decision box 520 are different, processing logic triggers a VM exit (processing block 522).
[0050] In one embodiment, a set of criteria is predefined by the VMM for filtering VM exits. The criteria are based on combinations of values stored in a mask field and a shadow value field and a value that guest software wishes to write to the register. FIG. 3 is a flow diagram of one embodiment of a process 300 for filtering VM exits using a set of criteria. The process may be performed by processing logic that may comprise hardware (e.g., circuitry, dedicated logic, microcode, etc.), software (such as run on a general purpose computer system or a dedicated machine), or a combination of both.
[0051] Referring to FIG. 3 , process 300 begins with processing logic determining whether the access of guest software is a request to write data to a register (decision box 302). If the determination is negative, i.e., the access is a request to read data from the register, the resulting value of the read request is determined using the following expression:
DEST=(MF AND SVF) OR (NOT MF AND CRVAL),
where AND, NOT and OR are bitwise Boolean operators, MF is a value of the mask field, SVF is a value of the shadow value field, and CRVAL is the current value of the actual protected register. A bit in the mask field is set if a corresponding bit in the register is controlled by the VMM. Otherwise, if a bit in the register is controlled by guest software, then a corresponding bit in the mask field is equal to zero. A bit in the shadow field has the value that guest software expects to see in the corresponding bit of the register and may be different from the current value of the corresponding bit of the actual register.
DEST=(MF AND SVF) OR (NOT MF AND CRVAL),
where AND, NOT and OR are bitwise Boolean operators, MF is a value of the mask field, SVF is a value of the shadow value field, and CRVAL is the current value of the actual protected register. A bit in the mask field is set if a corresponding bit in the register is controlled by the VMM. Otherwise, if a bit in the register is controlled by guest software, then a corresponding bit in the mask field is equal to zero. A bit in the shadow field has the value that guest software expects to see in the corresponding bit of the register and may be different from the current value of the corresponding bit of the actual register.
[0052] According to the above expression, if the requested bit is controlled by guest software, the data is read from the register, and if the requested bit is controlled by the VMM, the data is read from the shadow value field.
[0053] If processing logic determines at decision box 302 that the access of guest software is a write request, processing logic combines the values of the mask field and shadow value field (processing block 304) as follows:
INT1=MF AND SVF.
INT1=MF AND SVF.
[0054] In addition, processing logic combines the value of the mask field with the value that guest software wishes to write to the register (processing block 306) using the following expression:
INT2=MF AND SRC,
where SRC is the value that the guest wishes to write to the register.
INT2=MF AND SRC,
where SRC is the value that the guest wishes to write to the register.
[0055] Further, processing logic compares the two combinations at decision box 308. If the two combinations are equal, i.e., all bits in the register are either controlled by guest software, or controlled by the VMM and the value of the corresponding bit in shadow value field is equal to the value that guest software wishes to write to the register, then processing logic executes the following expression at processing block 312:
CR=(MF AND CRVAL) OR (NOT MF AND SRC).
CR=(MF AND CRVAL) OR (NOT MF AND SRC).
[0056] According to this expression, if a bit in the register is controlled by guest software, the bit will be updated with the value that guest software wishes to write. Otherwise, the value of the bit in the register will remain the same and will not be updated.
[0057] Alternatively, if the two combinations are not equal, i.e., at least one bit in the register is controlled by the VMM and the value of the corresponding bit in shadow value field is not equal to the value that guest software wishes to write to the register, then processing logic triggers a VM exit at processing block 310.
[0058] Note that the description of the process 300 is simplified by using the entire register (e.g., 32 bits for the CR0 register in the IA-32 ISA) and mask and shadow value fields that are 32 bits wide. A person of ordinary skill in the art will understand that embodiments of the present invention can apply to read and write operations that access only a limited subset of the register bits or that access bits in multiple registers. Additionally, those skilled in the art will see application of the invention to situations where there is not a bit-for-bit correspondence between the various elements involved (e.g. if bits in the mask apply to multiple bits in the protected resource).
[0059] Thus, a method and apparatus for controlling access of guest software to hardware resources have been described. It is to be understood that the above description is intended to be illustrative, and not restrictive. Many other embodiments will be apparent to those of skill in the art upon reading and understanding the above description. The scope of the invention should, therefore, be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.
Claims
What is claimed is:
1. A method comprising:
receiving a command pertaining to one or more portions of a register from a virtual machine (VM);
determining whether the VM has access to the one or more portions of the register based on one or more indicators within a mask field that correspond to the one or more portions of the register, the one or more indicators indicating whether the one or more portions of the register are under control of the VM or a virtual machine monitor (VMM);
executing the command on the one or more portions of the register if the VM has access to each of the one or more portions of the register; and
transferring control to the VMM upon determining that the VM does not have access to at least one of the one or more portions of the register based on the corresponding indicators within the mask field.
2. The method of claim 1 wherein the mask field includes a set of indicators, each indicator within the set of indicators corresponding to a particular portion of the register and indicating whether the particular portion of the register is allowed to be accessed by the VM.
3. The method of claim 1 wherein each of the one or more portions of the register represent a particular bit of the register.
4. The method of claim 1 wherein the register is a control register.
5. The method of claim 1 wherein the command pertaining to the one or more portions of the register is a command to write data to the one or more portions of the register.
6. The method of claim 5 wherein executing the command on the one or more portions of the register includes writing the data to the one or more portions of the register.
7. The method of claim 5 further comprising:
detecting that data requested to be written to said at least one of the one or more portions of the register differs from a value expected by the VM to be stored in said at least one of the one or more portions of the register.
8. The method of claim 7 wherein detecting that the data differs from the value expected to be stored in the one or more portions of the register includes comparing the data with a value of one or more corresponding portions of a shadow value field.
10. The method of claim 5 further comprising:
determining, based on the corresponding indicators within the mask field, that the one or more portions of the register includes at least one register portion accessible to the VM and at least one register portion inaccessible to the VM;
detecting that write data associated with said at least one register portion inaccessible to the VM is the same as a value expected by the VM to be stored in said at least one register portion inaccessible to the VM; and
writing, to said at least one register portion accessible to the VM, write data associated with said at least one register portion accessible to the VM.
11. The method of claim 1 wherein the command pertaining to the portion of the register is a command to read data from the one or more portions of the register.
12. The method of claim 11 wherein executing the command on the one or more portions of the register includes reading the data from the one or more portions of the register.
13. The method of claim 11 further comprising:
determining that the VM does not have access to at least one of the one or more portions of the register based on one or more corresponding indicators within the mask field;
accessing any of the one or more portions of the register that are permitted to be accessed by the VM;
accessing one or more portions of a shadow value field that correspond to said at least one of the one or more portions of the register;
combining data stored in the one or more corresponding portions of the shadow value field with data stored in said any of the one or more portions of the register that are permitted to be accessed by the VM; and
returning the combined data to the VM.
14. A system comprising:
a memory including a mask field; and
a processor, coupled to the memory, to receive a command pertaining to one or more portions of a register from a virtual machine (VM), to determine whether the VM has access to the one or more portions of the register based on one or more indicators within the mask field that correspond to the one or more portions of the register, the one or more indicators indicating whether the one or more portions of the register are under control of the VM or a virtual machine monitor (VMM), to execute the command on the one or more portions of the register if the VM has access to each of the one or more portions of the register, and to transfer control to the VMM upon determining that the VM does not have access to at least one of the one or more portions of the register based on the corresponding indicators within the mask field.
15. The system of claim 14 wherein the mask field includes a set of indicators, each indicator within the set of indicators corresponding to a particular portion of the register and indicating whether the particular portion of the register is allowed to be accessed by the VM.
16. The system of claim 14 wherein each of the one or more portions of the register represent a particular bit of the register.
17. The system of claim 14 wherein the register is a control register.
18. The system of claim 14 wherein the command pertaining to the one or more portions of the register is a command to write data to the one or more portions of the register.
19. The system of claim 18 wherein executing the command on the one or more portions of the register includes writing the data to the one or more portions of the register.
20. The system of claim 18 wherein the processor is further to detect that data requested to be written to said at least one of the one or more portions of the register differs from a value expected by the VM to be stored in said at least one of the one or more portions of the register.
21. The system of claim 18 wherein the processor is further to determine, based on the corresponding indicators within the mask field, that the one or more portions of the register include at least one register portion accessible to the VM and at least one register portion inaccessible to the VM, to detect that write data associated with said at least one register portion inaccessible to the VM is the same as a value expected by the VM to be stored in said at least one register portion inaccessible to the VM, and to write, to said at least one register portion accessible to the VM, write data associated with said at least one register portion accessible to the VM.
22. The system of claim 20 wherein the processor is to detect that the data differs from the value expected to be stored in the one or more portions of the register by comparing the data with a value of one or more corresponding portions of a shadow value field.
23. The system of claim 18 wherein the processor is further to update the shadow value field with the data.
24. The system of claim 18 wherein the command pertaining to the portion of the register is a command to read data from the one or more portions of the register.
25. The system of claim 24 wherein executing the command on the one or more portions of the register includes reading the data from the one or more portions of the register.
26. The system of claim 24 wherein the processor is further to determine that the VM does not have access to at least one of the one or more portions of the register based on one or more corresponding indicators within the mask field, to access any of the one or more portions of the register that are permitted to be accessed by the VM, to access one or more portions of a shadow value field that correspond to said at least one of the one or more portions of the register, to combine data stored in the one or more corresponding portions of the shadow value field with data stored in said any of the one or more portions of the register that are permitted to be accessed by the VM, and to return the combined data to the VM.
27. A machine-readable medium containing instructions which, when executed by a processing system, cause the processing system to perform a method, the method comprising:
receiving a command pertaining to one or more portions of a register from a virtual machine (VM);
determining whether the VM has access to the one or more portions of the register based on one or more indicators within a mask field that correspond to the one or more portions of the register, the one or more indicators indicating whether the one or more portions of the register are under control of the VM or a virtual machine monitor (VMM);
executing the command on the portion of the register if the VM has access to each of the one or more portions of the register; and
transferring control to the VMM upon determining that the VM does not have access to at least one of the one or more portions of the register based on the corresponding indicators within the mask field.
28. The computer readable medium of claim 27 wherein the mask field includes a set of indicators, each indicator within the set of indicators corresponding to a particular portion of the register and indicating whether the particular portion of the register is allowed to be accessed by the VM.
29. The computer readable medium of claim 27 wherein each of the one or more portions of the register represents a particular bit of the register.
30. The computer readable medium of claim 27 wherein the register is a control register.
Patent Citations (245)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3699532(A) | 1972-10-01 | Schaffer et al. | Applicant |
| US3996449(A) | 1976-12-01 | Attanasio et al. | Applicant |
| US4037214(A) | 1977-07-01 | Birney et al. | Applicant |
| US4162536(A) | 1979-07-01 | Morley | Applicant |
| US4207609(A) | 1980-06-01 | Luiz et al. | Applicant |
| US4247905(A) | 1981-01-01 | Yoshida et al. | Applicant |
| US4276594(A) | 1981-06-01 | Morley | Applicant |
| US4278837(A) | 1981-07-01 | Best | Applicant |
| US4307447(A) | 1981-12-01 | Provanzano et al. | Applicant |
| US4319233(A) | 1982-03-01 | Matsuoka et al. | Applicant |
| US4319323(A) | 1982-03-01 | Ermolovich et al. | Applicant |
| US4347565(A) | 1982-08-01 | Kaneda et al. | Applicant |
| US4366537(A) | 1982-12-01 | Heller et al. | Applicant |
| US4403283(A) | 1983-09-01 | Myntti et al. | Applicant |
| US4419724(A) | 1983-12-01 | Branigin et al. | Applicant |
| US4430709(A) | 1984-02-01 | Schleupen | Applicant |
| US4521852(A) | 1985-06-01 | Guttag | Applicant |
| US4571672(A) | 1986-02-01 | Hatada et al. | Applicant |
| US4621318(A) | 1986-11-01 | Maeda | Applicant |
| US4759064(A) | 1988-07-01 | Chaum | Applicant |
| US4795893(A) | 1989-01-01 | Ugon | Applicant |
| US4802084(A) | 1989-01-01 | Ikegaya et al. | Examiner |
| US4825052(A) | 1989-04-01 | Chemin et al. | Applicant |
| US4835677(A) | 1989-05-01 | Sato et al. | Applicant |
| US4907270(A) | 1990-03-01 | Hazard | Applicant |
| US4907272(A) | 1990-03-01 | Hazard | Applicant |
| US4910774(A) | 1990-03-01 | Barakat | Applicant |
| US4975836(A) | 1990-12-01 | Hirosawa et al. | Examiner |
| US5007082(A) | 1991-04-01 | Cummins | Applicant |
| US5022077(A) | 1991-06-01 | Bealkowski et al. | Applicant |
| US5075842(A) | 1991-12-01 | Lai | Applicant |
| US5079737(A) | 1992-01-01 | Hackbarth | Applicant |
| US5187802(A) | 1993-02-01 | Inoue et al. | Examiner |
| US5230069(A) | 1993-07-01 | Brelsford et al. | Examiner |
| US5237616(A) | 1993-08-01 | Abraham et al. | Applicant |
| US5255379(A) | 1993-10-01 | Melo | Applicant |
| US5287363(A) | 1994-02-01 | Wolf et al. | Applicant |
| US5293424(A) | 1994-03-01 | Holtey et al. | Applicant |
| US5295251(A) | 1994-03-01 | Wakui et al. | Examiner |
| US5317705(A) | 1994-05-01 | Gannon et al. | Applicant |
| US5319760(A) | 1994-06-01 | Mason et al. | Applicant |
| US5339417(A) | 1994-08-01 | Connell et al. | Applicant |
| US5361375(A) | 1994-11-01 | Ogi | Examiner |
| US5386552(A) | 1995-01-01 | Garney | Applicant |
| US5421006(A) | 1995-05-01 | Jablon et al. | Applicant |
| US5434999(A) | 1995-07-01 | Goire et al. | Applicant |
| US5437033(A) | 1995-07-01 | Inoue et al. | Applicant |
| US5442645(A) | 1995-08-01 | Ugon et al. | Applicant |
| US5455909(A) | 1995-10-01 | Blomgren et al. | Applicant |
| US5459867(A) | 1995-10-01 | Adams et al. | Applicant |
| US5459869(A) | 1995-10-01 | Spilo | Applicant |
| US5469557(A) | 1995-11-01 | Salt et al. | Applicant |
| US5473692(A) | 1995-12-01 | Davis | Applicant |
| US5479509(A) | 1995-12-01 | Ugon | Applicant |
| US5504922(A) | 1996-04-01 | Seki et al. | Applicant |
| US5506975(A) | 1996-04-01 | Onodera | Examiner |
| US5511217(A) | 1996-04-01 | Nakajima et al. | Applicant |
| US5522075(A) | 1996-05-01 | Robinson et al. | Applicant |
| US5528231(A) | 1996-06-01 | Patarin | Applicant |
| US5533126(A) | 1996-07-01 | Hazard | Applicant |
| US5555385(A) | 1996-09-01 | Osisek | Examiner |
| US5555414(A) | 1996-09-01 | Hough et al. | Examiner |
| US5560013(A) | 1996-09-01 | Scalzi et al. | Applicant |
| US5564040(A) | 1996-10-01 | Kubala | Applicant |
| US5566323(A) | 1996-10-01 | Ugon | Applicant |
| US5568552(A) | 1996-10-01 | Davis | Applicant |
| US5574936(A) | 1996-11-01 | Ryba et al. | Examiner |
| US5582717(A) | 1996-12-01 | Di Santo | Applicant |
| US5604805(A) | 1997-02-01 | Brands | Applicant |
| US5606617(A) | 1997-02-01 | Brands | Applicant |
| US5615263(A) | 1997-03-01 | Takahashi | Applicant |
| US5628022(A) | 1997-05-01 | Ueno et al. | Applicant |
| US5633929(A) | 1997-05-01 | Kaliski, Jr. | Applicant |
| US5657445(A) | 1997-08-01 | Pearce | Applicant |
| US5668971(A) | 1997-09-01 | Neufeld | Applicant |
| US5684948(A) | 1997-11-01 | Johnson et al. | Applicant |
| US5706469(A) | 1998-01-01 | Kobayashi | Applicant |
| US5717903(A) | 1998-02-01 | Bonola | Applicant |
| US5720609(A) | 1998-02-01 | Pfefferle | Applicant |
| US5721222(A) | 1998-02-01 | Bernstein et al. | Applicant |
| US5729760(A) | 1998-03-01 | Poisner | Applicant |
| US5737604(A) | 1998-04-01 | Miller et al. | Applicant |
| US5737760(A) | 1998-04-01 | Grimmer, Jr. et al. | Applicant |
| US5740178(A) | 1998-04-01 | Jacks et al. | Applicant |
| US5752046(A) | 1998-05-01 | Oprescu et al. | Applicant |
| US5757919(A) | 1998-05-01 | Herbert et al. | Applicant |
| US5764969(A) | 1998-06-01 | Kahle et al. | Applicant |
| US5796835(A) | 1998-08-01 | Saada | Applicant |
| US5796845(A) | 1998-08-01 | Serikawa et al. | Applicant |
| US5805712(A) | 1998-09-01 | Davis | Applicant |
| US5809546(A) | 1998-09-01 | Greenstein et al. | Applicant |
| US5825875(A) | 1998-10-01 | Ugon | Applicant |
| US5825880(A) | 1998-10-01 | Sudia et al. | Applicant |
| US5835594(A) | 1998-11-01 | Albrecht et al. | Applicant |
| US5844986(A) | 1998-12-01 | Davis | Applicant |
| US5852717(A) | 1998-12-01 | Bhide et al. | Applicant |
| US5854913(A) | 1998-12-01 | Goetz et al. | Applicant |
| US5867577(A) | 1999-02-01 | Patarin | Applicant |
| US5872994(A) | 1999-02-01 | Akiyama et al. | Applicant |
| US5890189(A) | 1999-03-01 | Nozue et al. | Applicant |
| US5900606(A) | 1999-05-01 | Rigal | Applicant |
| US5901225(A) | 1999-05-01 | Ireton et al. | Applicant |
| US5903752(A) | 1999-05-01 | Dingwall et al. | Applicant |
| US5919257(A) | 1999-07-01 | Trostle | Applicant |
| US5935242(A) | 1999-08-01 | Madany et al. | Applicant |
| US5935247(A) | 1999-08-01 | Pai et al. | Applicant |
| US5937063(A) | 1999-08-01 | Davis | Applicant |
| US5944821(A) | 1999-08-01 | Angelo | Applicant |
| US5953502(A) | 1999-09-01 | Helbig, Sr. | Applicant |
| US5956408(A) | 1999-09-01 | Arnold | Applicant |
| US5970147(A) | 1999-10-01 | Davis et al. | Applicant |
| US5978475(A) | 1999-11-01 | Schneier et al. | Applicant |
| US5978481(A) | 1999-11-01 | Ganesan et al. | Applicant |
| US5987557(A) | 1999-11-01 | Ebrahim | Applicant |
| US6014745(A) | 2000-01-01 | Ashe | Applicant |
| US6035374(A) | 2000-03-01 | Panwar et al. | Applicant |
| US6044478(A) | 2000-03-01 | Green | Applicant |
| US6055637(A) | 2000-04-01 | Hudson et al. | Applicant |
| US6058478(A) | 2000-05-01 | Davis | Applicant |
| US6061794(A) | 2000-05-01 | Angelo | Applicant |
| US6075938(A) | 2000-06-01 | Bugnion et al. | Applicant |
| US6085296(A) | 2000-07-01 | Karkhanis et al. | Applicant |
| US6088262(A) | 2000-07-01 | Nasu | Applicant |
| US6092095(A) | 2000-07-01 | Maytal | Applicant |
| US6093213(A) | 2000-07-01 | Favor et al. | Applicant |
| US6101584(A) | 2000-08-01 | Satou et al. | Applicant |
| US6108644(A) | 2000-08-01 | Goldschlag et al. | Applicant |
| US6115816(A) | 2000-09-01 | Davis | Applicant |
| US6125430(A) | 2000-09-01 | Noel et al. | Applicant |
| US6131166(A) | 2000-10-01 | Wong-Insley | Applicant |
| US6148379(A) | 2000-11-01 | Schimmel | Applicant |
| US6158546(A) | 2000-12-01 | Hanson et al. | Applicant |
| US6173417(B1) | 2001-01-01 | Merrill | Applicant |
| US6175924(B1) | 2001-01-01 | Arnold | Applicant |
| US6175925(B1) | 2001-01-01 | Nardone et al. | Applicant |
| US6178509(B1) | 2001-01-01 | Nardone et al. | Applicant |
| US6182089(B1) | 2001-01-01 | Ganapathy et al. | Applicant |
| US6188257(B1) | 2001-02-01 | Buer | Applicant |
| US6192455(B1) | 2001-02-01 | Bogin et al. | Applicant |
| US6199152(B1) | 2001-03-01 | Kelly et al. | Applicant |
| US6205550(B1) | 2001-03-01 | Nardone et al. | Applicant |
| US6212635(B1) | 2001-04-01 | Reardon | Applicant |
| US6222923(B1) | 2001-04-01 | Schwenk | Applicant |
| US6249872(B1) | 2001-06-01 | Wildgrube et al. | Applicant |
| US6252650(B1) | 2001-06-01 | Nakamura | Applicant |
| US6269392(B1) | 2001-07-01 | Cotichini et al. | Applicant |
| US6272533(B1) | 2001-08-01 | Browne et al. | Applicant |
| US6272637(B1) | 2001-08-01 | Little et al. | Applicant |
| US6275933(B1) | 2001-08-01 | Fine et al. | Applicant |
| US6282650(B1) | 2001-08-01 | Davis | Applicant |
| US6282651(B1) | 2001-08-01 | Ashe | Applicant |
| US6282657(B1) | 2001-08-01 | Kaplan et al. | Applicant |
| US6292874(B1) | 2001-09-01 | Barnett | Applicant |
| US6301646(B1) | 2001-10-01 | Hostetter | Applicant |
| US6308270(B1) | 2001-10-01 | Guthery et al. | Applicant |
| US6314409(B1) | 2001-11-01 | Schneck et al. | Applicant |
| US6321314(B1) | 2001-11-01 | Van Dyke | Applicant |
| US6327652(B1) | 2001-12-01 | England et al. | Applicant |
| US6330670(B1) | 2001-12-01 | England et al. | Applicant |
| US6339815(B1) | 2002-01-01 | Feng | Applicant |
| US6339816(B1) | 2002-01-01 | Bausch | Examiner |
| US6357004(B1) | 2002-03-01 | Davis | Applicant |
| US6363485(B1) | 2002-03-01 | Adams | Applicant |
| US6374286(B1) | 2002-04-01 | Gee et al. | Applicant |
| US6374317(B1) | 2002-04-01 | Ajanovic et al. | Applicant |
| US6378068(B1) | 2002-04-01 | Foster | Applicant |
| US6378072(B1) | 2002-04-01 | Collins et al. | Applicant |
| US6389537(B1) | 2002-05-01 | Davis et al. | Applicant |
| US6397242(B1) | 2002-05-01 | Devine et al. | Applicant |
| US6397379(B1) | 2002-05-01 | Yates, Jr. et al. | Applicant |
| US6412035(B1) | 2002-06-01 | Webber | Applicant |
| US6421702(B1) | 2002-07-01 | Gulick | Applicant |
| US6435416(B1) | 2002-08-01 | Slassi | Applicant |
| US6445797(B1) | 2002-09-01 | McGough et al. | Applicant |
| US6463535(B1) | 2002-10-01 | Drews et al. | Applicant |
| US6463537(B1) | 2002-10-01 | Tello | Applicant |
| US6499123(B1) | 2002-12-01 | McFarlane et al. | Applicant |
| US6505279(B1) | 2003-01-01 | Phillips et al. | Applicant |
| US6507904(B1) | 2003-01-01 | Ellison et al. | Applicant |
| US6529909(B1) | 2003-03-01 | Bowman-Amuah | Applicant |
| US6535988(B1) | 2003-03-01 | Poisner | Applicant |
| US6557104(B1) | 2003-04-01 | Vu et al. | Applicant |
| US6560627(B1) | 2003-05-01 | McDonald et al. | Applicant |
| US6609199(B1) | 2003-08-01 | DeTreville | Applicant |
| US6615278(B1) | 2003-09-01 | Curtis | Applicant |
| US6633963(B1) | 2003-10-01 | Ellison et al. | Applicant |
| US6633981(B1) | 2003-10-01 | Davis | Applicant |
| US6651171(B1) | 2003-11-01 | England et al. | Applicant |
| US6678825(B1) | 2004-01-01 | Ellison et al. | Applicant |
| US6684326(B1) | 2004-01-01 | Cromer et al. | Applicant |
| US2001/0021969(A1) | 2001-09-01 | Burger et al. | Applicant |
| US2001/0027511(A1) | 2001-10-01 | Wakabayashi et al. | Applicant |
| US2001/0027527(A1) | 2001-10-01 | Khidekel et al. | Applicant |
| US2001/0037450(A1) | 2001-11-01 | Metlitski et al. | Applicant |
| US2002/0007456(A1) | 2002-01-01 | Peinado et al. | Applicant |
| US2002/0023032(A1) | 2002-02-01 | Pearson et al. | Applicant |
| US2002/0147916(A1) | 2002-10-01 | Strongin et al. | Applicant |
| US2002/0166061(A1) | 2002-11-01 | Falik et al. | Applicant |
| US2002/0169717(A1) | 2002-11-01 | Challener | Applicant |
| US2003/0018892(A1) | 2003-01-01 | Birney et al. | Applicant |
| US2003/0074548(A1) | 2003-04-01 | Cromer et al. | Applicant |
| US2003/0115453(A1) | 2003-06-01 | Grawrock | Applicant |
| US2003/0126442(A1) | 2003-07-01 | Glew et al. | Applicant |
| US2003/0126453(A1) | 2003-07-01 | Glew et al. | Applicant |
| US2003/0159056(A1) | 2003-08-01 | Cromer et al. | Applicant |
| US2003/0188179(A1) | 2003-10-01 | Challener et al. | Applicant |
| US2003/0196085(A1) | 2003-10-01 | Lampson et al. | Applicant |
| US2004/0117539(A1) | 2004-06-01 | Bennett et al. | Applicant |
| EP600112(A1) | 1994-06-01 | Applicant | |
| EP602867 | 1994-06-01 | Applicant | |
| EP892521 | 1999-01-01 | Applicant | |
| EP930567(A3) | 1999-07-01 | Applicant | |
| EP961193 | 1999-12-01 | Applicant | |
| EP965902 | 1999-12-01 | Applicant | |
| EP1030237 | 2000-08-01 | Applicant | |
| EP1055989 | 2000-11-01 | Applicant | |
| EP1056014 | 2000-11-01 | Applicant | |
| EP1085396 | 2001-03-01 | Applicant | |
| EP1146715(A1) | 2001-10-01 | Applicant | |
| EP1209563 | 2002-05-01 | Applicant | |
| EP1271277 | 2003-01-01 | Applicant | |
| JP2000076139 | 2000-03-01 | Applicant | |
| WO9524696 | 1995-09-01 | Applicant | |
| WO-9729567 | 1997-08-01 | Applicant | |
| WO9812620 | 1998-03-01 | Applicant | |
| WO98/34365 | 1998-08-01 | Applicant | |
| WO98/44402 | 1998-10-01 | Applicant | |
| WO99/05600 | 1999-02-01 | Applicant | |
| WO99/09482 | 1999-02-01 | Applicant | |
| WO9918511 | 1999-04-01 | Applicant | |
| WO99/57863 | 1999-11-01 | Applicant | |
| WO9965579 | 1999-12-01 | Applicant | |
| WO21238 | 2000-04-01 | Applicant | |
| WO/62232 | 2000-10-01 | Applicant | |
| WO-0127723 | 2001-04-01 | Applicant | |
| WO-0127821 | 2001-04-01 | Applicant | |
| WO163994 | 2001-08-01 | Applicant | |
| WO-0175565 | 2001-10-01 | Applicant | |
| WO-0175595 | 2001-10-01 | Applicant | |
| WO201794 | 2002-01-01 | Applicant | |
| WO-0217555 | 2002-02-01 | Applicant | |
| WO2060121 | 2002-08-01 | Applicant | |
| WO-02086684 | 2002-10-01 | Applicant | |
| WO-0175564 | 2002-11-01 | Applicant | |
| WO3058412 | 2003-07-01 | Applicant |
Non-Patent Literature (45)
- Berg, Cliff, “How Do I Create A Signed Applet?” Dr. Dobb's Journal, Aug. 1997, pp. 1-9.Applicant
- Goldberg, Robert P., “Survey of Virtual Machine Research,” IEEE Computer Magazine vol. 7, No. 6, pp. 34-45, 1974.Applicant
- Gong, Li, et al., “Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2,” JavaSoft, Sun Microsystems, Inc., Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, 11 pages Dec. 1997.Applicant
- Gum, P.H., “System/370 Extended Architecture: Facilities for Virtual Machines,” IBM J. Research Development, vol. 27, No. 6, pp. 530-544, Nov. 1983.Applicant
- Heinrich, J., “MIPS R4000 Microprocessor User's Manual,” Chapter 4, Memory Management, pp. 61-97, 1993.Applicant
- Heinrich, J., “MIPS R4000 Microprocessor User's Manual,” Second Edition, Chapter 4: Memory Management, pp. 67-79, 1994.Applicant
- Intel Corporation, Intel386™ DX Microprocessor, 32-Bit CHMOS Microprocessor With Integrated Memory Management, 56 pages, Dec. 1995.Applicant
- Lawton, K., “Running Multiple Operation Systems Concurrently On An IA32 PC Using Virtualization Techniques,” http://www.plex86.org/research/paper.txt., pp. 1-31, downloaded Aug. 9, 2001.Applicant
- MOTOROLA, M68040 User's Manual (Including the MC68040, MC68040V, MC68LC040, MC68EC040, and MC68EC040V), Revised 1993.Applicant
- Rosenblum, M., “VMware's Virtual Platform™ A Virtual Machine Monitor for Commodity PCs,” Proceedings of the 11th Hotchips Conference, Stanford University Palo Alto, California, pp. 185-196, Aug. 1999.Applicant
- Trusted Computing Platform Alliance (TCPA), Main Specification Version 1.1a, 321 pages, Copyright 2000-2001.Applicant
- Brands, Stefan, “Restrictive Blinding of Secret-Key Certificates”, SPRINGER-VERLAG XP002201306, (1995),Chapter 3.Applicant
- Chien, Andrew A., et al., “Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor”, 7th Annual IEEE Symposium, FCCM '99 Proceedings, XP010359180, ISBN 0-7695-0375-6, Los Alamitos, CA, (Apr. 21, 1999),209-221.Applicant
- Davida, George I., et al., “Defending Systems Against Viruses through Cryptographic Authentication”, Proceedings of the Symposium on Security and Privacy, IEEE Comp. Soc. Press, ISBN 0-8186-1939-2,(May 1989).Applicant
- IBM, “Information Display Technique for a Terminate Stay Resident Program IBM Technical Disclosure Bulletin”, TDB-ACC-NO. NA9112156, vol. 34, Issue 7A, (Dec. 1, 1991), 156-158.Applicant
- INTEL, “IA-32 Intel Architecture Software Developer's Manual”, vol. 3: System Programming Guide, Intel Corporation—2003, 13-1 through 13-24.Applicant
- Karger, Paul A., et al., “a VMM Security Kernal for the VAX Architecture”, Proceedings of the Symposium on Research in Security and Privacy, XP010020182, ISBN 0-8186-2060-9, Boxborough, MA, (May 7, 1990),2-19.Applicant
- Kashiwagi, Kazuhiko; et al., “Design and Implementation of Dynamically Reconstructing System Software”, Software Engineering Conference, Proceedings 1996 Asia-Pacific Seoul, South Korea Dec. 4-7, 1996, Los Alamitos, CA USA, IEEE Comput. Soc, US, ISBN 0-8186-7638-8,(1996).Applicant
- Luke, Jahn , et al., “Replacement Strategy for Aging Avionics Computers”, IEEE AES Systems Magazine, XP002190614,(Mar. 1999).Applicant
- Menzes, Oorschot, “Handbook of Applied Cryptography”, CRC Press LLC, USA XP002201307, (1997),475.Applicant
- Richt, Stefan , et al., “In-Circuit-Emulator Wird Echtzeittauglich”, Elektronic, Franzis Verlag GMBH, Munchen, DE, vol. 40, No. 16, XP000259620,(100-103),Aug. 6, 1991.Applicant
- Robin, John S., et al., “Analysis of the Pentium's Ability to Support a Secure Virtual Machine Monitor”, Proceedings of the 9th USENIX Security Symposium, XP002247347, Denver, Colorado, (Aug. 14, 2000),1-17.Applicant
- Saez, Sergio , et al., “A Hardware Schedular for Complex Real-Time Systems”, Proceedings of the IEEE International Symposium on Industrial Electronics, XP002190615,(Jul. 1999),43-48.Applicant
- Sherwood, Timothy , et al., “Patchable Instruction ROM Architecture”, Department of Computer Science and Engineering, University of California, San Diego, La Jolla, CA, (Nov. 2001).Applicant
- Compaq Computer Corporation, “Trusted Computing Platform Alliance (TCPA) Main Specification Version 1.1a”, XP002272822, (Jan. 25, 2001),1-321.Applicant
- Coulouris, George , et al., “Distributed Systems, Concepts and Designs”, 2nd Edition, (1994),422-424.Applicant
- Crawford, John , “Architecture of the Intel 80386”, Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD '86), (Oct. 6, 1986), 155-160.Applicant
- Fabry, R.S. , “Capability-Based Addressing”, Fabry, R.S., “Capability-Based Addressing,” Communications of the ACM, vol. 17, No. 7, (Jul. 1974),403-412.Applicant
- Frieder, Gideon , “The Architecture And Operational Characteristics of the VMX Host Machine”, The Architecture And Operational Characteristics of the VMX Host Machine, IEEE, (1982),9-16.Applicant
- HP Mobile Security Overview, “HP Mobile Security Overview”, (Sept. 2002),1-10.Applicant
- IBM Corporation, “IBM ThinkPad T30 Notebooks”, IBM Product Specification, located at www-1.ibm.com/service/files/cisco—t30—spec—sheet—070202.pdf, last visited Jun. 23, 2004,(Jul. 2, 2002),1-6.Applicant
- Intel Corporation, “IA-64 System Abstraction Layer Specification”, Intel Product Specification, Order NO. 245359-001, (Jan. 2000),1-112.Applicant
- Intel Corporation, “Intel 82802AB/82802AC Firmware Hub (FWH)”, Intel Product Datasheet, Document No. 290658-004, (Nov. 2000), 1-6, 17-28.Applicant
- Intel Corporation, “Intel IA-64 Architecture Software Developer's Manual”, vol. 2: IA-64 System Architecture, Order No. 245318-001, (Jan. 2000),i, ii, 5.1-5.3, 11.1-11.8, 11.23-11.26.Applicant
- Menezes, Alfred J., et al., “Handbook of Applied Cryptography”, CRC Press Series on Discrete Mathematices and its Applications, Boca Raton, Fl, XP002165287 , ISBN 0849385237 ,(Oct. 1996),403-405, 506-515, 570.Applicant
- Nanba, S. , et al., “VM/4: ACOS-4 Virtual Machine Architecture”, VM/4: ACOS-4 Virtual Machine Architecture, IEEE, (1985),171-178.Applicant
- RSA SECURITY, “Hardware Authenticators”, www.rsasecurity.com/node.asp?id=1158, 1-2.Applicant
- RSA SECURITY, “RSA SecurID Authenticators”, www.rsasecurity.com/products/securid/datasheets/SID—DS—0103.pdf, 1-2.Applicant
- RSA SECURITY, “Software Authenticators”, www.srasecurity.com/node.asp?id=1313, 1-2.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002939871; ISBN 0471117099,(Oct. 1995),47-52.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithm, and Source Code in C”, Wiley, John & Sons, Inc., XP002138607; ISBN 0471117099,(Oct. 1995),56-65.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithms, and Source Code C”, Wiley, John & Sons, Inc., XP0021111449; ISBN 0471117099, (Oct. 1995), 169-187.Applicant
- Schneier, Bruce , “Applied Cryptography: Protocols, Algorithms, and Source Code in C”, 2nd Edition: Wiley John & Sons, Inc., XP002251738; ISBN 0471128457,(Nov. 1995),28-33; 176-177; 216-217; 461-473; 518-522.Applicant
- PCT International Search Report for International application No. PCT/US03/09482 dated Dec. 21, 2004.Applicant
- Hall, Judith, et al., “Virtualizing the VAX Architecture”, Digital Equipment Corporation, Littleton, Mass., 1991 (pp. 380-389).Applicant