Abstract: The present invention is a method and system of automatic memory management (garbage collection). An application automatically marks up objects referenced from the “extended root set”. At garbage collection, the system starts traversal from the marked-up objects. It can conduct accurate garbage collection in a non-GC language, such as C++. It provides a deterministic reclamation feature. An object and its resources are released immediately when the last reference is dropped. Application codes automatically become entirely GC-safe and interruptible. A concurrent collector can be pause-less and with predictable worst-case latency of micro-second level. Memory usage is efficient and the cost of reference counting is significantly reduced.

Abstract: The present invention is a method and system for ordering reclamation of unreachable objects in a garbage collection system. After unreachable objects are determined, they are given a chance to declare dependence relationships. The system then determines zero-depended objects based on these declarations and destructs zero-depended objects. After destruction, their dependence relationships are removed or ignored by the system. By repeating destructing zero-depended objects, objects are destructed in an order that meet up the requirement from dependence declarations of application program. Therefore, it guarantees safety for destructors to use/access other unreachable objects.

Abstract: The present invention is a method and mechanism of multiple processors synchronization. Calling global memory fence (GMF) service raises asynchronous memory fence being executed on other processors. By guarantee that asynchronous memory fence (AMF) or equivalence on other processors are executed within the window of global memory fence (GMF) service call, the expensive memory ordering semantics can be removed from the critical path of frequently-executed application code. Therefore, the overall performance is improved in modern processor architectures.

Abstract: The present invention is a method and system of automatic memory management (garbage collection). An application automatically marks up objects referenced from the “extended root set”. At garbage collection, the system starts traversal from the marked-up objects. It can conduct accurate garbage collection in a non-GC language, such as C++. It provides a deterministic reclamation feature. An object and its resources are released immediately when the last reference is dropped. Application codes automatically become entirely GC-safe and interruptible. A concurrent collector can be pause-less and with predictable worst-case latency of micro-second level. Memory usage is efficient and the cost of reference counting is significantly reduced.