The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
A transactionally consistent algorithm for space reclamation in a distributed cluster environment. The reclamation can occur at any location in the free-space map while allowing concurrent space allocation.
English (United States)
This text was extracted from a PDF file.
This is the abbreviated version, containing approximately
67% of the total text.
Page 1 of 1
Online Space Reclamation from the Middle of a Free-space Map
Many applications manage available disk space by utilizing bitmaps within a free-space manager. The problem with this method is the difficulty in reclaiming space with the middle of the free-space map. Many applications can trim space from the end of a free space map or utilize a defragmenter to compress the used space down before trimming the freed space at the end of the map. A defragmenter utility is generally pervasive to the system and consumes valuable CPU and IO resources.
This solution allows for free-space reclamation in the middle of a free-space map within a distributed environment where a master node maintains the transactionally consistent state of the available free-space. Our approach allows for the transactionally consistent reclamation of logically consecutive blocks from anywhere in the free-space map. The atomic unit of work is at the partition level. The process is initiated from the master node.
The details of the logic follows:
The master node sends the subordinate a message requesting a candidate list of
free partitions. The subordinate checks its free-space map for any logically consecutive free space
in its map and returns a candidate list to the master. The master node inserts a redo record of the reclamation action and marks the
partition as locked persistently within the master's meta-data tables. The master sends a message to the subordinate to check if the specified partiti...