Data storage method and method for executing an application with reduced access time to the stored data
AssigneeBull SAS
InventorsPhilippe COUVEE, Simon DERR, Antoine PERCHER
Life of this patent
Estimating the term…
Loading patent…
AssigneeBull SAS
InventorsPhilippe COUVEE, Simon DERR, Antoine PERCHER
Estimating the term…
The invention concerns a storage method for storing, on data servers (3, 4), data file (5, 61 to 64) slices (51 to 58) from the execution of a plurality of processes (65 to 68) of one or more applications (83, 85), comprising: distributing the stored data file (5, 61 to 64) slices (51 to 58) over different data servers (3, 4), characterized in that: this distribution is carried out in such a way that the data file (5, 61 to 64) slices (51 to 58) likely to be subsequently accessed simultaneously by different application (83, 85) processes (65 to 68) are stored on different data servers (3, 4) so as to reduce the subsequent access, to each of all or part of these data servers (3, 4) by too many application (83, 85) processes (65 to 68) simultaneously, and in that: the determination of the data file (5, 61 to 64) slices (51 to 58) likely to be subsequently accessed simultaneously by different application (83, 85) processes (65 to 68) has been carried out, during a prior phase of executing these application (83, 85) processes (65 to 68), by observing the behavior of these application (83, 85) processes (65 to 68) in order to access these stored data file (5, 61 to 64) slices (51 to 58) over time.
A storage method for storing, on data servers (3, 4), data file (5, 61 to 64) slices (51 to 58) from the execution of several processes (65 to 68) of one or more applications (83, 85), comprising:
A method for executing several processes (65 to 68) of one or more applications (83, 85), comprising:
A storage method for storing, on data servers (3, 4), data from the execution of several processes (65 to 68), comprising:
(canceled)
Dependencies are inferred from the claim text.