Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F8/00—Arrangements for software engineering
  • G06F8/60—Software deployment
  • G06F8/65—Updates
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
  • G06F12/02—Addressing or allocation; Relocation
  • G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
  • G06F12/023—Free address space management
  • G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
  • G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory

Definitions

• the present invention relates to a method of storing a first version of a file in a first memory space.
• US 2006/0136548 Such a process is known from US 2006/0136548.
• This document describes a method of storing application software and data that are related to these applications in a memory of a terminal, for example a mobile phone.
• the method of document US 2006/0136548 provides, prior to transmission of application software to the memory of the mobile phone, the reservation of a memory space that corresponds to the size of the application software concerned. For example, if the application software is 10 KB in size, the placeholder will be 10 KB. However, if the application software is 40 KB, the placeholder will be 40 KB. The size of the reserved memory space is therefore equal to the size of the application software. Subsequently, the application software is saved in the reserved memory space.
• the memory of the mobile phone does not include enough space to allow the reservation, that is to say if for example the space available in the memory is only 20 KB, while the reservation must be 30 KB, the reservation can not be made and the application and its data will not be saved. If this is a new version of an application that needs to replace a current version, for example as part of an update of this application, this update will not be possible.
• An example is the update of a type of software called in English "firmware".
• the present invention therefore aims to remedy the disadvantage mentioned above by providing a method for better management of space in a memory with a low storage capacity, such as that which is generally provided with a mobile phone.
• a method according to the introductory paragraph is characterized in that it further comprises:
• the method is characterized in that it further comprises
• This step ensures that the process will not be triggered if it can not be performed physically, that is to say, for lack of available space in the memory space.
• the method is characterized in that said transmission step comprises a choice of data according to a label previously assigned to said data.
• This memory could be found for example on a temporary storage server outside control by the user.
• the user will prevent a third party having access to the storage server can access the data deemed sensitive by him.
• the temporary storage server will fail during the process, it will have no detrimental consequence for this data.
• the invention also relates to a device that can be used in a method of storing a first version of a file in a first memory space, characterized in that the device furthermore comprises:
• the invention also relates to a communication device comprising a first memory space comprising a second version of a file characterized in that the device further comprises:
• the invention also relates to a computer program comprising program code instructions for executing at least one of the steps of a method as described above, when said program is executed on a computer.
• the invention also relates to a data carrier including a program as described above.
• FIG. 1 is a diagram illustrating a drawback of the prior art in detail
• FIG. 2 is a diagram illustrating the invention
• FIG. 3 is a timing diagram illustrating the steps according to the invention.
• Figure 1 shows schematically a memory space 1 1, which can be in a terminal for example a mobile phone.
• the memory space 11 comprises an occupied part (up to the line referenced 1 15: hatched area) and an unoccupied or free part (referenced 19: non-hatched area).
• occupied part are stored software applications and data, collectively referred to below with the word "files".
• file 13 In the occupied part of the memory space 1 1 is a current version of a file 13 which occupies the space 1 1 to the line referenced 15.
• the file 13 may for example be a "firmware".
• Other files occupy the memory space 1 1 between line 15 and line 1.
• Each file includes an identifier which makes it possible to distinguish between the files and their associated data.
• a memory 1 1 1 for example a hard disk of a content server where there is a new version 1 13 of the file 13.
• a memory management software tries to reserve the necessary space. In the memory space 1 1, there is still the unoccupied portion 19.
• a quantity of the additional space shown between the lines 1 and 15 will be necessary. This quantity is already occupied.
• the management software finds that the necessary quantity is no longer available in the memory space 1 1, the transmission of the new version will not be performed.
• FIG. 2 is further shown a memory 21 for example another hard disk being on for example a temporary storage server.
• a memory 21 for example another hard disk being on for example a temporary storage server.
• the quantity of the memory space occupied by the memory space between the lines 1 and 17 is transmitted to the memory and stored therein as a file 23.
• the space between the line 1 15 and the line 17 becomes available for the transmission of the new version 1 13 of the file 13 from the space memory 1 1 1.
• the management software will then release this quantity into the memory space 11.
• the current version of the file 13 in the memory space 1 1 will be replaced by the new version 1 13.
• the space between the line 17 and the line 1 15 can be used again.
• the file 23 will be retransmitted from the server 21 to the memory 11 in this free space.
• FIG. 3 a terminal 31 is shown where the memory 1 1 is located, a temporary storage server 33 where the memory 21 is located and a content server 35 where is the memory 1 1 1.
• the method begins with a request 37 from a terminal 31 to the first server 35 for sending a new version of a file. This request will contain an identifier that allows the server 35 to know the file concerned. Then, during a transmission step 39, the size of a free memory space required for receiving the new version of said file so that the first terminal 31 can receive it will be transmitted from the first server 35 to said terminal 31.
• the memory space 1 1 of the terminal 31 comprises a occupied part and an unoccupied part.
• a quantity of the data in the occupied part (hatched area in FIG. 2) of the memory space 11 is transmitted from the memory 1 1 to a second server 33.
• This quantity will be at least equal to the difference between the size of the new version of the file and the size of the unoccupied part (non-hatched area in Figure 2) of the memory space 11.
• this quantity must not be chosen from the memory space occupied by the current version of the file 13 if the file 13 is necessary for the operation of the terminal 31, for example in the case where the file 13 is a "firmware" and the process is used to update this "firmware".
• this quantity can be chosen from the memory space occupied by other files: the memory space between line 15 and line 1 in FIG. 2.
• An example to illustrate the previous one - if the non-part occupied the memory space 1 1 includes 80 KB but the new version of the file has a size of 130 KB, at least a quantity of the occupied memory space of 130 - 80 50 KB will have to be transmitted to the second server 33.
• a quantity of 50 KB will be released and becomes available in the memory space 1 1 of the terminal 31 to accommodate the new version of the file 13 in full.
• the new version is transmitted from said first server 35 to said part thus released and a priori unoccupied, that is to say not used for the moment.
• the terminal memory can actually receive the new version and the current version of the file at the same time, i.e., the memory size is large enough to receive both versions simultaneously.
• all the files present in the memory will be provided with a numeric or textual or alphanumeric identifier, for example "secret” or "personal”, when their recording in the memory.
• a user Before the transmission step 31 1, a user can decide that he wants only files labeled "personal” to be transmitted to the memory 21 of the temporary storage server. And especially not the files labeled "secret”.

Landscapes

• Engineering & Computer Science (AREA)
• Software Systems (AREA)
• General Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Computer Security & Cryptography (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Stored Programmes (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=38786142

Family Applications (1)

Country Status (3)

Families Citing this family (3)

Family Cites Families (8)

• 2008
  • 2008-06-25 US US12/666,896 patent/US20100145906A1/en not_active Abandoned
  • 2008-06-25 EP EP08806085A patent/EP2162821A1/de not_active Withdrawn
  • 2008-06-25 WO PCT/FR2008/051154 patent/WO2009004266A1/fr active Application Filing

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events