Abstract: A method, including loading, to a first address in a memory of a computer, an interposing method having an interposing name that is identical to an original name of an original method in a library of original methods that are to be dynamically loaded by a software application running on the computer, and identifying a second address in the memory of a dynamic linking method associated with the library. A request is then intercepted from the application, the request including a specified name for one of the methods in the library. When the specified name matches the interposing name, the application is directed to the first address so as to run the interposing method. However, when the specified name does not match any interposing name, the application is directed to the second address so as to run the dynamic linking method to run one of the original methods.

Abstract: A method and a system for detecting an occurrence of an auto-commit operation applied to files managed by a file server compliant with write-once-read-many (WORM) rules. The method includes: allocating a plurality of non-overlapping predefined time ranges starting from a newest-changed-files time range and ending at an oldest-changed-files time range, wherein the time ranges add up to an auto-commit period associated with the auto-commit operation; repeatedly updating a count of files whose file-change-time is associated respectively with one of the allocated time ranges, wherein the updating is carried out every time the predefined time range lapses; and detecting, every time the time range lapses, an occurrence of an auto-commit operation applied to at least one of the files stored on the volume within a duration of the time range since the updating, whenever the count of the files associated with the oldest-changed-files time range is non-zero.

Abstract: A method and a system for detecting an occurrence of an auto-commit operation applied to files managed by a file server compliant with write-once-read-many (WORM) rules. The method includes: allocating a plurality of non-overlapping predefined time ranges starting from a newest-changed-files time range and ending at an oldest-changed-files time range, wherein the time ranges add up to an auto-commit period associated with the auto-commit operation; repeatedly updating a count of files whose file-change-time is associated respectively with one of the allocated time ranges, wherein the updating is carried out every time the predefined time range lapses; and detecting, every time the time range lapses, an occurrence of an auto-commit operation applied to at least one of the files stored on the volume within a duration of the time range since the updating, whenever the count of the files associated with the oldest-changed-files time range is non-zero.

Abstract: A method and system for synchronization and distribution of configuration cross cluster without blocking are provided herein. The method includes: responsive to detecting a node in the group of nodes of a distributed system becoming inactive, recording current operations database version as a node version of the inactive node; initiating a removal of the inactive node from the group of nodes; maintaining the version of the operations database unchanged until the inactive node is removed; enabling a change of the database version once the removal of the inactive node is completed; sending a join request once the inactive node wishes to rejoin; obtaining a list of operation objects for synchronization of the rejoining node; and accepting the rejoining node to the group, only whenever the joining node is at a same state as the nodes group, otherwise, repeating the sending of the join request until the synchronization is completed.

Abstract: A method and system for synchronization and distribution of configuration cross cluster without blocking are provided herein. The method includes: responsive to detecting a node in the group of nodes of a distributed system becoming inactive, recording current operations database version as a node version of the inactive node; initiating a removal of the inactive node from the group of nodes; maintaining the version of the operations database unchanged until the inactive node is removed; enabling a change of the database version once the removal of the inactive node is completed; sending a join request once the inactive node wishes to rejoin; obtaining a list of operation objects for synchronization of the rejoining node; and accepting the rejoining node to the group, only whenever the joining node is at a same state as the nodes group, otherwise, repeating the sending of the join request until the synchronization is completed.