Implementation of memory access control using optimization
First Claim
Patent Images
1. A computer-readable medium encoded with computer-executable instructions to perform a method, the method comprising:
- storing information regarding a directed labeled graph that comprises a plurality of vertices and a plurality of labeled edges connecting the vertices, each edge being defined by an ordered pair of the vertices and a label;
performing a first operation that changes said graph by removing or adding a vertex, removing or adding an edge, or changing the label of an edge;
updating said information to reflect the change to said graph; and
determining whether a second operation may be performed based at least in part on said information.
1 Assignment
0 Petitions
Accused Products
Abstract
Mechanisms are disclosed that may allow certain memory access control algorithms to be implemented efficiently. When memory access control is based on controlling changes to an address translation map (or set of maps), it may be necessary to determine whether a particular map change would allow memory to be accessed in an impermissible way. Certain data about the map may be cached in order to allow the determination to be made more efficiently than performing an evaluation of the entire map.
-
Citations
11 Claims
-
1. A computer-readable medium encoded with computer-executable instructions to perform a method, the method comprising:
-
storing information regarding a directed labeled graph that comprises a plurality of vertices and a plurality of labeled edges connecting the vertices, each edge being defined by an ordered pair of the vertices and a label;
performing a first operation that changes said graph by removing or adding a vertex, removing or adding an edge, or changing the label of an edge;
updating said information to reflect the change to said graph; and
determining whether a second operation may be performed based at least in part on said information. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification