Persistent Memory Object Design Framework for Detectable Recovery

The patent segments the data structure into persistent and transient parts, allowing different recovery strategies for each. The persistent part is protected by checkpoint operations that record state to non-volatile memory, while the transient part can be recovered more efficiently. This segmentation enables detectable recoverability without requiring full checkpointing of all data, thus reducing runtime overhead.

The patent implements preliminary checkpoint operations that record the state of persistent data structures before potential crashes. By performing these checkpoint actions in advance and using operation descriptors to track progress, the system ensures that upon recovery, it can detect whether a checkpoint was completed and resume from the correct state, eliminating the need for complex post-crash analysis and reducing overall runtime overhead.

The patent creates a universal programming framework that can be applied to various persistent data structure algorithms. The framework provides generic checkpoint and recovery mechanisms that work with different data structures (queues, stacks, linked lists, hash tables), eliminating the need to implement complex recovery logic for each specific algorithm. This universality maintains implementation simplicity while enabling optimized performance through framework-level optimizations.

The patent changes the parameters of data structure operations by introducing operation descriptors that track progress and state. Instead of using fixed, simple algorithms, the framework dynamically adjusts operation behavior based on checkpoint status and recovery state. This allows the same base algorithm to perform efficiently in both normal operation and recovery scenarios, improving runtime performance without complicating the core algorithm implementation.

The patent introduces operation descriptors as intermediary data structures that mediate between the persistent data structure and the checkpoint mechanism. These descriptors track the progress and state of operations without requiring complex integration with the core data structure logic. By using this intermediary layer, the system achieves crash consistency through checkpoint operations while keeping the core data structure implementation simple and manageable.

The patent uses checkpoint operations that create copies of the persistent data structure state at critical points. Instead of modifying the original structure to track checkpoint status, the framework creates persistent copies of the state and uses operation descriptors to reference these copies. This copying approach ensures crash consistency while maintaining the simplicity of the original data structure implementation, as the checkpoint mechanism operates on separate copy objects.