Ordering program data for loading on a device
First Claim
Patent Images
1. A method for optimized loading of program data on a device, the method comprising:
- receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
ordering said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
storing said ordered program.
2 Assignments
0 Petitions
Accused Products
Abstract
Optimized loading of program data on a device comprises receiving a program including multiple program units, at least one of which is a main program unit. A use graph of the program is obtained, where the root node of the use graph represents the joining of the root node to one or more nodes representing the at least one main program unit. The multiple program units are ordered based at least in part on a depth-first traversal of the use graph and the ordered program is communicated to the device.
71 Citations
75 Claims
-
1. A method for optimized loading of program data on a device, the method comprising:
-
receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
ordering said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
storing said ordered program. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for optimized loading of program data on a device, the method comprising:
-
step for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
step for obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
step for ordering said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
step for storing said ordered program. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit, the method comprising:
-
receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
ordering said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
storing said ordered program. - View Dependent Claims (18, 19, 20, 21, 22, 23, 24)
-
-
25. An apparatus for optimized loading of program data on a device, the apparatus comprising:
-
means for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
means for obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
means for ordering said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
means for storing said ordered program. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32)
-
-
33. An apparatus for optimized loading of program data on a device, the apparatus comprising:
-
a memory for storing said program data; and
an off-card installer configured to;
receive a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtain a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
order said at least one program unit within said program to create an ordered program, said ordering based at least in part on a depth-first traversal of said use graph; and
store said ordered program. - View Dependent Claims (34, 35, 36, 37, 38, 39, 40)
-
-
41. A method for optimized loading of program data on a device, the method comprising:
-
receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
determining an ordering for said at least one program unit within said program, said ordering based at least in part on a depth-first traversal of said use graph; and
communicating said program and said ordering to said device. - View Dependent Claims (42, 43, 44, 45, 46, 47)
-
-
48. A method for optimized loading of program data on a device, the method comprising:
-
step for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
step for obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
step for determining an ordering for said at least one program unit within said program, said ordering based at least in part on a depth-first traversal of said use graph; and
step for communicating said program and said ordering to said device. - View Dependent Claims (49, 50, 51, 52, 53, 54)
-
-
55. A program storage device readable by a machine, embodying a program of instructions executable by the machine to perform a method for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit, the method comprising:
-
receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
determining an ordering for said at least one program unit within said program, said ordering based at least in part on a depth-first traversal of said use graph; and
communicating said program and said ordering to said device. - View Dependent Claims (56, 57, 58, 59, 60, 61)
-
-
62. An apparatus for optimized loading of program data on a device, the apparatus comprising:
-
means for receiving a program comprising at least one program unit, said at least one program unit including at least one main program unit;
means for obtaining a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
means for determining an ordering for said at least one program unit within said program, said ordering based at least in part on a depth-first traversal of said use graph; and
means for communicating said program and said ordering to said device. - View Dependent Claims (63, 64, 65, 66, 67, 68)
-
-
69. An apparatus for optimized loading of program data on a device, the apparatus comprising:
-
a memory for storing said program data; and
an off-card installer configured to;
receive a program comprising at least one program unit, said at least one program unit including at least one main program unit;
obtain a use graph of said program, said use graph comprising a plurality of nodes, each node representing one of said at least one program unit, said plurality of nodes further comprising a root node representing a main program unit if said program comprises one main program unit, said root node representing a parent node for each of a plurality of main program units if said program comprises a plurality of main program units;
determine an ordering for said at least one program unit within said program, said ordering based at least in part on a depth-first traversal of said use graph; and
communicate said program and said ordering to said device. - View Dependent Claims (70, 71, 72, 73, 74, 75)
-
Specification