Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; 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/0253—Garbage collection, i.e. reclamation of unreferenced memory
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; 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
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; 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/0253—Garbage collection, i.e. reclamation of unreferenced memory
  • G06F12/0269—Incremental or concurrent garbage collection, e.g. in real-time systems
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
  • G06F2212/17—Embedded application
  • G06F2212/177—Smart card
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
  • G06F2212/20—Employing a main memory using a specific memory technology
  • G06F2212/202—Non-volatile memory
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
  • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
  • G06F3/0601—Interfaces specially adapted for storage systems
  • G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
  • G06F3/0671—In-line storage system
  • G06F3/0673—Single storage device
  • G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
• • G—PHYSICS
  • G07—CHECKING-DEVICES
  • G07F—COIN-FREED OR LIKE APPARATUS
  • G07F7/00—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus
  • G07F7/08—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means
  • G07F7/10—Mechanisms actuated by objects other than coins to free or to actuate vending, hiring, coin or paper currency dispensing or refunding apparatus by coded identity card or credit card or other personal identification means together with a coded signal, e.g. in the form of personal identification information, like personal identification number [PIN] or biometric data
  • G07F7/1008—Active credit-cards provided with means to personalise their use, e.g. with PIN-introduction/comparison system

Definitions

• Embodiments of the invention are generally related to persistent memory storage, and are particularly related to resource-constrained environments and other computing environments, and to systems and methods for deleting non-reachable objects from persistent memory, using bitmap windows representing memory chunks. Background:
• a typical resource-constrained environment such as a smart card or similar execution environment or device, may have limited random access memory resources, and instead use persistent memory as a default location for creating and storing software objects.
• Such environments have a need for reclaiming persistent memory which is in use by objects that have become garbage by virtue of being nonreachable from a defined set of roots.
• Garbage collection algorithms which may be useful in other environments, such as Java SE, often rely on techniques such as moving or marking the objects directly.
• these techniques are not as useful in a resource-constrained, smart card, or similar execution environment, since moving or marking objects in persistent memory is a time-consuming, and potentially damaging, operation given that only a limited number of data writes can be made to a persistent memory device before it wears out.
• the system can generally be used with computing environments that use persistent memory, such as smart cards, Java Cards, and other resource-constrained environments.
• the system comprises a processor or computational engine and a persistent memory for storage of software objects; and a data structure which can include one or more memory bitmap windows, each of which represents a chunk of addressable space in the persistent memory; wherein the system uses the one or more memory bitmap windows in deleting non-reachable objects from the persistent memory.
• Figure 1 illustrates an example of a computing environment that uses persistent memory, such as a resource-constrained environment or smart card, in accordance with an embodiment.
• Figure 2 illustrates the use of bitmap windows representing memory chunks, for object deletion in persistent memory, in accordance with an embodiment.
• Figure 3 further illustrates the use of bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 4 further illustrates the use of bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 5 is a flowchart illustrating an algorithm or method of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 6 is a flowchart further illustrating an algorithm or method of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 7 is a flowchart further illustrating an algorithm or method of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment. Detailed Description:
• a typical resource-constrained environment such as a smart card or similar execution environment or device, may have limited random access memory resources, and instead use persistent memory as a default location for creating and storing software objects.
• Such environments have a need for reclaiming persistent memory which is in use by objects that have become garbage by virtue of being nonreachable from a defined set of roots.
• garbage collection algorithms which may be useful in other environments, but rely on techniques such as moving or marking the objects directly, are not as useful in a resource- constrained, smart card, or similar execution environment, since moving or marking objects in persistent memory is a time-consuming, and potentially damaging, operation given that only a limited number of data writes can be made to a persistent memory device before it wears out.
• Some examples of the types of approach that can be used to address this include: use of a brute force algorithm to check each object to determine if it is referenced from any other object in the system; use of a reference counting algorithm which updates objects with a reference count such that a reference count of 0 indicates that the object is not referenced by another; or use of a RAM bitmap representing objects in memory.
• a problem with the first two of these approaches is that they do not account for cyclical references for even simple cycles.
• the first approach is also time-consuming since in a worst-case scenario potentially every object in the system will have to be checked for every other object in the system, to determine references from one object to another.
• a problem with the third approach is that it relies on dereferencing objects, such that the system uses object references from an object table rather than actual address; however this slows the overall execution environment since many operations will require object addresses, and will have to go through the conversion process to get the address from a reference.
• the system can generally be used with computing environments that use persistent memory, such as smart cards, Java Cards, and other resource-constrained environments.
• the system comprises a processor or computational engine and a persistent memory for storage of software objects; and a data structure which can include one or more memory bitmap windows, each of which represents a chunk of addressable space in the persistent memory; wherein the system uses the one or more memory bitmap windows in deleting non-reachable objects from the persistent memory.
• some advantages of the systems and methods described herein include that it can provide a fast version of mark-sweep garbage collection technique which addresses the cyclical referencing problem; that there is no need for dereferencing objects; that there is also no need to write to persistent memory until actual reclamation of memory; and that the approach is scaleable such that an increase in the overall target memory area does not increase resource requirements.
• Figure 1 illustrates an example of a computing environment that uses persistent memory, such as a resource-constrained environment or smart card, in accordance with an embodiment.
• a computing environment or device 100 such as a resource-constrained environment, smart card, or other environment, can be considered a miniature computing device, comprising a processor or computational engine 126, which can include circuitry for performing computational operations; and one or more memory, such as a random access memory (RAM) 120, electrically erasable programmable read-only memory (EEPROM) 122, and/or read-only memory (ROM) 124.
• RAM random access memory
• EEPROM electrically erasable programmable read-only memory
• ROM read-only memory
• the RAM can include a volatile random access memory
• the EEPROM can include a writeable non-volatile memory
• the ROM can include a read-only memory.
• the RAM can be used to store data items and data structures, such as a system stack 121 .
• the ROM can include a virtual machine 108, such as a Java virtual machine, which allows applications written in a platform-independent programming language, such as Java , to be executed by the smart card; and can also contain one or more applications 104, 105, which provide services for clients accessing the smart card.
• applications 106 can also be located in EEPROM, or in both ROM and/or EEPROM.
• the system can include a card manager 102, or a similar logic, which includes code for managing the execution of applications on the computing environment or device (including, for example, enabling communications between clients and applications); and deleting objects from memory.
• the EEPROM can contain a plurality of objects 1 12, 1 13, 1 14, which are accessed by applications 104, 105 (more specifically, application 104 accesses object 1 12, application 105 accesses objects 1 13 and 1 14, and application 106 accesses object 1 14); while other objects 1 15, 1 16, that have become unlinked, are no longer referenced by any application. It is generally desirable to delete these unreferenced objects to free up memory space.
• FIG. 1 The environment illustrated in Figure 1 is provided by way of illustration of one type of environment that can utilize the systems and methods described herein.
• the invention is not limited to resource-constrained environments or smart cards, or to the particular environment or configuration described above, and can generally be used with other types of computing environment, device, or system that can store object in a writeable persistent or non-volatile memory.
• a system and method for use of bitmap windows which represent a chunk of memory.
• the technique uses an algorithm or method which can work with very limited resources, while mapping a large amount of addressable space.
• the technique is also scaleable such that, for increased persistent memory size, even if the overall RAM size remains relatively unchanged, the algorithm or method will still work. Additionally, the algorithm or method does not reduce overall system performance as might be the case with brute- force, reference counting, and dereferencing techniques.
• Figure 2 illustrates the use of bitmap windows representing memory chunks, for object deletion in persistent memory, in accordance with an embodiment.
• the system can include a data structure 142, which can include one or more memory bitmap windows 144 (156, 158,160), which represent a chunk of addressable space 146, 148, 150 in persistent memory 140, for storage of objects.
• a data structure 142 can include one or more memory bitmap windows 144 (156, 158,160), which represent a chunk of addressable space 146, 148, 150 in persistent memory 140, for storage of objects.
• the data structure can further include a potential garbage list 162, which lists objects which are not referenced in windows that have already been processed; a dynamic roots list 164, which lists objects referenced from a previous window but not in the addressable space in the previous window, which become roots for a next window; a maximum recursion depth 166, which is a configurable value that limits the recursion depth for marking phase; and a deferred object list 168, which once the configured recursion depth is reached, includes the children objects which have not been processed yet.
• a potential garbage list 162 which lists objects which are not referenced in windows that have already been processed
• a dynamic roots list 164 which lists objects referenced from a previous window but not in the addressable space in the previous window, which become roots for a next window
• a maximum recursion depth 166 which is a configurable value that limits the recursion depth for marking phase
• a deferred object list 168 which once the configured recursion depth is reached, includes the children objects which have
• Figure 3 and Figure 4 further illustrate the use of bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• bitmap windows for object deletion in order to avoid unnecessary writes to
• the system can maintain a bitmap in RAM.
• RAM is a scarce resource; a typical amount might be 2k, which provides little space for bitmap storage.
• a 512 byte bitmap contains 4k bits, and each bit can represent 4 bytes, so a bitmap of this size can be used to represent 16k of memory.
• the system can perform a marking process, which "marks" all objects that are reachable in memory. This can be accomplished by following chains of references from "roots”, such as from applet tables and static variables, to find reachable objects. For example, an applet object can point to another object, which points to yet other objects, each of which also point to other objects. Similarly, static variables can point to objects, which point to yet other objects.
• a marking phase starting from a window's root objects, its object children are marked. If a child object resides outside a window, and in a next window, then that object can be put into the dynamic roots list as a root for the next window. If a child object is within this window, then it can be marked, and the system can recurse on the children of that object. If a child object is in a previous window, then the system checks the potential garbage list and recurses on that object, and then removes it from the potential garbage list since it is addressable from this window. After the marking phase for a window, the system looks for objects that were not marked, and puts those in a potential garbage list. These objects may not actually be considered garbage yet, since they may be addressable from a next window. The system then processes the next windows. Ultimately, after completing the windows, the potential garbage list will contain those objects which are not referenced and can be considered garbage.
• the memory space is divided into windows.
• a bitmap is initialized for the windows, wherein a bit represents an address in memory. For example, if memory management is performed at 4-byte alignment, then a bit can represent the first byte in the 4-byte memory cell.
• the bitmap windows are processed.
• the root objects are marked, including marking applet objects 170 within the current window as indicated by an applet table 169; marking objects 174 that are referenced from static fields 176 which are in the window; and marking objects 178 from the dynamic roots table which are in the window.
• children objects are then marked, including if a child object 171 , 172 is found within the current window, marking that object by marking 184 the corresponding bit in the bitmap. If a child object 180 is found outside the current window in the potential garbage list, then the object and its children are marked recursively in the current window and the potential garbage list. If a child object is found outside the current window and is not in the potential garbage list then, if the object is in an already processed area of the memory, it has already been marked as reachable, and therefore it can be ignored. If, instead, the child object is in an area of memory that still needs to be processed, then it is put in the dynamic roots list.
• the process continues with the next window and with its root and child objects 185, 186, 187, 188.
• the potential garbage list will only contain objects 189 which are not referenced, and are therefore garbage. In accordance with an embodiment, these objects can be deleted to reclaim the memory used.
• Figure 5 is a flowchart illustrating an algorithm or method 190 of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• step 192 the memory space is divided into windows.
• a bitmap is initialized for the windows, wherein a bit represents an address in memory.
• bitmap windows are processed.
• root objects are marked, including marking applet objects within the current window, marking objects that are referenced from static fields which are in the window, and marking objects from the dynamic roots table which are in the window.
• children objects are marked, subject to criteria as described in further detail below, and the bitmaps updated. Any unreferenced objects in the current window are put on the potential garbage list.
• the potential garbage list will only contain objects which are not referenced, and are therefore garbage. In accordance with an embodiment, these objects can be deleted to reclaim the memory used.
• Figure 6 is a flowchart further illustrating an algorithm or method 210 of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 6 further illustrates how the marking of root and children objects can be performed, in accordance with an embodiment.
• the root objects are marked, including marking applet objects within the current window, marking objects that are referenced from static fields which are in the window, and marking objects from the dynamic roots table which are in the window.
• the children objects are marked, including if a child object is found within the current window, marking that object by marking the corresponding bit in the bitmap. If a child object is found outside the current window in the potential garbage list, then the object and its children are marked recursively in the current window and the potential garbage list. If a child object is found outside the current window and is not in the potential garbage list then, if the object is in an already processed area of the memory, it has already been marked as reachable, and therefore it can be ignored. If, instead, the child object is in an area of memory that still needs to be processed, then it is put in the dynamic roots list.
• step 216 while marking child objects, if a maximum recursion depth is reached, then the next object in the hierarchy is put on the deferred object list, and will be processed at the end of processing the current hierarchy.
• step 220 if the deferred object list is full, and the maximum recursion depth has been reached, then the marking process is started again in the current window, without resetting the bitmap, therefore increasing the number of roots in the second and subsequent cycles.
• any unreferenced objects within the window are put on the potential garbage list.
• the potential garbage list will only contain objects which are not referenced, and are therefore garbage. In accordance with an embodiment, these objects can be deleted to reclaim the memory used.
• Figure 7 is a flowchart further illustrating an algorithm or method 230 of using bitmap windows for object deletion in persistent memory, in accordance with an embodiment.
• Figure 7 illustrates the combination of each of the steps previously described at Figures 5 and 6, in accordance with an embodiment.
• the invention relates to a system for object deletion in persistent memory using bitmap windows representing memory chunks, operating on one or more microprocessors, comprising:
• a computing environment or device such as a resource- constrained environment, smart card, or other environment, including a processor or computational engine and a persistent memory for storage of software objects, a data structure which can include one or more memory bitmap windows, each of which represents a chunk of addressable space in the persistent memory;
• Said system further comprising means for providing within the data structure one or more of:
• Said system further comprising:
• the potential garbage list includes objects which are not referenced in windows that have already been processed
• the dynamic roots list includes objects referenced from a previous window but not in the addressable space in the previous window, which become roots a next window;
• the maximum recursion depth is a configurable value that limits the recursion depth for a marking phase
• the deferred object list once the configured recursion depth is reached, includes children objects which have not been processed yet.
• Said system further comprising:
• the present invention may be conveniently implemented using one or more conventional general purpose or specialized digital computer, computing device, machine, or microprocessor, including one or more processors, memory and/or computer readable storage media programmed according to the teachings of the present disclosure.
• Appropriate software coding can readily be prepared by skilled programmers based on the teachings of the present disclosure, as will be apparent to those skilled in the software art.
• the present invention includes a computer program product which is a non-transitory storage medium or computer readable medium (media) having instructions stored thereon/in which can be used to program a computer to perform any of the processes of the present invention.
• the storage medium can include, but is not limited to, any type of disk including floppy disks, optical discs, DVD, CD-ROMs, microdrive, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, DRAMs, VRAMs, flash memory devices, magnetic or optical cards, nanosystems (including molecular memory ICs), or any type of media or device suitable for storing instructions and/or data.

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Memory System (AREA)

Priority Applications (4)

Applications Claiming Priority (4)

Publications (1)

Family

ID=49996077

Family Applications (1)

Country Status (6)

Families Citing this family (13)

Citations (4)

Family Cites Families (8)

• 2013
  • 2013-03-01 US US13/782,433 patent/US9141539B2/en active Active
  • 2013-07-30 CN CN201380030019.4A patent/CN104350478B/zh active Active
  • 2013-07-30 JP JP2015525522A patent/JP6163551B2/ja active Active
  • 2013-07-30 WO PCT/US2013/052780 patent/WO2014022431A1/en not_active Ceased
  • 2013-07-30 KR KR1020157000473A patent/KR102065563B1/ko active Active
  • 2013-07-30 EP EP13748415.0A patent/EP2880538B1/en active Active

Patent Citations (4)

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events