Abstract: A method, a computing device, and a non-transitory machine-readable medium for allocating memory to data structures that map a first address space to a second is provided. In some embodiments, the method includes identifying, by a storage system, a pool of memory resources to allocate among a plurality of address maps. Each of the plurality of address maps includes at least one entry that maps an address in a first address space to an address in a second address space. An activity metric is determined for each of the plurality of address maps, and a portion of the pool of memory is allocated to each of the plurality of address maps based on the respective activity metric. The allocating of the portion of the memory pool to a first map may be performed in response to a merge operation being performed on the first map.

Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

Abstract: A method includes: storing a first data extent on a physical medium, wherein the physical medium is divided into a plurality of storage blocks, wherein each of the storage blocks has a size that is different than a size of the first data extent, further wherein the first data extent is stored to a first block of the plurality of storage blocks; generating a descriptor for the first data extent, wherein the descriptor indicates that the first data extent starts within the first block of the plurality of blocks and indicates an offset from the beginning of the first block at which the first data extent starts; and storing the descriptor within the first block.

Abstract: A system for tracking metadata changes and recovering from system interruptions is provided. With host I/O, corresponding metadata incremental changes are aggregated and stored in a write-ahead log before being performed to their in-memory buffers. As those buffers are flushed, checkpoints are created and stored in the log. As the log wraps to the start, older entries are overwritten after they are freed from any remaining dependencies by newer checkpoints. If metadata entities have not created new checkpoints, they are instructed to in order to free up space for new aggregated batches and checkpoints. After an interruption, the wrap point is located in the log. From the wrap point, the log is scanned backwards to provide checkpoints to metadata entities. The log is then scanned forwards to perform changes specified by aggregated batches. The metadata entities' volatile memory states are recovered to what they were before the interruption.

Abstract: A method, a computing device, and a non-transitory machine-readable medium for assessing data segments for garbage collection is provided. In some embodiments, the method includes identifying a plurality of data segments. A first rate at which data within each of the plurality of data segments has been invalidated since a first point in time is determined, and a second rate at which data within each of the plurality of data segments has been invalidated since a second point in time subsequent to the first point in time is determined. The second rate is compared to the first rate for each of the plurality of data segments, and a garbage collection score is assigned to the respective data segment based on the comparison. The garbage collection score may be further based on a utilization of the respective data segment and/or an age of the respective data segment.

Abstract: The invention relates to 1,2,4-thiadiazole derivatives and their use to treat parasites.

Abstract: A system and method of transposed storage in RAID arrays includes a storage manager with an interface for receiving storage requests associated with multi-segment blocks stored in a storage array, a controller for processing the received storage requests and controlling the storage manager, and a write request handler. The storage array includes a plurality of storage devices for which consecutive logical addresses are assigned to different ones of the storage devices. The write request handler is configured to process block write requests and send segment write requests to the storage array based on the write requests so that each segment of a given multi-segment block is written to a single respective one of the storage devices in the storage array. In some embodiments, the storage manager further includes a read request handler configured to determine logical addresses of requested segments and send segment read requests to the storage array.

Abstract: The invention relates to 1,2,4-thiadiazole derivatives and their use to treat parasites.

Abstract: A system and method of transposed storage in RAID arrays includes a storage manager with an interface for receiving storage requests associated with multi-segment blocks stored in a storage array, a controller for processing the received storage requests and controlling the storage manager, and a write request handler. The storage array includes a plurality of storage devices for which consecutive logical addresses are assigned to different ones of the storage devices. The write request handler is configured to process block write requests and send segment write requests to the storage array based on the write requests so that each segment of a given multi-segment block is written to a single respective one of the storage devices in the storage array. In some embodiments, the storage manager further includes a read request handler configured to determine logical addresses of requested segments and send segment read requests to the storage array.

Abstract: A system, method, and machine-readable storage medium for recovering data in a distributed storage system are provided. In some embodiments, the method includes identifying a failing storage device of a first storage node having an inaccessible data segment. When it is determined that the inaccessible data segment cannot be recovered using a first data protection scheme, a first chunk of data associated with the inaccessible data segment is identified and a group associated with the first chunk of data is identified. A second chunk of data associated with the group is selectively retrieved from a second storage node such that data associated with an accessible data segment of the first storage node is not retrieved. The inaccessible data segment is recovered by recovering the first chunk of data using a second data protection scheme and the second chunk of data.

Abstract: A method, system and computer readable medium of: providing feature data of at least one organ at risk or target volume of said patient from a database of non-transitory data stored on a data storage device of prior patients data; generating, using a data processor, a distribution of dose points of the at least one organ at risk or target volume of said patient based on said feature data; calculating, using the data processor, at least one of (i) a probability of toxicity for the at least one organ at risk or (ii) a probability of treatment failure for the at least one target volume, based on said distribution of dose points; assessing, using the data processor, a dosimetric-outcome relationship based on the calculated probability; and automatically formulating, using the data processor, a treatment plan using the dosimetric-outcome relationship to minimize the at least one treatment-related risk.

Abstract: A system and method of transposed storage in RAID arrays includes a storage manager with an interface for receiving storage requests associated with multi-segment blocks stored in a storage array, a controller for processing the received storage requests and controlling the storage manager, and a write request handler. The storage array includes a plurality of storage devices for which consecutive logical addresses are assigned to different ones of the storage devices. The write request handler is configured to process block write requests and send segment write requests to the storage array based on the write requests so that each segment of a given multi-segment block is written to a single respective one of the storage devices in the storage array. In some embodiments, the storage manager further includes a read request handler configured to determine logical addresses of requested segments and send segment read requests to the storage array.

Abstract: Technology is disclosed for subpartitioning a namespace region. In various embodiments, the technology creates at least two subpartitions from a partitioned namespace, wherein the partitioned namespace corresponds to at least two different name nodes of the large scale data storage service; and stores data corresponding to each subpartition as a separate file, e.g., so that it can be easily mounted by an operating system executed by a different computing device.

Abstract: A computer-implemented method may be provided for analyzing and disseminating medical information. The method may include steps performed by one or more processors including, receiving a plurality of patient medical data; aggregating the plurality of patient medical data, wherein access to patient private health information is restricted; receiving a query for medical information; analyzing the aggregated medical data based on the query; producing a result of the query based on the analyzing of the aggregated medical data; and transmitting the result of the query.

Abstract: This disclosure teaches a method of conditioning a human to sleep, having the steps of determining, that it is time for said human to take a nap; donning, by said human, a decorated blanket which is a costume for a character in a story where the decorated blanket has a sleeve with an inner surface and an outer surface where at least one piece of fabric, shaped to resemble a caudal fin, is attached and a shimmering mechanism which at least a portion of the outer surface of the sleeve or the piece of fabric; then encouraging this human to imagine that they are a character in a story because the human is wearing the costume; then conveying, to this human a story; and finally repeating, these steps until the human associates the story and decorated blanket with sleep.

Abstract: Technology is disclosed for partitioning a namespace of a large scale data storage service. In various embodiments, the technology receives a file path; employs a hashing function to produce a hash value for the received file path; and identifies a name node handling the produced hash value, wherein the name node is configured to communicate with one or more data nodes for handling file requests on the file path.

Abstract: The invention relates to 1,2,4-thiadiazole derivatives and their use to treat parasites.

Abstract: Some embodiments provide apparatuses configured to deploy a landing gear of an aircraft, comprising: a landing gear coupler configured to couple with the landing gear; a release link configured to cooperate the landing gear coupler with a drive shaft that is configured to drive the landing gear between a stowed position and a deployed position; an override driver cooperated with the landing gear coupler; wherein the release link is configured to releasably maintain a relative position of landing gear coupler relative to the drive shaft, and the release link is configured to disengage a coupling between the drive shaft and the landing gear coupler such that the landing gear coupler is configured to move independent of the drive shaft; and wherein the override driver is configured to drive the landing gear coupler to the deployed position.