| 摘要 |
<p>A method is provided for managing at least one predefined portion of storage, utilizing a plurality of locks, each of which encompasses a contiguous range of storage, comprising the steps of: (a) defining a plurality of lock related parameters for each of said locks; (b) organizing said plurality of parameters for each lock in a logically two dimensionally order; and (c) managing lock attempts by comparing the plurality of lock related parameters associated with an attempted lock, with at least a portion of said plurality of parameters organized in said two dimensional order. According to a preferred embodiment of the invention, the two dimensional ordering of said plurality of lock related parameters is a Cartesian tree. The Cartesian tree is used to provide a means for quickly and efficiently determining whether or not to grant an attempted lock. Each node of the tree consists of an ordered pair of keys where the first key is the offset, within the file, of the start of the lock range. The second key is the length or span of the lock. The invention dynamically creates the Cartesian tree utilizing three parameters associated with (defined for) each lock, namely: (1) the starting location of the data to be protected (the first key); (2) the span (or range) of the data to be protected (the second key); and (3) the type of lock desired (shared or exclusive).</p> |
