Reformulating resources with nodes reachable from defined entry points
First Claim
Patent Images
1. A method comprising:
- receiving a distribution list comprising two or more shared resources, and two or more classified entry points into the shared resources;
for each classified entry point, identifying a graph of nodes and edges reachable within the shared resources;
creating a new first order resource comprising nodes reachable from first order classified entry points;
creating a new second order resource comprising nodes reachable from second order classified entry points and not reachable from first order classified entry points; and
creating dependency relations for nodes in the first resource depended on by nodes in the second resource.
2 Assignments
0 Petitions
Accused Products
Abstract
Historically, resources (e.g., dynamic linked libraries) were organized based on factors including the expertise of development teams. Unfortunately, this creates shared resources of much greater functionality than required by any one client application. By reformulating shared resources according to the nodes reachable from a set of defined entry points, the reformulated resources will contain nodes of relevance. This optimization reduces memory requirements which is useful for embedded systems and for reducing disk accesses.
-
Citations
26 Claims
-
1. A method comprising:
-
receiving a distribution list comprising two or more shared resources, and two or more classified entry points into the shared resources;
for each classified entry point, identifying a graph of nodes and edges reachable within the shared resources;
creating a new first order resource comprising nodes reachable from first order classified entry points;
creating a new second order resource comprising nodes reachable from second order classified entry points and not reachable from first order classified entry points; and
creating dependency relations for nodes in the first resource depended on by nodes in the second resource. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of reformulating compiled resources comprising:
-
receiving a distribution list;
converting resources in the distribution list into an internal representation;
merging the internal representations into an integrated representation;
from classified entry points in the distribution list, coloring reachable nodes in the integrated representation with a classification of a color classification of a highest order entry point that reaches a node;
create new resources for each color classification;
inject colored nodes into a new resource of its corresponding color;
inject imports into new resources when nodes of the new resource depend on nodes of a color classification of a higher order; and
inject exports into new resources when nodes of the new resource are depended on by nodes of a color classification of a lower order. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A computer system comprising:
-
a CPU coupled to main memory and secondary memory; and
the memory comprising a node identifier, a resource reformulator, a dependency redirector, plural shared resources, and a distribution list;
wherein the distribution list comprises a list of classified entry points, each entry points associated with a new shared resource name, and each entry point represents a graph of reachable nodes in the shared resources. - View Dependent Claims (15, 16)
-
-
17. A computer-readable medium having executable instructions for performing a method comprising:
-
receiving a distribution list comprising two or more shared resources, and two or more classified entry points into the shared resources;
for each classified entry point, identifying a graph of nodes and edges reachable within the shared resources;
creating a new first order resource comprising nodes reachable from first order classified entry points;
creating a new second order resource comprising nodes reachable from second order classified entry points and not reachable from first order classified entry points; and
creating dependency relations for nodes in the first resource depended on by nodes in the second resource. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. A method of reformulating compiled resources comprising:
-
displaying a list of application programming interfaces available for accessing shared resources;
receiving selections of application programming interfaces;
converting selections into a distribution list;
creating an internal representation of nodes reachable from entry points in the distribution list; and
creating a new resource comprising the internal representation.
-
-
26. A method of reformulating compiled resources comprising:
-
displaying a list of application programming interfaces available for accessing shared resources;
receiving selections of application programming interfaces, wherein selections include classifications;
converting selections and classifications into a distribution list;
creating an internal representation of nodes reachable from entry points in the distribution list;
coloring reachable nodes in the integrated representation with a color classification of a highest order classified entry point that reaches a node;
creating a new resources for each color classification;
injecting colored nodes into a new resource of its corresponding color;
injecting imports into new resources when nodes of the new resource depend on nodes of a color classification of a higher order; and
injecting exports into new resources when nodes of the new resource are depended on by nodes of a color classification of a lower order.
-
Specification