Abstract: The subject of the invention is a spring sensor element 1, comprising carbon nanotubes 6 on a carrier 2, wherein the carbon nanotubes 6 are arranged in CNT blocks 10, 20, 30, 40, wherein the carbon nanotubes 6 of each CNT block 10, 20, 30, 40 preferably have the same length and the same alignment with respect to the carrier 2, wherein at least the highest one of the CNT blocks 10, 20, 30, 40 is arranged nearby at least two electric contacts 60, 61, 62. The spring sensor element 1 has at least one additional neighboring CNT block 20, 30, 40 of the height H2 in addition to the first CNT block 10 of the height H1, wherein the heights H1 and H2 differ by a factor of at least 2.

Abstract: The subject of the invention is a spring sensor element 1, comprising carbon nanotubes 6 on a carrier 2, wherein the carbon nanotubes 6 are arranged in CNT blocks 10, 20, 30, 40, wherein the carbon nanotubes 6 of each CNT block 10, 20, 30, 40 preferably have the same length and the same alignment with respect to the carrier 2, wherein at least the highest one of the CNT blocks 10, 20, 30, 40 is arranged nearby at least two electric contacts 60, 61, 62. The spring sensor element 1 has at least one additional neighboring CNT block 20, 30, 40 of the height H2 in addition to the first CNT block 10 of the height H1, wherein the heights H1 and H2 differ by a factor of at least 2.

Abstract: A method for evaluating health of a distributed network service environment (DNSE) includes determining an application performance measurement (APM) based at least in part on performance metrics (PM) associated with sources, where the sources are associated with the DNSE. The sources include service engine(s) and servers. At least some of the servers are configured to provide a distributed application, and the service engine(s) are configured to provide the servers with a network service and collect at least a part of the PM. The method includes determining a health risk of the DNSE based at least in part on risk parameters obtained by the service engine(s). The method includes combining the APM and the health risk of the DNSE to determine a health indicator. If the indicator indicates a change of the DNSE, a notification of the change is generated. The method includes outputting the notification of the change.

Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes of a storage system. The virtual volumes having a file system and one or more files organized as buffer trees, the buffer trees utilizing indirect blocks to point to the data blocks. The indirect block at the level above the data blocks are grouped into compression groups that point to a set of physical volume block number (pvbn) block pointers.

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes of a storage system. The virtual volumes having a file system and one or more files organized as buffer trees, the buffer trees utilizing indirect blocks to point to the data blocks. The indirect block at the level above the data blocks are grouped into compression groups that point to a set of physical volume block number (pvbn) block pointers.

Abstract: Various implementations include an anti-slip pad for use with a portable electronic device. The anti-slip pad may prevent the portable electronic device from slipping out of the user's hand or across a surface, for example. As described below, the pad includes a non-slip layer and an adhesive layer that are permanently affixed to each other. The non-slip layer has a first side and a second side opposite the first side. The first side of the non-slip layer has a non-slip surface. The adhesive layer is affixed to the second side of the non-slip layer. The adhesive layer is configured for being removably adherable to an outer surface of the portable electronic device such that the non-slip layer faces away from the outer surface. The adhesive layer allows the pad to be selectively repositioned on the portable electronic device, according to some implementations.

Abstract: Partially overwriting a compression group without decompressing compressed data can consumption of resources for the decompression. A storage server partially overwrites the compression group when a file block identifier of a client's write request resolves to the compression group. The compression group remains compressed while the partial overwriting is performed.

Abstract: The subject of the invention is a spring sensor element 1, comprising carbon nanotubes 6 on a carrier 2, wherein the carbon nanotubes 6 are arranged in CNT blocks 10, 20, 30, 40, wherein the carbon nanotubes 6 of each CNT block 10, 20, 30, 40 preferably have the same length and the same alignment with respect to the carrier 2, wherein at least the highest one of the CNT blocks 10, 20, 30, 40 is arranged nearby at least two electric contacts 60, 61, 62. The spring sensor element 1 has at least one additional neighboring CNT block 20, 30, 40 of the height H2 in addition to the first CNT block 10 of the height H1, wherein the heights H1 and H2 differ by a factor of at least 2.

Abstract: A network adapter receives a request to store a data block. The data block is sent from the network adapter to a compression module. The compression module generates a compressed data block from the data block. The compressed data block or a reference to the compressed data block is stored in a buffer cache. The compressed data block is stored in nonvolatile memory. It is determined that the compressed data block should be flushed a storage device. In response to determining that the compressed data block should be flushed to the storage device, the compressed data block is flushed from the nonvolatile memory to the storage device.

Abstract: A system and method for logically organizing compressed data. In one aspect, a destination storage server receives a write request that includes multiple data blocks and specifies corresponding file block numbers. An extent-based file system executing on the storage server accesses intermediate block entries that each associates one of the file block numbers with a respective extent block number. The file system, in cooperation with a compression engine, compresses the data blocks into a set of one or more compressed data blocks. The file system stores the compressed data blocks at physical locations corresponding to physical block numbers and allocates, within an extent map, pointers from an extent ID to the extent block numbers, and pointers from the extent ID to the physical block numbers.

Abstract: A technique for organizing data to facilitate data deduplication includes dividing a block-based set of data into multiple “chunks”, where the chunk boundaries are independent of the block boundaries (due to the hashing algorithm). Metadata of the data set, such as block pointers for locating the data, are stored in a tree structure that includes multiple levels, each of which includes at least one node. The lowest level of the tree includes multiple nodes that each contain chunk metadata relating to the chunks of the data set. In each node of the lowest level of the buffer tree, the chunk metadata contained therein identifies at least one of the chunks. The chunks (user-level data) are stored in one or more system files that are separate from the buffer tree and not visible to the user.

Abstract: It is determined that a first data block contains the same data as a second data block. The first data block is associated with a first extent and the second data block is associated with a second extent. In response to determining that the first data block contains the same data as the second data block, the second data block is associated with the first extent and the first data block is disassociated with the second extent.

Abstract: Provided is a method and system for reducing duplicate buffers in buffer cache associated with a storage device. Reducing buffer duplication in a buffer cache includes accessing a file reference pointer associated with a file in a deduplicated filesystem when attempting to load a requested data block from the file into the buffer cache. To determine if the requested data block is already in the buffer cache, aspects of the invention compare a fingerprint that identifies the requested data block against one or more fingerprints identifying a corresponding one or more sharable data blocks in the buffer cache. A match between the fingerprint of the requested data block and the fingerprint from a sharable data block in the buffer cache indicates that the requested data block is already loaded in buffer cache. The sharable data block in buffer cache is used instead thereby reducing buffer duplication in the buffer cache.

Abstract: A method and apparatus for retention of active data stored in memory using multiple indexing systems for data storage. An embodiment of a method for retention of active data in a storage server includes reading data into a first location of a main memory of the storage server. The data in the first location indexes data elements in a long-term data storage in a first manner. The method further provides for copying the data from the first location into a second location in the main memory of the storage server, where the data in the second location indexing the data elements in the long-term data storage in a second manner.

Abstract: Systems, computer-readable media storing instructions, and methods can infer a state of behavior. Such a method can include constructing a graph including nodes representing hosts and domains based on an event dataset. The graph can be seeded with information external to the event dataset. A belief whether each of the nodes is in a particular state of behavior can be calculated based on marginal probability estimation.

Abstract: A method and system for eliminating the redundant allocation and deallocation of special data on disk, wherein the redundant allocation and deallocation of special data on disk is eliminated by providing an innovate technique for specially allocating special data of a storage system. Specially allocated data is data that is pre-allocated on disk and stored in memory of the storage system. “Special data” may include any pre-decided data, one or more portions of data that exceed a pre-defined sharing threshold, and/or one or more portions of data that have been identified by a user as special. For example, in some embodiments, a zero-filled data block is specially allocated by a storage system. As another example, in some embodiments, a data block whose contents correspond to a particular type document header is specially allocated.

Abstract: An extent-based storage architecture is implemented by a storage server receiving a read request for an extent from a client, wherein the extent includes a group of contiguous blocks and the read request includes a file block number. The storage server retrieves an extent identifier from a first sorted data structure, wherein the storage server uses the received file block number to traverse the first sorted data structure to the extent identifier. The storage server retrieves a reference to the extent from a second sorted data structure, wherein the storage server uses the retrieved extent identifier to traverse the second sorted data structure to the reference, and wherein the second sorted data structure is global across a plurality of volumes. The storage server retrieves the extent from a storage device using the reference and returns the extent to the client.

Abstract: An extent-based storage architecture is implemented by a storage server. The storage server generates a new extent identifier for cloning a source extent identified by a source extent identifier and stored at a source data structure that includes a length value providing a length of the source extent, an offset value and a reference count value that provides a number of data containers that reference the source extent identifier. The storage server updates a data structure for a cloned version of the data container for storing the new extent identifier that points to the source extent identifier and includes an extent length value and offset value different from length value and the offset value of the source data structure.