US7313668B2 - Immediate virtual memory - Google Patents
Immediate virtual memory Download PDFInfo
- Publication number
- US7313668B2 US7313668B2 US10/768,306 US76830604A US7313668B2 US 7313668 B2 US7313668 B2 US 7313668B2 US 76830604 A US76830604 A US 76830604A US 7313668 B2 US7313668 B2 US 7313668B2
- Authority
- US
- United States
- Prior art keywords
- immediate
- memory
- virtual
- specified value
- operating system
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
- G06F12/1027—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
- G06F12/1036—Address translation using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] for multiple virtual address spaces, e.g. segmentation
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/65—Details of virtual memory and virtual address translation
- G06F2212/657—Virtual address space management
Definitions
- the present invention is related to computer architecture and computer operating systems and, in particular, to a method and system for efficiently providing default values to software without allocating or initializing the memory pages and without occupying space in the memory hierarchy.
- the present invention is related both to computer architecture and to computer operating systems. Although the present invention has many different alternative embodiments with respect to different, particular computer hardware platforms and computer-operating-system architectures, the present invention can be completely and straightforwardly described with respect to a simplified and generalized conceptualization of virtual-to-physical-address translation for one computer architecture.
- FIG. 1 illustrates generalized virtual-to-physical-address translation employed in a wide variety of modern computer systems, and implemented in a wide variety of currently available computer operating systems.
- a virtual address 101 generally fills a single, naturally sized computer word for a given computer and computer-operating-system architecture.
- a virtual address 101 is stored in a hardware register, and is used by the processor or processors within a computer system to locate a corresponding natural word stored in the computer system's memory hierarchy 131 , 137 , 139 , and 129 .
- the process by which a unit of physical memory corresponding to virtual address is located within physical memory is referred to as “virtual address translation,” and the stored information 109 that facilitates a particular virtual address translation is referred to as a “translation.”
- a virtual address 101 comprises a number of higher-order bits 103 that together compose a virtual page number, and a number of lower-order bits 105 that together compose a page offset.
- Computer-system hardware and a computer operating system together translate virtual addresses into physical addresses that directly identify a memory location corresponding to the virtual address. Mapping of virtual addresses to physical memory locations provides great flexibility to computer systems with regard to memory implementations. For example, a computer system may provide, through virtual addresses, a much larger process address space than could be accommodated, at a given instance in time, in the physical, random-access memory available within the computer system.
- Virtual memory pages can migrate from mass storage devices to physical memory and from physical memory to mass storage devices dynamically, as programs execute and access virtual memory.
- Virtual memory also allows a computer system to provide to each of numerous, concurrently running processors the illusion that each process enjoys private access to an entire virtual-memory address space, and may facilitate security measures, inter-process memory sharing, and provide additional types of benefits to computer operating systems and to computer users.
- a computer processor, computer-operating-system routine, or a combination of a processor and computer-operating-system software extract the virtual page number 103 from a virtual address stored within a register and use the virtual page number 107 to locate a corresponding entry 109 within a translation look-aside buffer 111 .
- the translation look-aside buffer (“TLB”) 111 stores most recently accessed virtual page translations to assist in virtual-address translation.
- the TLB is stored in specialized, high-speed TLB registers, and is backed up by a lower-speed virtual hash page table (“VHPT”), in turn backed up by translations stored on mass storage devices.
- VHPT virtual hash page table
- Each TLB entry such as TLB entry 109 , includes a virtual page number 113 , a corresponding physical page number 115 , many additional fields that may describe privilege level, access rights, protection keys, and other such information used by the operating system to control access to virtual memory pages, represented in FIG. 1 by spaces 117 and 119 , and a number of bit flags 121 - 125 .
- a bit flag referred to as a “present bit” (bit flag 125 in FIG. 1 ), indicates whether or not the virtual-memory page currently resides in physical memory.
- the present bit indicates that the virtual memory page corresponding to the TLB entry does not currently reside in physical memory
- a page fault occurs, and the operating system uses 127 the virtual page number 113 to locate the contents of the virtual page in mass storage 129 and copy the located virtual page into a location in physical memory, such as the L1 cache memory 131 , and updates the physical page number 115 to reflect the location in memory in which the contents of the virtual page has been copied from the mass storage 129 .
- the contents of the physical memory location corresponding to the virtual address may be directly accessed 133 by supplying the physical page number 115 and the page offset 105 to a memory subsystem 135 , which reads the contents of the physical address from, or writes a value to, the corresponding memory location in one of a tiered system of caches, including the L1 cache 131 , the L2 cache 137 , and main memory 139 .
- a tiered system of caches including the L1 cache 131 , the L2 cache 137 , and main memory 139 .
- an access-rights field in each TLB entry specifies the types of access allowed to the virtual memory page corresponding to the TLB entry.
- Access types include no access, read access, write access, execute access, and a privilege-promotion access used allow execution of operating system code using an enter-privileged-code instruction.
- the access rights field comprises 3 bits in the exemplary architecture, each of the 8 possible values specifying one or more access rights for each possible privilege level.
- the value of the access-rights field combined with the value of a 2-bit privilege-level field within the TLB entry, completely specifies the access rights available to a process running at each of four possible privilege levels.
- a computer system When an operating system or application program begins execution, or when additional memory is allocated for operating system or program use, a computer system commonly allocates a large number of virtual pages on behalf of the operating system or application program. In many cases, the operating system or application program expects that newly allocated virtual pages are initialized to a default value. The expected default value is commonly the value “0” for each byte within the newly allocated virtual memory page. In many currently available computer systems, the newly allocated virtual memory pages are fully instantiated, meaning that, when sufficient physical memory is available, a physical memory page corresponding to the virtual memory page is assigned for the virtual memory page and that the physical memory page is initialized to the default value.
- FIG. 2 illustrates allocation of five virtual memory pages on behalf of a process.
- physical pages 202 - 206 corresponding to five virtual memory pages are allocated in memory 210
- corresponding TLB entries 212 - 216 are placed into the TLB 218
- the physical pages 202 - 206 are initialized to contain a default value.
- virtual memory pages are either immediately initialized, under program control, as part of the virtual-page allocation process, or selected from a pool of pre-initialized pages that are zeroed or otherwise initialized in a background, operating-system process.
- initialization of the virtual-memory pages is computationally expensive, and may involve significant time delays for nascent processes or for processes allocating additional memory resources prior to undertaking a particular task.
- a greater number of virtual memory pages are allocated than actually needed by a process, and allocated virtual-memory pages may never be written to, but only read from, or may never be accessed during the life of a process.
- Various embodiments of the present invention provide for immediate allocation of virtual memory on behalf of processes running within a computer system.
- One or more bit flags within each translation indicate whether or not a corresponding virtual memory page is immediate.
- READ access to immediate virtual memory is satisfied by hardware-supplied or software-supplied values.
- WRITE access to immediate virtual memory raises an exception to allow an operating system to allocate physical memory for storing values written to the immediate virtual memory by the WRITE access.
- FIG. 1 illustrates generalized virtual-to-physical-address translation employed in a wide variety of modem computer systems, and implemented in a wide variety of currently available computer operating systems.
- FIG. 2 illustrates allocation of five virtual memory pages on behalf of a process.
- FIG. 3 shows a logical mechanism embodied in processor logic for implementing uninstantiated virtual memory pages according to one embodiment.
- FIG. 4 illustrates an extension of immediate virtual memory to provide an arbitrary number of different default initializations according to one embodiment.
- FIG. 5 illustrates logical-circuit components within a processor needed to implement immediate virtual memory according to one embodiment.
- Embodiments of the present invention provide immediate virtual memory in a computer system.
- Immediate virtual memory is represented, in the computer system, by virtual-memory-to-physical-memory translations with one or more bit flags, each set to one of two binary values.
- an immediate bit flag with the binary value “1” indicates that the virtual memory specified by the translation is immediate
- an immediate bit flag with the binary value “0” indicates that normal virtual address translation and subsequent physical memory access, as described previously, proceeds.
- An opposite bit-flag-value convention may be employed in alternative embodiments.
- FIG. 3 shows a logical mechanism embodied in processor logic for implementing uninstantiated virtual memory pages.
- This mechanism may be employed in the exemplary processor used as a basis for describing embodiments of the present invention, and may be suitably modified for use in different system and processor architectures.
- each translation such as translation 302
- each translation includes an immediate bit flag 304 .
- the immediate bit flags for all the translations shown in FIG. 3 form a column of bit flags 306 .
- the virtual-to-physical-address-translation process is modified, as shown in FIG. 3 , to accommodate immediate virtual memory pages.
- a virtual address stored in a hardware register 308 is accessed by processor logic for virtual-to-physical-address translation.
- the virtual page number 310 is extracted from the register 308 and used to locate the translation 302 corresponding to the virtual page number.
- hashing logic within the processor is employed to hash the virtual page number into a TLB entry location. If a matching translation is not found, a TLB-miss fault occurs, which allows the operating system to find the corresponding TLB entry in the VHPT or other, similar operating-system-managed, memory-resident data structures and, if need be, in mass-storage space managed by the operating system.
- the processor logic determines, in logic step 312 , whether or not the memory is immediate by considering the value of the immediate bit flag. If the virtual memory page is not immediate, as determined in logic step 312 , then the processor logic translates the address and accesses the physical memory normally.
- logic step 316 the processor logic determines whether or not the virtual address is being accessed for a WRITE operation. If so, then control flows to logic step 318 , where the processor logic raises an exception, which may be either a normal access rights exception, or may be a new exception for writing to immediate virtual memory.
- the exception is handled by the operating system, which allocates a physical memory page corresponding to the virtual memory page containing the virtual address and programmatically initializes the newly allocated physical memory page, or obtains a zero-filled page from a specially maintained pool of free, zero-filled pages.
- a common default initialization value is “0” for all bytes within a newly allocated page.
- processor logic may return the hardware-specified or software-specified value.
- One method for returning the hardware-specified or software-specified value is to logically generate the hardware-specified or software-specified value under logic-circuit control.
- logic circuits are straightforwardly implemented to return a zeroed natural computer word.
- the processor may return the value stored in a specified register. In other words, if a read operation directs copying of the contents of a virtually addressed word to a register, processor logic can simply copy the contents of the specified register to the target register.
- Generation of hardware-specified or software-specified values under logic-circuit control, or copying of hardware-specified or software-specified value from specified registers are preferred methods with respect to speed of access, since stored values need not be accessed through the memory hierarchy.
- zeroed virtual memory pages are the most commonly employed initialized virtual memory pages
- other initializations may be desirable. For example, in certain systems, initializing all bits within a virtual memory page to the binary value “1” may be desirable for certain applications.
- many testing and simulation applications require a series of randomly generated numbers.
- simulation and testing programs commonly employ pseudo-random numbers generated by complex software routines. It is, however, fairly straightforward to generate truly random numbers by selecting random numbers from electronic noise generated by logic circuits or obtained from signal lines interconnected to various processor subsystems. It is therefore possible for processor logic to use truly random numbers obtained from electronic noise for initializing virtual memory pages. Testing and simulation applications can therefore obtain sequences of truly random numbers by simply reading numbers from newly allocated, immediate virtual memory pages.
- random-number-containing immediate virtual memory pages are read-only pages, and an attempted WRITE access to such a page generates an exception.
- WRITE access would invoke the above described deferred physical memory allocation, and would result in an initially randon-number-filled page overwritten by the WRITE access.
- Additional types of initialization may also be desirable. For example, it may be desirable to initialize all bytes within a virtual memory page to the binary value “0010.” Alternatively, more complex default initializations may be desirable for particular types of applications. For example, complex numeric patterns may be generated algorithmically, in response to various stored parameters, environmental variables, and other such inputs.
- FIG. 4 illustrates an extension of immediate virtual memory to provide an arbitrary number of different default initializations.
- a number of immediate bit flags 402 may be employed within each TLB entry.
- the first immediate bit flag U 1 404 may be used to indicate whether or not the corresponding virtual memory page is immediate, in the manner of the immediate bit flag discussed with reference to FIG. 3 .
- the remaining three immediate bit flags, U 2 , U 3 , and U 4 406 - 408 may be used to contain a value specifying a particular type of initialization.
- the three additional immediate bit flags are used to specify one of eight different types of default initialization, including an all-zero initialization 410 , an all binary value “1” initialization 412 , initialization with random numbers generated from electronic noise 414 , initialization of each byte to the binary value “0010” 416 , and other such default initializations 418 - 421 .
- the logic shown in FIG. 4 is used to specify one of eight different types of default initialization, including an all-zero initialization 410 , an all binary value “1” initialization 412 , initialization with random numbers generated from electronic noise 414 , initialization of each byte to the binary value “0010” 416 , and other such default initializations 418 - 421 .
- 3 may be simply extended to provide for the operating system, in logic step 318 , examining the additional immediate bit flags to determine how to initialize a physical page in response to an immediate page exception, and by including logic circuits or special default registers for generating each of the different types of default initializations and selecting the appropriate default initialization value to return, in logic step 320 , upon READ access to a virtual address within an uninstantiated virtual memory page.
- a single immediate virtual memory page bit flag may be employed to defer allocation and initialization of virtual memory pages until the virtual memory pages are accessed for write operations, at which point the operating system allocates and initializes the virtual memory pages to a single default initialization value.
- Alternate embodiments employ different default initialization values.
- a plurality of immediate bit flags are employed within each TLB entry to specify one of a number of different possible initializations, including a variety of different bit patterns or truly random numbers generated from electronic noise.
- FIG. 5 illustrates logical-circuit components within a processor needed to implement immediate virtual memory.
- the logic circuits include the logic shown in FIG. 3 included within a translation module 502 , a TLB 504 containing TLB entries that include one or more immediate bit flags, as discussed above, and a multiplexer (“MUX”) 506 controlled by the translation module to return a value corresponding to a supplied virtual address 508 either from the memory subsystem 510 or from an immediate-virtual-memory-page-value generator 512 .
- MUX multiplexer
- logic within the translation module 502 controls the MUX to return a value generated by the immediate-virtual-memory-page-value generator 512 . Otherwise, logic within the translation module 502 controls the multiplexor 506 to return a value fetched from the memory system by the memory subsystem 510 .
- logic within the translation module needs to supply a physical page number to the memory subsystem 510 , in the case of translating an immediate virtual address, and to supply an indication of the type of initialization to the immediate-virtual-memory-page-value generator 512 when more than one type of initialization is possible.
- the particular initialization used may be controlled programmatically by processes through operating system-memory allocation calls, may be specified by the operating system based on the identity of the process and the time and location of the allocated memory, among other considerations, or may be specified in other manners.
- the operating system in handling immediate-virtual-memory-page exceptions, needs to initialize newly allocated physical pages corresponding to virtual memory pages in a manner identical to the generation of values by the immediate-virtual-memory-page-value generator 512 .
- the initialization values may be generated by logic circuits, may be initially generated and placed into special initialization registers during system boot or operating-system initialization, or virtual addresses for immediate virtual memory pages may be mapped to special, already initialized default-valued physical pages within the memory hierarchy.
- the present invention may be incorporated into any number of different computer architectures and computer-operating-system architectures.
- existing processor registers, faults, and exceptions may be used, with slight changes to firmware, in order to implement uninstantiated virtual memory pages, while for other processor architectures, a more substantial change may be required.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
Description
Claims (31)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/768,306 US7313668B2 (en) | 2004-01-29 | 2004-01-29 | Immediate virtual memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US10/768,306 US7313668B2 (en) | 2004-01-29 | 2004-01-29 | Immediate virtual memory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| US20050172098A1 US20050172098A1 (en) | 2005-08-04 |
| US7313668B2 true US7313668B2 (en) | 2007-12-25 |
Family
ID=34807841
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US10/768,306 Expired - Lifetime US7313668B2 (en) | 2004-01-29 | 2004-01-29 | Immediate virtual memory |
Country Status (1)
| Country | Link |
|---|---|
| US (1) | US7313668B2 (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070150659A1 (en) * | 2005-12-22 | 2007-06-28 | International Business Machines Corporation | Cache injection semi-synchronous memory copy operation |
| US20080235372A1 (en) * | 2003-12-12 | 2008-09-25 | Reiner Sailer | Method and system for measuring status and state of remotely executing programs |
| US20090182968A1 (en) * | 2005-12-22 | 2009-07-16 | International Business Machines Corp. | Validity of address ranges used in semi-synchronous memory copy operations |
| US20120278562A1 (en) * | 2011-04-27 | 2012-11-01 | Veris Industries, Llc | Branch circuit monitor with paging register |
| US9146264B2 (en) | 2011-02-25 | 2015-09-29 | Veris Industries, Llc | Current meter with on board memory |
| US9250308B2 (en) | 2011-06-03 | 2016-02-02 | Veris Industries, Llc | Simplified energy meter configuration |
| US10006948B2 (en) | 2011-02-25 | 2018-06-26 | Veris Industries, Llc | Current meter with voltage awareness |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7636831B1 (en) * | 2006-03-31 | 2009-12-22 | Vmware, Inc. | Optimization of reverse mappings for immutable guest physical pages of virtual memories in a virtualized computer system |
| US20120167122A1 (en) * | 2010-12-27 | 2012-06-28 | Nokia Corporation | Method and apparatus for pre-initializing application rendering processes |
| US9384711B2 (en) | 2012-02-15 | 2016-07-05 | Microsoft Technology Licensing, Llc | Speculative render ahead and caching in multiple passes |
| US9286122B2 (en) * | 2012-05-31 | 2016-03-15 | Microsoft Technology Licensing, Llc | Display techniques using virtual surface allocation |
| US9230517B2 (en) | 2012-05-31 | 2016-01-05 | Microsoft Technology Licensing, Llc | Virtual surface gutters |
| US9235925B2 (en) | 2012-05-31 | 2016-01-12 | Microsoft Technology Licensing, Llc | Virtual surface rendering |
| US9177533B2 (en) | 2012-05-31 | 2015-11-03 | Microsoft Technology Licensing, Llc | Virtual surface compaction |
| CN102902629B (en) * | 2012-06-20 | 2016-06-22 | 华为技术有限公司 | memory space mapping method and device |
| US9307007B2 (en) | 2013-06-14 | 2016-04-05 | Microsoft Technology Licensing, Llc | Content pre-render and pre-fetch techniques |
| US9223503B2 (en) * | 2013-09-27 | 2015-12-29 | Intel Corporation | Generating random numbers utilizing entropic nature of NAND flash memory medium |
| EP3058457A4 (en) * | 2013-10-15 | 2017-07-12 | Mill Computing, Inc. | Computer processor with deferred operations |
| US9459900B2 (en) * | 2014-01-13 | 2016-10-04 | Red Hat Israel, Ltd. | Hypervisor-based balloon page initialization |
| US9478274B1 (en) * | 2014-05-28 | 2016-10-25 | Emc Corporation | Methods and apparatus for multiple memory maps and multiple page caches in tiered memory |
| US9535844B1 (en) | 2014-06-30 | 2017-01-03 | EMC IP Holding Company LLC | Prioritization for cache systems |
| US10235054B1 (en) | 2014-12-09 | 2019-03-19 | EMC IP Holding Company LLC | System and method utilizing a cache free list and first and second page caches managed as a single cache in an exclusive manner |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6857041B2 (en) * | 2002-03-29 | 2005-02-15 | Intel Corporation | Method and apparatus providing an interface to allow physical memory to be initialized using firmware/hardware methods |
-
2004
- 2004-01-29 US US10/768,306 patent/US7313668B2/en not_active Expired - Lifetime
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6857041B2 (en) * | 2002-03-29 | 2005-02-15 | Intel Corporation | Method and apparatus providing an interface to allow physical memory to be initialized using firmware/hardware methods |
Non-Patent Citations (7)
| Title |
|---|
| Microsoft Developer Network Library-Win32 Software Developement Kit, Jul. 1996. * |
| Nakhimovsky, Greg, "Virtual Memory Arrays for Application Software", (C) Mar. 2003, Sun Microsystems, Inc., pp. 1-11. * |
| Popov, Petko, "Inflable Arrays in Win32", Sep. 21, 2001 accessed at <http://www.codeguru.com/cpp/cpp/cpp<SUB>-</SUB>mfc/buffers/print.php/c4113/> on Feb 6, 2006. * |
| Sloane, Tony, "Two's Complement", May 9, 1996 accessed at <http://www.cs.jcu.edu.au/Subjects/cp1200/1996/org/node9.html on Feb. 14, 2006. * |
| Solomon, David A., "Inside Windows NT", 1998, Microsoft Press, 2nd Edition, pp. 219-220, 246-247, 256-259, 261-262, 265-267, 273-275. * |
| Tanenbaum, Andrew S., "Structured Computer Organization", 1984, Prentice-Ahll, Inc., 2nd Edition, pp. 10-12. * |
| Wemm, Peter, "Re: Meaning of 'Page Faults with Physical IO'?", Aug. 15, 1997 accessed at <http://www.squid-cache.org/mail-archive/squid-users/199708/0124.html> on Feb 8, 2006. * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080235372A1 (en) * | 2003-12-12 | 2008-09-25 | Reiner Sailer | Method and system for measuring status and state of remotely executing programs |
| US7882221B2 (en) * | 2003-12-12 | 2011-02-01 | International Business Machines Corporation | Method and system for measuring status and state of remotely executing programs |
| US20070150659A1 (en) * | 2005-12-22 | 2007-06-28 | International Business Machines Corporation | Cache injection semi-synchronous memory copy operation |
| US7484062B2 (en) * | 2005-12-22 | 2009-01-27 | International Business Machines Corporation | Cache injection semi-synchronous memory copy operation |
| US20090182968A1 (en) * | 2005-12-22 | 2009-07-16 | International Business Machines Corp. | Validity of address ranges used in semi-synchronous memory copy operations |
| US7882321B2 (en) * | 2005-12-22 | 2011-02-01 | International Business Machines Corporation | Validity of address ranges used in semi-synchronous memory copy operations |
| US7890703B2 (en) * | 2005-12-22 | 2011-02-15 | International Business Machines Corporation | Cache injection using semi-synchronous memory copy operation |
| US9146264B2 (en) | 2011-02-25 | 2015-09-29 | Veris Industries, Llc | Current meter with on board memory |
| US10006948B2 (en) | 2011-02-25 | 2018-06-26 | Veris Industries, Llc | Current meter with voltage awareness |
| US20120278562A1 (en) * | 2011-04-27 | 2012-11-01 | Veris Industries, Llc | Branch circuit monitor with paging register |
| US9329996B2 (en) * | 2011-04-27 | 2016-05-03 | Veris Industries, Llc | Branch circuit monitor with paging register |
| US9250308B2 (en) | 2011-06-03 | 2016-02-02 | Veris Industries, Llc | Simplified energy meter configuration |
Also Published As
| Publication number | Publication date |
|---|---|
| US20050172098A1 (en) | 2005-08-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7313668B2 (en) | Immediate virtual memory | |
| US10740249B2 (en) | Maintaining processor resources during architectural events | |
| CN113168379B (en) | Fast access to virtual machine memory backed by the host computer's virtual memory | |
| US7213125B2 (en) | Method for patching virtually aliased pages by a virtual-machine monitor | |
| US7278030B1 (en) | Virtualization system for computers having multiple protection mechanisms | |
| US8738889B2 (en) | Generating multiple address space identifiers per virtual machine to switch between protected micro-contexts | |
| US8127098B1 (en) | Virtualization of real mode execution | |
| US20060036830A1 (en) | Method for monitoring access to virtual memory pages | |
| US8549254B2 (en) | Using a translation lookaside buffer in a multiple stage memory address translation structure to manage protected microcontexts | |
| JP7397057B2 (en) | Binary search procedure for control tables stored in a memory system | |
| JP7291149B2 (en) | Controlling protection tag checking on memory accesses | |
| JP2022505011A (en) | Devices and methods for controlling memory access | |
| TW202036307A (en) | Page table structure | |
| KR20230017832A (en) | TAG checking device and method | |
| US6782446B2 (en) | Method to prevent corruption of page tables during flash EEPROM programming | |
| US20060026389A1 (en) | Method for providing scratch registers for use by a virtual-machine monitor | |
| CN111527480B (en) | Address translation in a data processing apparatus | |
| GB2239334A (en) | Communication between execution environments in a data processing system employing an object-oriented memory protection mechanism | |
| HK40050309A (en) | Faster access of virtual machine memory backed by a host computing device’s virtual memory | |
| HK1101436B (en) | Maintaining processor resources during architectural events |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AS | Assignment |
Owner name: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P., TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WORLEY, JOHN S.;REEL/FRAME:015625/0379 Effective date: 20040611 |
|
| STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
| CC | Certificate of correction | ||
| REMI | Maintenance fee reminder mailed | ||
| FPAY | Fee payment |
Year of fee payment: 4 |
|
| SULP | Surcharge for late payment | ||
| AS | Assignment |
Owner name: GOOGLE INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.;HEWLETT-PACKARD COMPANY;REEL/FRAME:027661/0258 Effective date: 20111025 |
|
| FPAY | Fee payment |
Year of fee payment: 8 |
|
| AS | Assignment |
Owner name: GOOGLE LLC, CALIFORNIA Free format text: CHANGE OF NAME;ASSIGNOR:GOOGLE INC.;REEL/FRAME:044127/0735 Effective date: 20170929 |
|
| MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |