Abstract: A code object and flash memory may be updated by storing a new code object in the flash memory. Then, a pointer from a page table may be redirected to point to the new code object. The old code object may then be deleted. As a result, code can be updated without the need for rebooting by using the memory management unit and its page table capability.

Abstract: A method and apparatus to perform a reclaim operation in a nonvolatile memory is provided. The apparatus may be a nonvolatile memory that may include a control circuit to receive a reclaim request from a device external to the nonvolatile memory and to perform a reclaim operation in response to receiving the reclaim request, wherein the reclaim operation includes copying valid information stored in a first portion of the nonvolatile memory to a second portion of the nonvolatile memory and erasing the first portion of the nonvolatile after the copying of the valid information. Other embodiments are described and claimed.

Abstract: A method and apparatus to update information in a memory is provided. The apparatus may be a nonvolatile memory that may include a control circuit to swap the physical addresses of a first block and a second block of the nonvolatile memory as part of an operation to update information stored in the first block, wherein the control circuit is internal to the nonvolatile memory. Other embodiments are described and claimed.

Abstract: A flash memory file system includes fragments and headers. The headers have a reduced number of states.

Abstract: Briefly, in accordance with an embodiment of the invention, a method and apparatus to detect invalid data in a memory is provided. The method may include setting at least one power loss recovery (PLR) status bit in response to the writing to or erasing of a plurality of nonvolatile memory cells of a nonvolatile memory, wherein the at least one PLR status bit indicates whether the writing to or erasing of the plurality of memory cells was interrupted by a loss of power and wherein the setting of the at least one PLR status bit is performed by the nonvolatile memory. Other embodiments are described and claimed.

Abstract: Briefly, in accordance with an embodiment of the invention, a method and apparatus to alter code in a memory is provided. The method may include selecting a first block from a plurality of unmapped blocks in a nonvolatile memory to add or delete code in the nonvolatile memory. The apparatus may include a control circuit to select a first block from a plurality of unmapped blocks in a nonvolatile memory based on a cycle count of the first block to add or delete code in the nonvolatile memory. Other embodiments are described and claimed.

Abstract: A flash memory file system includes a transaction information structure in support of transacted operations. File system operations may be rolled back if a transaction was interrupted.

Abstract: A nonvolatile memory device may include circuitry to support the partitioning of the memory into two or more logical partitions. The two or more logical partitions may be accessible by two or more separate interfaces with different characteristics.

Abstract: In one embodiment of the present invention, a method includes storing a code object in a volume of an execute-in-place memory that includes at least one data object. In certain embodiments, the code object may be stored as a plurality of fragments. Further, the memory may support execution in place such that a processor may execute in place a first code fragment of a code object and execute in place a second code fragment of the code object from the memory, where the code fragments are non-contiguously stored in the memory.

Abstract: A technique for coalesced PLR status bits in an ECC enabled flash memory.

Abstract: In one embodiment, a multilevel segmented memory device may be used to store persistent data in a first memory level and dynamic data in a second memory level. In the first level, data fragments may grow in an ascending order, and sequence tables may grow in a descending order. In the second level, object pointers may grow in a descending order, and data units grow in an ascending order.