US 7,594,090 B2
Efficient data storage
Ponnappa Palecanda, Roseville, Calif. (US)
Assigned to Hewlett-Packard Development Company, L.P., Houston, Tex. (US)
Filed on Jul. 18, 2005, as Appl. No. 11/184,295.
Prior Publication US 2007/0016752 A1, Jan. 18, 2007
Int. Cl. G06F 12/00 (2006.01)
U.S. Cl. 711—171  [707/101] 18 Claims
OG exemplary drawing
 
1. A method comprising:
receiving an allowable maximum value for each of a plurality of variables of a data structure resulting in a plurality of allowable maximum values, each of said plurality of variables to be stored by a network router;
after said receiving, determining a minimal bit number that can represent each of said plurality of allowable maximum values resulting in a plurality of minimal bit numbers;
after said determining, adding together each of said plurality of minimal bit numbers to generate a total of said plurality of minimal bit numbers;
after said adding, determining a minimum amount of memory of said network router for storing said total of said plurality of minimal bit numbers;
after said determining a minimum amount of memory, allocating said minimum amount of memory of said network router; and
after said allocating, determining where to store each of said plurality of variables within said minimum amount of allocated memory of said network router, said determining where to store involving utilizing a compression technique for data storage;
wherein each variable of said plurality of variables is associated with a first module and a second module that enable a software application to interact with said minimum amount of allocated memory of said network router.