US 7,020,738 B2Grant
Method for resolving address space conflicts between a virtual machine monitor and a guest operating system
Issue Date:2006-03-28
•30 Claims
•8 Drawing Sheets
Abstract
One embodiment of the invention is method for resolving address space conflicts between a virtual machine monitor and a guest operating system. The method includes allocating an address space for the operating system and an address space for the monitor. The method also includes mapping a portion of the monitor into the address space allocated for the operating system and the address space allocated for the monitor, and locating another portion of the monitor in the address space allocated for the monitor. The method also includes detecting that the operating system attempts to access a region occupied by the portion of the monitor within the address space allocated for the operating system, and relocating that portion of the monitor within that address space to allow the operating system to access the region previously occupied by that portion of the monitor.
Metadata
Assignee
- Intel Corporation
Inventors
- Gilbert Neiger
- Stephen Chou
- Erik Cota-Robles
- Stalinselvaraj Jevasingh
- Alain Kagi
- Michael Kozuch
- Richard Uhlig
- Sebastian Schoenberg
Application Information
Application Number:US 10/676,737
Filing Date:2003-09-30
Priority Date:2000-12-27
Art Unit:2187
Classifications
IPC:
G06F13/00
Patent Drawings (8 sheets)
Description
Related Applications
[0001] This application is a continuation of U.S. patent application Ser. No. 09/752,587, filed Dec. 27, 2000.
Field of the Invention
[0002] The present invention relates generally to virtual machines, and more specifically to resolving address space conflicts between a virtual machine monitor and a guest operating system.
Background of the Invention
[0003] 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 an unlimited access to the computer's physical memory and memory-mapped I/O devices during these operations. However, in a virtual machine environment, the VMM should be able to have ultimate control over the computer's resources to provide protection from and between virtual machines. To achieve this, the VMM typically intercepts and arbitrates all accesses made by the guest operating system to the computer resources.
[0004] With existing processors (e.g., IA-32 microprocessors), the VMM may not be able to intercept accesses of the guest operating system to hardware resources unless a portion of the VMM code and/or data structures is located in the same virtual address space as the guest operating system. However, the guest operating system does not expect the VMM code and/or data structures to reside in the address space of the guest operating system and can attempt to access a region occupied by the VMM in this address space, causing an address space conflict between the guest operating system and the VMM. This conflict may result in abnormal termination of operations performed by the VMM or the guest operating system.
[0005] Thus, a mechanism is needed that will detect and resolve address space conflicts between a VMM and a guest operating system.
Brief Description of the Drawings
[0006] 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:
[0007] FIG. 1 illustrates one embodiment of a virtual machine environment;
[0008] FIG. 2 is a block diagram of a system for resolving address space conflicts between a virtual machine monitor and a guest operating system, according to one embodiment of the present invention;
[0009] FIG. 3 is a flow diagram of a method for resolving address space conflicts between a virtual machine monitor and a guest operating system, according to one embodiment of the present invention;
[0010] FIG. 4 is a flow diagram of a method for relocating a virtual machine kernel within a virtual machine address space, according to one embodiment of the present invention;
[0011] FIG. 5 illustrates operation of a virtual machine kernel that supports guest deprivileging, according to one embodiment of the present invention;
[0012] FIG. 6 is a flow diagram of a method for handling a virtualization trap generated by a guest operating system, according to one embodiment of the present invention; and
[0013] FIG. 7 is a block diagram of one embodiment of a processing system.
Description of Embodiments
[0014] A method and apparatus for resolving address space conflicts are described. In the following description, numerous details are set forth, such as distances between components, types of molding, etc. It will be apparent, however, to one skilled in the art, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring the present invention.
[0015] 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.
[0016] Some portions of the detailed descriptions which follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer 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 steps leading to a desired result. The steps 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.
[0017] 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 “displaying” 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.
[0018] The present invention also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Instructions are executable using one or more processing devices (e.g., processors, central processing units, etc.).
[0019] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose machines may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these machines will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.
[0020] 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.
[0021] The method and apparatus of the present invention provide a mechanism for resolving address space conflicts between a guest operating system and a virtual machine monitor (VMM). 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. A VMM, though typically implemented in software, may export a bare machine interface, such as an emulation, to higher level software. Such higher level software may comprise a standard or real-time OS, although the invention is not limited in scope in this respect and, alternatively, for example, a VMM 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.
[0022] As described above, a VMM presents to other software (i.e., “guest” software) the abstraction of one or more virtual machines (VMs). FIG. 1 shows two VMs, 102 and 114. Each VM includes 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., memory and memory-mapped I/O devices) within the hardware platform on which the guest OS 104 or 106 is running and to perform other functions. However, in a virtual machine environment, the VMM 112 should be able to have ultimate control over the physical resources to provide protection from and between VMs 102 and 114. The VMM 112 achieves this goal by intercepting all accesses of the guest OSs 104 and 106 to the computer's physical resources. For instance, a guest deprivileging technique may be used to enable the VMM 112 to intercept the above accesses. Guest deprivileging forces all guest software to run at a hardware privilege level that does not allow that software access to certain hardware resources. As a result, whenever the guest OS 104 or 106 attempts to access any of these hardware resources, it “traps” to the VMM 112, i.e., the VMM 112 receives control over an operation initiated by the guest operating system if this operation involves accessing such hardware resources. It should be noted that any other technique known in the art may be used to transfer control over a similar operation from the guest OS 104 or 106 to the VMM 112.
[0023] When using guest deprivileging or other techniques enabling the VMM 112 to intercept accesses of the guest OSs 104 and 106 to the computer's physical resources, a portion of VMM code and/or data structures may be architecturally required to reside in the same virtual address space as each of the guest OSs 104 and 106. However, since the guest OSs 104 and 106 are unaware of the VMM's presence, they may attempt to access a region occupied by the VMM code and/or data structures in the virtual address space associated with the guest OS 104 or 106. Such an attempt may result in collision between the code and data structures of the guest OS and the VMM code and data structures in the virtual address space, causing an abnormal termination of an operation performed by the guest OS 104 or 106, or the VMM 112. The present invention provides a mechanism for resolving such address space conflicts.
[0024] FIG. 2 is a block diagram of a system 200 for resolving address space conflicts between a VMM and a guest OS, according to one embodiment of the present invention. System 200 includes bare platform hardware 214 that includes a computing platform capable of executing a guest OS (e.g., guest OS 104 or 106), a VMM (e.g., VMM 112), etc. Two separate address spaces 204 and 202 are allocated for guest software and the VMM. That is, VM address space 204 is allocated to hold code and data structures of the guest OS and other guest software, and VMM address space 202 is allocated for VMM code and data structures.
[0025] As described above, certain components of the VMM code and/or data structures may be architecturally required to reside in the same address space as the guest OS to enable the VMM to intercept the guest OS's accesses to hardware resources. For instance, for the IA-32 instruction set architecture (ISA), when guest deprivileging is used to ensure control of the VMM over the guest OS's accesses to hardware resources, an interrupt-descriptor table (IDT), which includes pointers to trap handling routines, is architecturally required to reside in the same address space as the guest OS. One embodiment of the present invention that supports guest deprivileging will be described in greater detail below in conjunction with FIGS. 5 and 6 . For other ISAs, various other portions of VMM code and/or data structures may be architecturally required to reside in the same space address as the guest OS to enable the VMM's control over accesses made by the guest OS to hardware resources.
[0026] In one embodiment, the VMM code and structures are divided into two portions. The first portion of the VMM includes a set of code and/or data structures that are required to reside in the address space of the guest OS, i.e., in the VM address space 204. The second portion of the VMM includes the remainder of the VMM code and data structures. In one embodiment, a software program (referred as a virtual machine kernel 210) collects a minimal set of the VMM code and/or data structures that are required to be located in the same address space as the guest OS. The remainder of the VMM code and data structures is compiled as a separate program and located in the VMM address space 202. The virtual machine kernel (VMK) 210 then maps itself into both the VM address space 204 and the VMM address space 202.
[0027] Subsequently, when the guest OS attempts to access a region occupied by the VMM code and/or data structures in the VM address space 204, the VMK 210 detects this attempt of the guest OS. In one embodiment, the VMK 210 receives control over an event initiated by the guest OS if this event may potentially cause an address space conflict between the guest OS and the VMM. Guest deprivileging or any other hardware or software mechanisms known in the art may be used to transfer control over such an event from the guest OS to the VMM code and/or data structures residing in the VM address space 204.
[0028] The VMK 210 then evaluates this event to determine its cause. Upon detecting that the event was caused by the attempt of the guest OS to access the region occupied by the VMM code and/or data structures, the VMK 210 re-maps itself into a different region within the VM address space 204 to allow the guest OS to access the region previously used by the VMK 210. One embodiment of a method for relocating the VMK 210 within the VM address space 204 is described in greater detail below in conjunction with FIG. 4 .
[0029] FIG. 3 is a flow diagram of one embodiment of a method 300 for resolving address space conflicts between a VMM and a guest OS, according to one embodiment of the present invention. Method 300 begins with dividing the VMM into a first portion and a second portion (processing block 304). As described above, the first portion includes a set of VMM code and/or data structures that are architecturally required to reside in the same address space as the guest OS. The second portion of the VMM includes the remainder of the VMM code and data structures. In one embodiment (described in greater detail below), the first portion of the VMM includes a set of trap handlers and an interrupt-descriptor table (IDT). In alternative embodiments, the first portion includes various other data structures and code of the VMM that must reside in the same address space as the guest OS.
[0030] Next, a first address space (i.e., VM address space 204) is created to hold code and data structures of the guest OS and other guest software (processing block 306), and a second address space (i.e., VMM address space 202) is created for the VMM code and data structures (processing block 308). In one embodiment, these address spaces are created during the boot process.
[0031] Further, the first portion of the VMM is mapped into both the VM address space and the VMM address space (processing block 310), and the second portion of the VMM is loaded into the VMM address space (processing block 312).
[0032] At processing block 314, an attempt of the guest OS to access a region occupied by the first portion of the VMM is detected. In one embodiment, such an attempt is detected by transferring control over an event initiated by the guest OS to the first portion of the VMM if the event may potentially cause an address-space conflict between the guest operating system and the VMM. One embodiment of detecting a potential address space conflict is described in greater detail below in conjunction with FIGS. 5 and 6 .
[0033] Afterwards, at processing block 316, the first portion of the VMM is relocated to another region within the VM address space to allow access of the guest OS to the region previously occupied by the first portion of the VMM. Any subsequent attempt to access the new region occupied by the first portion of the VMM will again result in its relocation within the VM address space. One embodiment of a method for relocating a VMK, which contains the first portion of the VMM, is shown in FIG. 4 .
[0034] Referring to FIG. 4 , after an address space conflict between the guest OS and the VMM is detected (processing block 404), the VM address space is searched for an unused region (processing block 406). At decision box 408, a determination is made as to whether an unused region exists in the VM address space. If the determination is positive, the VMK containing the first portion of the VMM code and data structures is remapped into this unused region, and control is transferred back to the guest OS, which may now access the region previously used by the VMK.
[0035] Alternatively, if no unused region exists in the VM address space, i.e., the guest OS has used the entire VM address space, then a random region is selected within the VM address space (processing block 412), the content of the memory located at the selected region is copied to a buffer in the VMM address space (processing block 414), and the VMK is remapped into the selected region in the VM address space (processing block 416). Subsequent memory accesses to this selected region (i.e., new VMK region) are serviced through emulated memory accesses from the buffer in the VMM address space that contains the original content of the new VMK region. In one embodiment, the frequency of such emulated memory references may be reduced by periodically relocating the VMK to random regions within the VM address space until a region is found that is infrequently used.
[0036] FIG. 5 illustrates operation of a VMK that supports guest deprivileging, according to one embodiment of the present invention. As described above, guest deprivileging causes the guest OS to run at a lesser privileged level so that the guest OS “traps” to the VMM whenever it attempts to issue privileged instructions that operate on the processor system state. In one embodiment, the VMM supporting guest deprivileging installs pointers to trap handling routines (i.e., trap handlers 552) in the interrupt-descriptor table (IDT) 514. Some ISAs (e.g., IA-32 ISA) require that the IDT 514 be resident in the currently active virtual address space (i.e., VM address space 504). In one embodiment, the entries in the IDT 514 are task gates, which provide an address space switch. That is, when a trap is generated, the IDT 514 is searched for a pointer to a trap handling routine. If this pointer is a task gate, it will enable a direct switch to the VMM address space, which contains a trap handling routine for the generated trap. Accordingly, a trap handler corresponding to a task gate does not need to reside in the VM address space, although the task gate itself must reside in the VM address space. In another embodiment, entries in the IDT 514 are trap gates or interrupt gates, which do not provide address space switches. Consequently, trap handlers associated with such IDT entries must reside in the VM address space. In addition, the VMM may place shadow versions of other data structures (e.g., global descriptor table) in the VM address space.
[0037] In one embodiment, the VMK 510 collects together a minimal set of trap handlers and/or data structures (e.g., the IDT 514) that must be located in the VM address space, maps them into both the VM address space 504 and the VMM address space 502, and sets access rights of the pages holding the VMK 510 to the most privileged level (e.g., the “supervisor” privilege level with ring=0 for IA-32 microprocessors). As described above, the guest OS runs in the deprivileged mode (e.g., the “user” mode with ring=3 for IA-32 microprocessors). As a result, in one embodiment, the guest OS generates virtualization traps whenever it attempts to access privileged machine resources, including the pages holding the VMK 510 that are protected with the most privileged access rights.
[0038] In one embodiment, when a virtualization trap is generated, the IDT 514 is searched for a corresponding pointer to a trap handler. In one embodiment, a trap may need to be handled by the VMM-resident trap handler. In this embodiment, the VMK performs two address space switches—one switch to deliver the trap to the trap handler in the VMM address space 502, and a second switch to transition back to the VM address space 504 after the trap has been serviced by VMM-resident trap-handler.
[0039] Alternatively, a trap can be handled in a VMK-resident handler. For instance, a trap may be caused by an instruction of the guest OS to reset a flag in the processor's register. Such a trap can be handled entirely in the trap handler 552, without transferring control to the VMM in the VMM address space 502, and such an implementation would result in better performance.
[0040] One type of virtualization traps is a conflict fault which is generated when the guest OS attempts to access a region of the VM address space 504 that is currently in use by the VMK 510. The VMK 510 handles these conflict faults by re-mapping itself into a new region within the VM address space 504 as described in greater detail above in conjunction with FIG. 4 .
[0041] FIG. 6 is a flow diagram of a method 600 for handling virtualization traps generated by a guest OS, according to one embodiment of the present invention. Method 600 begins with setting access rights of the region occupied by the VMK to a more privileged level than a privilege level associated with the guest OS (processing block 604). For instance, all VMK pages may be mapped with supervisor-only privilege (ring=0) and the guest OS may be set to run in the deprivileged user mode (ring=3).
[0042] At processing block 606, a trap generated by the guest OS is received. The trap is caused by an attempt of the guest OS to access privileged hardware resources. At decision box 608, a determination is made as to whether the trap can be handled internally by the VMK (e.g., in a VMK-resident trap handler). If the trap is too complex to be handled by the VMK, it is delivered to the VMM address space (e.g., to a VMM-resident trap handler) (processing block 610) and then resumed back to the VM address space after the trap has been serviced by the VMM (processing block 612). Afterwards, control over the event that caused the trap is returned to the guest OS (processing block 620).
[0043] Alternatively, if the trap can be handled internally by the VMK, a determination is made as to whether the trap was caused by an address space conflict between the VMK code and data structures and the code and data structures of the guest OS (decision box 614). If the trap was indeed caused by an address space conflict, the VMK code and data structures are relocated to a new region within the VM address space (processing block 618). Alternatively, the trap is handled in a corresponding trap handler (processing block 616). Afterwards, control over the event that caused the trap is returned to the guest OS (processing block 620).
[0044] FIG. 7 is a block diagram of one embodiment of a processing system. Processing system 700 includes processor 720 and memory 730. Processor 720 can be any type of processor capable of executing software, such as a microprocessor, digital signal processor, microcontroller, or the like. Processing system 700 can be a personal computer (PC), mainframe, handheld device, portable computer, set-top box, or any other system that includes software.
[0045] Memory 730 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 720. Memory 730 can store instructions for performing the execution of the various method embodiments of the present invention such as methods 300, 400 and 600 (FIGS. 3 , 4 and 6).
[0046] 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:
allocating a first address space for a guest operating system;
allocating a second address space for a virtual machine monitor (VMM);
mapping a first portion of the VMM into the first address space and the second address space;
locating a second portion of the VMM in the second address space;
detecting that the guest operating system attempts to access a region occupied by the first portion of the VMM within the first address space; and
relocating the first portion of the VMM within the first address space to allow the guest operating system to access the region previously occupied by the first portion of the VMM.
2. The method of claim 1 wherein the first portion of the VMM includes a set of VMM code and data structures that are architecturally required to reside in the first address space.
3. The method of claim 1 wherein the first portion of the VMM includes a set of trap handlers and an interrupt-descriptor table (IDT).
4. The method of claim 1 further comprising:
dividing the VMM into the first portion and a second portion.
5. The method of claim 1 further comprising:
receiving control over an event initiated by the guest operating system when the event may potentially cause an address space conflict between the guest operating system and the VMM.
6. The method of claim 5 wherein receiving control further comprises:
setting access rights of the section occupied by the first portion of the VMM to a more privileged level than a privilege level associated with the guest operating system; and
receiving a trap caused by an attempt of the guest operating system to access a hardware resource having a higher privilege level than the privilege level associated with the guest operating system.
7. The method of claim 6 further comprising:
determining that the trap can be handled by the first portion of the VMM;
executing code associated with the trap; and
returning control over the event to the guest operating system.
8. The method of claim 6 further comprising:
determining that the trap should be handled by the second portion of the VMM;
delivering the trap to the second portion of the VMM;
passing control over the event to the guest operating system after code associated with the trap was executed by the second portion of the VMM.
9. The method of claim 1 wherein relocating the first portion of the VMM further comprises:
finding an unused region within the first address space; and
re-mapping the first portion of the VMM into the unused region.
10. The method of claim 1 wherein relocating the first portion of the VMM further comprises:
determining that no unused region exists within the first address space;
selecting a random region within the first address space;
copying content of a memory located at the random region to the second address space; and
re-mapping the first portion of the VMM into the random region.
11. The method of claim 10 further comprising:
receiving control over an event initiated by the guest operating system, the event corresponding an attempt of the guest operating system to access the content of the memory previously located at the random region; and
accessing the copied content of the memory in the second address space.
12. The method of claim 11 further comprising periodically relocating the first portion of the VMM to random regions within the first address space until finding a region that is infrequently accessed.
13. An apparatus comprising:
a first address space associated with a guest operating system;
a second address space associated with a virtual machine monitor (VMM); and
a virtual machine kernel to allocate the first address space for the guest operating system, to allocate the second address space for the VMM, to map a first portion of the VMM into the first address space and the second address space, to locate a second portion of the VMM in the second address space, to detect that the guest operating system attempts to access a region occupied by the first portion of the VMM within the first address space and to relocate the first portion of the VMM within the first address space to allow the guest operating system to access the region previously occupied by the first portion of the VMM.
14. The apparatus of claim 13 wherein the first portion of the VMM includes a set of VMM code and data structures that are architecturally required to reside in the first address space.
15. The apparatus of claim 13 wherein the first portion of the VMM includes a set of trap handlers and an interrupt-descriptor table (IDT).
16. The apparatus of claim 13 wherein the virtual machine kernel is to divide the VMM into the first portion and the second portion.
17. The apparatus of claim 13 wherein the virtual machine kernel is to receive control over an event initiated by the guest operating system when the event may potentially cause an address space conflict between the guest operating system and the VMM.
18. The apparatus of claim 13 wherein the virtual machine kernel is to receive control by setting access rights of the section occupied by the first portion of the VMM to a more privileged level than a privilege level associated with the guest operating system, and by receiving a trap caused by an attempt of the guest operating system to access a hardware resource having a higher privilege level than the privilege level associated with the guest operating system.
19. The apparatus of claim 18 wherein the virtual machine kernel is to further determine that the trap can be handled by the first portion of the VMM, to execute code associated with the trap, and to return control over the event to the guest operating system.
20. The apparatus of claim 18 wherein the virtual machine kernel is to further determine that the trap should to handled by the second portion of the VMM, to deliver the trap to the second portion of the VMM, and to pass control over the event to the guest operating system after code associated with the trap was executed by the second portion of the VMM.
21. The apparatus of claim 13 wherein the virtual machine kernel is to relocate the first portion of the VMM by finding an unused region within the first address space and re-mapping the first portion of the VMM into the unused region.
22. The apparatus of claim 13 wherein the virtual machine kernel is to relocate the first portion of the VMM by determining that no unused region exists within the first address space, selecting a random region within the first address space, copying content of a memory located at the random region to the second address space, and re-mapping the first portion of the VMM into the random region.
23. The apparatus of claim 13 wherein the virtual machine kernel is to receive control over an event initiated by the guest operating system, the event corresponding to an attempt of the guest operating system to access the content of the memory previously located at the random region, and to access the copied content of the memory in the second address space.
24. The apparatus of claim 13 wherein the virtual machine kernel is to periodically relocate the first portion of the VMM to random regions within the first address space until finding a region that is infrequently accessed.
25. A system comprising:
a memory to include a first address space associated with a guest operating system and a second address space associated with a virtual machine monitor (VMM); and
a processor, coupled to the memory, to allocate the first address space for the guest operating system, to allocate the second address space for the VMM, to map a first portion of the VMM into the first address space and the second address space, to locate a second portion of the VMM in the second address space, to detect that the guest operating system attempts to access a region occupied by the first portion of the VMM within the first address space and to relocate the first portion of the VMM within the first address space to allow the guest operating system to access the region previously occupied by the first portion of the VMM.
26. The system of claim 25 wherein the first portion of the VMM includes a set of VMM code and data structures that are architecturally required to reside in the first address space.
27. The system of claim 25 wherein the first portion of the VMM includes a set of trap handlers and an interrupt-descriptor table (IDT).
28. A computer readable medium that provides instructions, which when executed on a processor, cause said processor to perform operations comprising:
allocating a first address space for a guest operating system;
allocating a second address space for a virtual machine monitor (VMM);
mapping a first portion of the VMM into the first address space and the second address space;
locating a second portion of the VMM in the second address space;
detecting that the guest operating system attempts to access a region occupied by the first portion of the VMM within the first address space; and
relocating the first portion of the VMM within the first address space to allow the guest operating system to access the region previously occupied by the first portion of the VMM.
29. The computer readable medium of claim 28 comprising further instructions causing the processor to perform operations comprising:
finding an unused region within the first address space; and
re-mapping the first portion of the VMM into the unused region.
30. The computer readable medium of claim 28 comprising further instructions causing the processor to perform operations comprising:
determining that no unused region exists within the first address space;
selecting a random region within the first address space;
copying content of a memory located at the random region to the second address space; and
re-mapping the first portion of the VMM into the random region.
Patent Citations (253)
| 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 |
| US4307214(A) | 1981-12-01 | McDaniel et al. | 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. | Applicant |
| US4825052(A) | 1989-04-01 | Chemin et al. | Applicant |
| US4907270(A) | 1990-03-01 | Hazard | Applicant |
| US4907272(A) | 1990-03-01 | Hazard et al. | Applicant |
| US4910774(A) | 1990-03-01 | Barakat | Applicant |
| US4975836(A) | 1990-12-01 | Hirosawa et al. | Applicant |
| 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. | Applicant |
| US5230069(A) | 1993-07-01 | Brelsford et al. | Applicant |
| 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 |
| US5291605(A) | 1994-03-01 | Takagi et al. | Examiner |
| US5293424(A) | 1994-03-01 | Holtey et al. | Applicant |
| US5295251(A) | 1994-03-01 | Wakui et al. | Applicant |
| US5317705(A) | 1994-05-01 | Gannon et al. | Applicant |
| US5319760(A) | 1994-06-01 | Mason et al. | Applicant |
| US5361375(A) | 1994-11-01 | Ogi | Applicant |
| 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 | Applicant |
| 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 | Applicant |
| US5555414(A) | 1996-09-01 | Hough et al. | Applicant |
| US5560013(A) | 1996-09-01 | Scalzi et al. | Applicant |
| US5564040(A) | 1996-10-01 | Kubals | Applicant |
| US5566323(A) | 1996-10-01 | Ugon | Applicant |
| US5568552(A) | 1996-10-01 | Davis | Applicant |
| US5574936(A) | 1996-11-01 | Ryba et al. | Applicant |
| 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 |
| US5757604(A) | 1998-05-01 | Bennett 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 et al. | 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 | 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 | 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 | 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 et al. | 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 et al. | Applicant |
| US6339816(B1) | 2002-01-01 | Bausch | Applicant |
| US6357004(B1) | 2002-03-01 | Davis | Applicant |
| US6363485(B1) | 2002-03-01 | Adams et al. | 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 et al. | 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 | McFarland 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 |
| US6789126(B1) | 2004-09-01 | Saulpaugh et al. | Examiner |
| 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/0083110(A1) | 2002-06-01 | Kozuch et al. | Examiner |
| 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 | Tello | 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 |
| DE4217444 | 1992-12-01 | Applicant | |
| DE42177444(A1) | 1992-12-01 | Applicant | |
| EP473913 | 1992-03-01 | 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(A1) | 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 | |
| JP76139(A0) | 2000-03-01 | Applicant | |
| WO9524696 | 1995-09-01 | Applicant | |
| WO97/29567(A1) | 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 | |
| WO1/27723(A2) | 2001-04-01 | Applicant | |
| WO1/27821(A2) | 2001-04-01 | Applicant | |
| WO163994 | 2001-08-01 | Applicant | |
| WO175564(A) | 2001-10-01 | Applicant | |
| WO1/75565(A2) | 2001-10-01 | Applicant | |
| WO1/75595(A2) | 2001-10-01 | Applicant | |
| WO1/175565(A2) | 2001-10-01 | Applicant | |
| WO175595 | 2001-10-01 | Applicant | |
| WO201794 | 2002-01-01 | Applicant | |
| WO217555(A) | 2002-02-01 | Applicant | |
| WO2060121 | 2002-08-01 | Applicant | |
| WO2086684(A) | 2002-10-01 | Applicant | |
| WO3058412 | 2003-07-01 | Applicant |
Non-Patent Literature (44)
- Lawton, K. “Running Multiple Operating Systems Concurrently on an IA32 PC Using Virtualization Techniques,”; http://www.plex86.org/research/paper.txt., pp. 1-31. Last Updated Nov. 29, 1999.Examiner
- Heinrich, J., “MIPS R4000 Microprocessor User's Manual,” Chapter 4, Memory Management, pp. 61-97. 1993.Applicant
- 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 the 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,” Second Edition, Chapter 4: Memory Management, pp. 67-79.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, MC48040V, 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
- Brands, Stefan , “Restrictive Blinding of Secret-Key Certificates”, Springer-Verlag XP002201306, (1995),Chapter 3.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
- Intel, “IA-32 Intel Architecture Software Developer's Manual”, vol. 3: System Programming Guide, Intel Corporation—2003, 13-1 through 13-24.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
- Menezes, 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
- Saez, Sergio , et al., “A Hardware Scheduler 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
- Kashiwagi, Kazuhiko, et al., “Design and Implementation of Dynamically Reconstructing System Software,” Software Engineering Conference, 1996 Asia Pacific Seoul, South Korea, IEEE Comput. Soc. Dec. 4, 1996, pp. 278-287.Applicant
- Karger, Paul A., et al., “A VMM Security Kernel for the VAX Architecture,” Proceedings of the Symposium on Research in Security and Privacy, May 7, 1990, pp. 2-19, XP010020182, ISBN: 0-8186-2060-9, Boxborough, MA.Applicant
- Chien, Andrew A., et al., “Safe and Protected Execution for the Morph/AMRM Reconfigurable Processor,” 7th Annual IEEE Symposium, FCCM '99 Proceedings Apr. 21, 1999, pp. 209-221, XP010359180, ISBN: 0-7695-0375-6, Los Alamitos, CA.Applicant
- Robin, John Scott and Irvine, Cynthia E., “Analysis of the Pentium's Ability to Support a Secure Virtual Machine Monitor,” Proceedings of the 9th USENIX Security Symposium, Aug. 14, 2000, pp. 1-17, XP002247347, Denver, CO.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/services/files/cisco—t30—spec—sheet—070202.pdf, last visited Jun. 23, 2004,(Jul. 2, 2002),1-6.Applicant
- Intel Corporation, “IA-64 System Abstraciton 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”, Volume 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 Architecure, 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
- IBM Technical Disclosure Bulletin, “Information Display Technique For A Terminate Stay Resident Program,” vol. 34, Issue No. 7A, pp. 156-158, Dec. 1, 1991.Applicant
- Trusted Computing Platform Alliance (TCPA), Main Specification Version 1.1a, 321 pages, Copyright 2000-2001.Applicant