Patent Grant
7020738
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.
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.
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.
Thus, a mechanism is needed that will detect and resolve address space conflicts between a VMM and a guest operating system.
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:
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.
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.
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.
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.
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.).
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.
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.
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).
As described above, a VMM presents to other software (i.e., “guest” software) the abstraction of one or more virtual machines (VMs).
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.
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
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.
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.
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
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.
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).
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
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
Referring to
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.
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.
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.
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.
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
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).
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).
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 (
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.
This application is a continuation of U.S. patent application Ser. No. 09/752,587, filed Dec. 27, 2000.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3699532 | Schaffer et al. | Oct 1972 | A |
| 3996449 | Attanasio et al. | Dec 1976 | A |
| 4037214 | Birney et al. | Jul 1977 | A |
| 4162536 | Morley | Jul 1979 | A |
| 4207609 | Luiz et al. | Jun 1980 | A |
| 4247905 | Yoshida et al. | Jan 1981 | A |
| 4276594 | Morley | Jun 1981 | A |
| 4278837 | Best | Jul 1981 | A |
| 4307214 | McDaniel et al. | Dec 1981 | A |
| 4307447 | Provanzano et al. | Dec 1981 | A |
| 4319233 | Matsuoka et al. | Mar 1982 | A |
| 4319323 | Ermolovich et al. | Mar 1982 | A |
| 4347565 | Kaneda et al. | Aug 1982 | A |
| 4366537 | Heller et al. | Dec 1982 | A |
| 4403283 | Myntti et al. | Sep 1983 | A |
| 4419724 | Branigin et al. | Dec 1983 | A |
| 4430709 | Schleupen | Feb 1984 | A |
| 4521852 | Guttag | Jun 1985 | A |
| 4571672 | Hatada et al. | Feb 1986 | A |
| 4621318 | Maeda | Nov 1986 | A |
| 4759064 | Chaum | Jul 1988 | A |
| 4795893 | Ugon | Jan 1989 | A |
| 4802084 | Ikegaya et al. | Jan 1989 | A |
| 4825052 | Chemin et al. | Apr 1989 | A |
| 4907270 | Hazard | Mar 1990 | A |
| 4907272 | Hazard et al. | Mar 1990 | A |
| 4910774 | Barakat | Mar 1990 | A |
| 4975836 | Hirosawa et al. | Dec 1990 | A |
| 5007082 | Cummins | Apr 1991 | A |
| 5022077 | Bealkowski et al. | Jun 1991 | A |
| 5075842 | Lai | Dec 1991 | A |
| 5079737 | Hackbarth | Jan 1992 | A |
| 5187802 | Inoue et al. | Feb 1993 | A |
| 5230069 | Brelsford et al. | Jul 1993 | A |
| 5237616 | Abraham et al. | Aug 1993 | A |
| 5255379 | Melo | Oct 1993 | A |
| 5287363 | Wolf et al. | Feb 1994 | A |
| 5291605 | Takagi et al. | Mar 1994 | A |
| 5293424 | Holtey et al. | Mar 1994 | A |
| 5295251 | Wakui et al. | Mar 1994 | A |
| 5317705 | Gannon et al. | May 1994 | A |
| 5319760 | Mason et al. | Jun 1994 | A |
| 5361375 | Ogi | Nov 1994 | A |
| 5386552 | Garney | Jan 1995 | A |
| 5421006 | Jablon et al. | May 1995 | A |
| 5434999 | Goire et al. | Jul 1995 | A |
| 5437033 | Inoue et al. | Jul 1995 | A |
| 5442645 | Ugon et al. | Aug 1995 | A |
| 5455909 | Blomgren et al. | Oct 1995 | A |
| 5459867 | Adams et al. | Oct 1995 | A |
| 5459869 | Spilo | Oct 1995 | A |
| 5469557 | Salt et al. | Nov 1995 | A |
| 5473692 | Davis | Dec 1995 | A |
| 5479509 | Ugon | Dec 1995 | A |
| 5504922 | Seki et al. | Apr 1996 | A |
| 5506975 | Onodera | Apr 1996 | A |
| 5511217 | Nakajima et al. | Apr 1996 | A |
| 5522075 | Robinson et al. | May 1996 | A |
| 5528231 | Patarin | Jun 1996 | A |
| 5533126 | Hazard | Jul 1996 | A |
| 5555385 | Osisek | Sep 1996 | A |
| 5555414 | Hough et al. | Sep 1996 | A |
| 5560013 | Scalzi et al. | Sep 1996 | A |
| 5564040 | Kubals | Oct 1996 | A |
| 5566323 | Ugon | Oct 1996 | A |
| 5568552 | Davis | Oct 1996 | A |
| 5574936 | Ryba et al. | Nov 1996 | A |
| 5582717 | Di Santo | Dec 1996 | A |
| 5604805 | Brands | Feb 1997 | A |
| 5606617 | Brands | Feb 1997 | A |
| 5615263 | Takahashi | Mar 1997 | A |
| 5628022 | Ueno et al. | May 1997 | A |
| 5633929 | Kaliski, Jr. | May 1997 | A |
| 5657445 | Pearce | Aug 1997 | A |
| 5668971 | Neufeld | Sep 1997 | A |
| 5684948 | Johnson et al. | Nov 1997 | A |
| 5706469 | Kobayashi | Jan 1998 | A |
| 5717903 | Bonola | Feb 1998 | A |
| 5720609 | Pfefferle | Feb 1998 | A |
| 5721222 | Bernstein et al. | Feb 1998 | A |
| 5729760 | Poisner | Mar 1998 | A |
| 5737604 | Miller et al. | Apr 1998 | A |
| 5737760 | Grimmer, Jr. et al. | Apr 1998 | A |
| 5740178 | Jacks et al. | Apr 1998 | A |
| 5752046 | Oprescu et al. | May 1998 | A |
| 5757604 | Bennett et al. | May 1998 | A |
| 5757919 | Herbert et al. | May 1998 | A |
| 5764969 | Kahle et al. | Jun 1998 | A |
| 5796835 | Saada | Aug 1998 | A |
| 5796845 | Serikawa et al. | Aug 1998 | A |
| 5805712 | Davis | Sep 1998 | A |
| 5809546 | Greenstein et al. | Sep 1998 | A |
| 5825875 | Ugon | Oct 1998 | A |
| 5825880 | Sudia et al. | Oct 1998 | A |
| 5835594 | Albrecht et al. | Nov 1998 | A |
| 5844986 | Davis | Dec 1998 | A |
| 5852717 | Bhide et al. | Dec 1998 | A |
| 5854913 | Goetz et al. | Dec 1998 | A |
| 5867577 | Patarin | Feb 1999 | A |
| 5872994 | Akiyama et al. | Feb 1999 | A |
| 5890189 | Nozue et al. | Mar 1999 | A |
| 5900606 | Rigal et al. | May 1999 | A |
| 5901225 | Ireton et al. | May 1999 | A |
| 5903752 | Dingwall et al. | May 1999 | A |
| 5919257 | Trostle | Jul 1999 | A |
| 5935242 | Madany et al. | Aug 1999 | A |
| 5935247 | Pai et al. | Aug 1999 | A |
| 5937063 | Davis | Aug 1999 | A |
| 5944821 | Angelo | Aug 1999 | A |
| 5953502 | Helbig, Sr. | Sep 1999 | A |
| 5956408 | Arnold | Sep 1999 | A |
| 5970147 | Davis | Oct 1999 | A |
| 5978475 | Schneier et al. | Nov 1999 | A |
| 5978481 | Ganesan et al. | Nov 1999 | A |
| 5987557 | Ebrahim | Nov 1999 | A |
| 6014745 | Ashe | Jan 2000 | A |
| 6035374 | Panwar et al. | Mar 2000 | A |
| 6044478 | Green | Mar 2000 | A |
| 6055637 | Hudson et al. | Apr 2000 | A |
| 6058478 | Davis | May 2000 | A |
| 6061794 | Angelo | May 2000 | A |
| 6075938 | Bugnion et al. | Jun 2000 | A |
| 6085296 | Karkhanis | Jul 2000 | A |
| 6088262 | Nasu | Jul 2000 | A |
| 6092095 | Maytal | Jul 2000 | A |
| 6093213 | Favor et al. | Jul 2000 | A |
| 6101584 | Satou et al. | Aug 2000 | A |
| 6108644 | Goldschlag et al. | Aug 2000 | A |
| 6115816 | Davis | Sep 2000 | A |
| 6125430 | Noel et al. | Sep 2000 | A |
| 6131166 | Wong-Insley | Oct 2000 | A |
| 6148379 | Schimmel | Nov 2000 | A |
| 6158546 | Hanson et al. | Dec 2000 | A |
| 6173417 | Merrill | Jan 2001 | B1 |
| 6175924 | Arnold | Jan 2001 | B1 |
| 6175925 | Nardone et al. | Jan 2001 | B1 |
| 6178509 | Nardone et al. | Jan 2001 | B1 |
| 6182089 | Ganapathy et al. | Jan 2001 | B1 |
| 6188257 | Buer | Feb 2001 | B1 |
| 6192455 | Bogin et al. | Feb 2001 | B1 |
| 6199152 | Kelly et al. | Mar 2001 | B1 |
| 6205550 | Nardone et al. | Mar 2001 | B1 |
| 6212635 | Reardon | Apr 2001 | B1 |
| 6222923 | Schwenk | Apr 2001 | B1 |
| 6249872 | Wildgrube et al. | Jun 2001 | B1 |
| 6252650 | Nakamura | Jun 2001 | B1 |
| 6269392 | Cotichini et al. | Jul 2001 | B1 |
| 6272533 | Browne | Aug 2001 | B1 |
| 6272637 | Little et al. | Aug 2001 | B1 |
| 6275933 | Fine et al. | Aug 2001 | B1 |
| 6282650 | Davis | Aug 2001 | B1 |
| 6282651 | Ashe | Aug 2001 | B1 |
| 6282657 | Kaplan et al. | Aug 2001 | B1 |
| 6292874 | Barnett | Sep 2001 | B1 |
| 6301646 | Hostetter et al. | Oct 2001 | B1 |
| 6308270 | Guthery et al. | Oct 2001 | B1 |
| 6314409 | Schneck et al. | Nov 2001 | B1 |
| 6321314 | Van Dyke | Nov 2001 | B1 |
| 6327652 | England et al. | Dec 2001 | B1 |
| 6330670 | England et al. | Dec 2001 | B1 |
| 6339815 | Feng et al. | Jan 2002 | B1 |
| 6339816 | Bausch | Jan 2002 | B1 |
| 6357004 | Davis | Mar 2002 | B1 |
| 6363485 | Adams et al. | Mar 2002 | B1 |
| 6374286 | Gee et al. | Apr 2002 | B1 |
| 6374317 | Ajanovic et al. | Apr 2002 | B1 |
| 6378068 | Foster et al. | Apr 2002 | B1 |
| 6378072 | Collins et al. | Apr 2002 | B1 |
| 6389537 | Davis et al. | May 2002 | B1 |
| 6397242 | Devine et al. | May 2002 | B1 |
| 6397379 | Yates, Jr. et al. | May 2002 | B1 |
| 6412035 | Webber | Jun 2002 | B1 |
| 6421702 | Gulick | Jul 2002 | B1 |
| 6435416 | Slassi | Aug 2002 | B1 |
| 6445797 | McGough et al. | Sep 2002 | B1 |
| 6463535 | Drews et al. | Oct 2002 | B1 |
| 6463537 | Tello | Oct 2002 | B1 |
| 6499123 | McFarland et al. | Dec 2002 | B1 |
| 6505279 | Phillips et al. | Jan 2003 | B1 |
| 6507904 | Ellison et al. | Jan 2003 | B1 |
| 6529909 | Bowman-Amuah | Mar 2003 | B1 |
| 6535988 | Poisner | Mar 2003 | B1 |
| 6557104 | Vu et al. | Apr 2003 | B1 |
| 6560627 | McDonald et al. | May 2003 | B1 |
| 6609199 | DeTreville | Aug 2003 | B1 |
| 6615278 | Curtis | Sep 2003 | B1 |
| 6633963 | Ellison et al. | Oct 2003 | B1 |
| 6633981 | Davis | Oct 2003 | B1 |
| 6651171 | England et al. | Nov 2003 | B1 |
| 6678825 | Ellison et al. | Jan 2004 | B1 |
| 6684326 | Cromer et al. | Jan 2004 | B1 |
| 6789126 | Saulpaugh et al. | Sep 2004 | B1 |
| 20010021969 | Burger et al. | Sep 2001 | A1 |
| 20010027511 | Wakabayashi et al. | Oct 2001 | A1 |
| 20010027527 | Khidekel et al. | Oct 2001 | A1 |
| 20010037450 | Metlitski et al. | Nov 2001 | A1 |
| 20020007456 | Peinado et al. | Jan 2002 | A1 |
| 20020023032 | Pearson et al. | Feb 2002 | A1 |
| 20020083110 | Kozuch et al. | Jun 2002 | A1 |
| 20020147916 | Strongin et al. | Oct 2002 | A1 |
| 20020166061 | Falik et al. | Nov 2002 | A1 |
| 20020169717 | Challener | Nov 2002 | A1 |
| 20030018892 | Tello | Jan 2003 | A1 |
| 20030074548 | Cromer et al. | Apr 2003 | A1 |
| 20030115453 | Grawrock | Jun 2003 | A1 |
| 20030126442 | Glew et al. | Jul 2003 | A1 |
| 20030126453 | Glew et al. | Jul 2003 | A1 |
| 20030159056 | Cromer et al. | Aug 2003 | A1 |
| 20030188179 | Challener et al. | Oct 2003 | A1 |
| 20030196085 | Lampson et al. | Oct 2003 | A1 |
| 20040117539 | Bennett et al. | Jun 2004 | A1 |
| Number | Date | Country |
|---|---|---|
| 4217444 | Dec 1992 | DE |
| 42177444 | Dec 1992 | DE |
| 0473913 | Mar 1992 | EP |
| 0600112 | Jun 1994 | EP |
| 0602867 | Jun 1994 | EP |
| 0892521 | Jan 1999 | EP |
| 0930567 | Jul 1999 | EP |
| 0961193 | Dec 1999 | EP |
| 0965902 | Dec 1999 | EP |
| 1030237 | Aug 2000 | EP |
| 1055989 | Nov 2000 | EP |
| 1056014 | Nov 2000 | EP |
| 1085396 | Mar 2001 | EP |
| 1146715 | Oct 2001 | EP |
| 1209563 | May 2002 | EP |
| 1271277 | Jan 2003 | EP |
| 76139 | Mar 2000 | JP |
| WO9524696 | Sep 1995 | WO |
| WO 9729567 | Aug 1997 | WO |
| WO9812620 | Mar 1998 | WO |
| WO 9834365 | Aug 1998 | WO |
| WO 9844402 | Oct 1998 | WO |
| WO 9905600 | Feb 1999 | WO |
| WO 9909482 | Feb 1999 | WO |
| WO9918511 | Apr 1999 | WO |
| WO 9957863 | Nov 1999 | WO |
| WO9965579 | Dec 1999 | WO |
| WO0021238 | Apr 2000 | WO |
| WO 0062232 | Oct 2000 | WO |
| WO 0127723 | Apr 2001 | WO |
| WO 0127821 | Apr 2001 | WO |
| WO0163994 | Aug 2001 | WO |
| WO 01 75564 | Oct 2001 | WO |
| WO 0175565 | Oct 2001 | WO |
| WO 0175595 | Oct 2001 | WO |
| WO 01175565 | Oct 2001 | WO |
| WO0175595 | Oct 2001 | WO |
| WO0201794 | Jan 2002 | WO |
| WO 02 17555 | Feb 2002 | WO |
| WO02060121 | Aug 2002 | WO |
| WO 02 086684 | Oct 2002 | WO |
| WO03058412 | Jul 2003 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20040064813 A1 | Apr 2004 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09752587 | Dec 2000 | US |
| Child | 10676737 | US |
