Abstract: An aircraft can include a frame and a plurality of electrical rotors coupled to the frame. The aircraft can further include a control system physically coupled to the frame and communicatively coupled with each of the plurality of electrical rotors. The control system can be configured to control a speed of each electrical rotor on an individual basis to control a direction of flight of the aircraft. The aircraft can further include an engine coupled to the frame, the engine being configured to combust a combustible fuel to generate thrust.

Abstract: An aircraft can include a frame and a plurality of electrical rotors coupled to the frame. The aircraft can further include a control system physically coupled to the frame and communicatively coupled with each of the plurality of electrical rotors. The control system can be configured to control a speed of each electrical rotor on an individual basis to control a direction of flight of the aircraft. The aircraft can further include an engine coupled to the frame, the engine being configured to combust a combustible fuel to generate thrust.

Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.

Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.

Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.

Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.

Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.

Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.

Abstract: A latency reduction method for read operations of an array of N disk storage devices (210) having n disk storage devices (210A-210H) for data storage and p of disk storage devices (210I, 210J) for storing parity data is provided. Utilizing the parity generation engine's (230) fault tolerance of for a loss of valid data from at least two of the N disk storage devices (210A-210J), the integrity of the data is determined when N?1 of the disk storage devices (210A-210J) have completed executing a read command. If the data is determined to be valid, the missing data of the Nth disk storage device is reconstructed and the data transmitted to the requesting processor (10). By that arrangement the time necessary for the Nth disk storage device to complete execution of the read command is saved, thereby improving the performance of memory system (200).

Abstract: A latency reduction method for read operations of an array of N disk storage devices (210) having n disk storage devices (210A-210H) for data storage and p of disk storage devices (210I, 210J) for storing parity data is provided. Utilizing the parity generation engine's (230) fault tolerance of for a loss of valid data from at least two of the N disk storage devices (210A-210J), the integrity of the data is determined when N?1 of the disk storage devices (210A-210J) have completed executing a read command. If the data is determined to be valid, the missing data of the Nth disk storage device is reconstructed and the data transmitted to the requesting processor (10). By that arrangement the time necessary for the Nth disk storage device to complete execution of the read command is saved, thereby improving the performance of memory system (200).