Privelege level changing for virtual memory mapping

Electrical computers and digital processing systems: virtual mac – Task management or control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S002000, C711S006000, C713S166000, C712S220000

Reexamination Certificate

active

07543293

ABSTRACT:
Described is a system and method whereby processes may have multiple memory maps associated therewith to provide curtained memory and overcome other memory-related problems. Multiple maps are used to restrict memory access of existing code such as drivers, without changing that code, and without changing existing microprocessors. A thread of a process is associated with one memory map at a time, which by mapping to different memory locations, provides memory isolation without requiring a process switch. Memory isolation may be combined with controlled, closed memory map switching performed only by trusted code, to ensure that some protected memory is inaccessible to all but the trusted code (curtained memory). For example, the threads of the process may ordinarily run at one privilege level with a restricted map, with map switching is only allowed at a higher privilege level. As the threads run through code, the map may be appropriately changed on entering and leaving the trusted code, thus controlling what memory addresses are accessible based on what code is currently being executed. Map switching among multiple maps eliminates the need to change a process in order to access different memory, thereby allowing expanded memory addressing in a single process and isolating untrusted code run in process from certain memory of that process.

REFERENCES:
patent: 4519032 (1985-05-01), Mendell
patent: 4918653 (1990-04-01), Johri et al.
patent: 5727211 (1998-03-01), Gulsen
patent: 5729710 (1998-03-01), Magee et al.
patent: 6055617 (2000-04-01), Kingsbury
patent: 6304973 (2001-10-01), Williams
patent: 6393556 (2002-05-01), Arora
patent: 7216345 (2007-05-01), Porter
patent: 2311152 (1997-09-01), None
Frailey et al. “Software Support for Modern Microprocessor Memory Systems.” Midcon Midwest Electron Show Dec. 12-14, 1978, pp. 1-15.
Blumrich, et al. “Virtual-Memory-Mapped Network Interfaces.” Feb. 1995 IEEE Micro, pp. 21-28.
Tanner, Daniel J. “Clearing Up The Confusion: Virtual vs. Mapped Memory.” Computer Design, Oct. 1976, pp. 101-105.
Teller, et al. “Locating Multiprocessor TLBs at Memory.” Proceedings of 27thHawaii International Conference of Systems Sciences, Jan. 4-7, 1994, pp. 554-563.
Sznyter, et al. “A New Virtual-Memory Implementation for UNIX.” Usenix Association Summer Conference Proceedings, Jun. 9-13, 1986, pp. 81-92.
Baskett, F. “Pascal and Virtual Memory in a Z8000 or MC6800 Based Design Station.” Compcon '80 VLSI: New Architectural Horizons, Feb. 25-28, 1980, pp. 25-28.
Hulme, B.B. “Memory Management with the Z80000 Microprocessor.” Midcon Conference, Sep. 1-17, 1987, pp. 86-91.
Kaplinsky, Cecil. “Memory Access Paths: Hierarchies and Protection.” Wescon Conference 1984, pp. 1-7.
Kotz et al. “The Expected Lifetime of Single-Address-Space: Operating Systems.” Sigmetrics 94, pp. 161-170.
Kuei et al. “Efficient Index Generation for Compiling Two-Level Mappings in Data-Parallel Programs.” Journal of Parallel and Distributed Computing, vol. 60, No. 2; Feb. 2000, pp. 189-216.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Privelege level changing for virtual memory mapping does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Privelege level changing for virtual memory mapping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Privelege level changing for virtual memory mapping will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4054781

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.