METHOD FOR DIGITAL STORAGE OF DATA ON A DATA MEMORY WITH LIMITED AVAILABLE STORAGE SPACE

• US 20080244201A1
• Filed: 03/28/2008
• Published: 10/02/2008
• Est. Priority Date: 03/30/2007
• Status: Active Grant

• Current Assignee: Siemens It Solutions and Services GmbH (Atos SE)
• Original Assignee: Siemens It Solutions and Services GmbH (Atos SE)
• Inventors: Heintel, Markus, Hiob, Christian
• Granted Patent: US 8,078,811 B2
• Time in Patent Office: Days
• US Class Current: 711/158
• CPC Class Codes: G06F 16/10 File systems; File servers

Abstract

The most important data in a first memory of a data processing system are stored in a limited second data memory given upon a transfer thereof. The demarcation between important (and still storable) data on the one hand and less important (and therefore no longer storable) data is made dependent on the available storage volume (SV) of the target data memory. This achieves that an optimal amount of the most important data can be stored on the target data memory.

Claims

1. A method for storage of digital data, that are present in a first data memory of a data processing system, in a second data memory with limited available storage space, comprising the steps of:

establishing a division of said data in said first data memory into N data subsets;

organizing at least some of said N data subsets according to associated hierarchical priorities respectively associated with said at least some of said N data subsets;

executing a computerized search of said data in said first data memory in multiple steps to divide said at least some of said N data subsets into a first division set and a second division set according to a search criteria requiring that the priority of no data subset in the first division set is lower than the priority of any data subset in the second division set;

in each step of said computerized search, checking a storage space requirement of the first division set;

from said check, automatically determining a largest number Z of said data subsets that can be stored in the available storage space according to a determination criterion that the priority of no data subset that can be stored in the available storage space is less than the priority of any data subset that can no longer be stored in the available storage space; and

transferring said Z data subsets from said first data memory to said second data memory via a data interface between the first data memory and the second data memory.

2. A method as claimed in claim 1 comprising compressing at least a portion of the data in said first division set in each step of said computerized search before checking the storage space requirement of the second data memory, and transferring the Z data subsets from the first data memory to the second data memory in compressed form.

3. A method as claimed in claim 1 comprising conducting said computerized search as a binary search according to a division rule based on respective data volumes of the data subsets.

4. A method as claimed in claim 1 comprising, for any of said N data subsets that are not organized based on priority assigning each of those subsets an identical priority and including said data subsets with said identical priority in the determination of said Z data subsets.