Abstract: A data migration system supports a low-latency and reduced overhead data storage protocol for data storage sharing in a non-collision fashion which does not require inter-communication and permanent arbitration between data storage controllers to decide on the data placement/routing. The multiple data fragments of data sets are prevented from routing to the same storage devices by a multi-step selection protocol which selects (in a first phase of the selection routine) a healthy highest ranked drive enclosure, and further selects (in a second phase of the selection routine) a healthy highest-ranked data storage controller residing in the selected drive enclosure, for routing data fragments to different storage pools assigned to the selected data storage devices for exclusive “writing” and data modification. The selection protocol also contemplates various failure scenarios in a data placement collision free manner.

Abstract: The system and routine for data caching leverages the properties of Network-Attached Non-Volatile Memories (NANVMs) to provide virtualized secure node-local storage services to the network users with reduced data movement across the NANVMs. The caching routine reserves storage resources (storage partitions) on NANVM devices, migrates data required for the target application execution to the allocated storage partitions, and directs the network clients to dynamically “mount” to the storage partitions based on application data requirements. Only those clients and applications that present valid credentials and satisfactory computing capabilities can access the data in the specific storage partitions. Several clients can have an access to the same storage partitions without duplication or replicating the data. A Global Data Indexing sub-system supports the efficient operation of the subject system.

Abstract: Variable Redundancy Distributed (VRD) RAID controller in a data storage environment contains embedded RAID logic permitting to choose and compute a desired redundancy coding scheme from a plurality thereof pre-programmed and embedded in a Compute Engine in the VRD RAID controller. “Write” or “Read” requests which are received from data generating entities, contain information identifying a type of the redundancy coding scheme of interest. The controller decodes the request, and automatically applies the desired computation to the incoming data without burdening the CPU with the computational activity. The variable redundancy computational ability of the subject systems provides an extremely versatile and flexible tool for RAID operations.

Abstract: Method and system for data migration between data generating entities and data storage devices protected by de-clustered RAID algorithm are enhanced by dynamically controlling the I/O activity towards the data storage devices (NVM devices) based on their remaining lifespan (health) with the goal to prevent multiple devices selected for writing a parity stripe information from simultaneous failures. This feature is rendered by polling the remaining health of NVM devices in the RAID pool, computing a weighted lifespan for each NVM device, comparing the latter to an average of all NVM devices in the pool, and adjusting the I/O activity towards the NVM device of interest accordingly. If the weighted lifespan exceeds the average lifespan in the pool, the allowed I/O activity is increased, and if the weighted lifespan is below the average for the pool, then the device in question is sent less “writes”.

Abstract: In the data storage system the storage area network performs XOR operations on incoming data for parity generation without buffering data through a centralized RAID engine or processor. The hardware for calculating the XOR data is distributed to incrementally calculate data parity in parallel across each data channel and may be implemented as a set of FPGAs with low bandwidths to efficiently scale as the amount of storage memory increases. A host adaptively appoints data storage controllers in the storage area network to perform XOR parity operations on data passing therethrough. The system provides data migration and parity generation in a simple and effective matter and attains a reduction in cost and power consumption.

Abstract: A seed handling tool includes a handle connected to a working body. The working body includes a working surface, which further includes a plurality of seed retention points. A seed retention source is provided to allow the seed handling tool to pick up and retain seeds at the seed retention points. In some embodiments, the seeds may also be released from the seed retention points. A method for retaining a plurality of seeds by the seed handling tool includes moving the seed handling tool to a position where the working surface is adjacent to a plurality of seeds, and picking up and retaining seeds at a plurality of seed retention points fixed at the working surface. In some embodiments, the method may also include releasing the plurality of seeds from the seed retention points.

Abstract: A data storage system is implemented with an active power monitoring and control performed by a control node elected among a number of nodes. A real-time power monitoring information is supplied to the control node from, a power monitoring logic residing at each device in the system. The devices in the data storage system are pre-allocated with respective individual power budgets which are below the maximum power usage thereof. The power budgets of all the equipment cumulatively constitute a power budget assigned to the group of equipment. The control node controls dynamically and in real time power sharing between the plurality devices so that the devices with required power usage below the pre-allocated power budget can share their extra power credits with devices which are in need for extra power for performing its operation.

Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.

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 method is provided for bulk pollination of a plurality of plants. In various embodiments, the method includes collecting a plurality of known grains of pollen, loading the plurality of known grains of pollen into a bulk pollen distributing apparatus, sensing a target pollination location of each of the plurality of plants using an electronic sensor, and distributing the known grains of pollen to the plurality of plants with the bulk pollen distributing apparatus when the electronic sensor senses the target pollination location of each of the plants within a predefined proximity, thereby pollinating the plurality of plants. A plurality of plants may be prepared for controlled pollination by preventing pollination of the plurality of plants by an alternate pollen source. Known grains of pollen may be dispensed to create predetermined gamete crosses with known plants.

Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.

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: Distributed Compute Engine (DCE) memory controller in a data storage environment contains embedded logic and arithmetic functionality for Boolean logical and arithmetic operations. “Write” or “Read” requests which are received from data generating entities, contain a Physical Address field identifying an address of a data block to be retrieved from the external memory, and a Control bits field identifying a type of computational operation to be performed. The DCE memory controller decodes the request, and applies the desired compute operation autonomically to the contents of an external memory and/or the incoming data without burdening the CPU with the computational activity.

Abstract: The present data storage system employs a memory controller with embedded logic to selectively XOR incoming data with data written in the memory to generate XOR parity data. The memory controller automatically performs XOR operations on incoming data based upon the address range associated with the memory “write” request. The system provides data migration and parity generation in a simple and effective manner and attains reduction in cost and power consumption. The memory controller may be built on the basis of FPGAs, thus providing an economical and miniature system.

Abstract: A high throughput apparatus and method for gaining access to and extracting internal tissue or structure of interest from a seed or plurality of seed is disclosed. In one aspect, an apparatus utilizes means to expose the internal tissue or structure and means to separate at least some of the exposed internal tissue or structure for collection and evaluation. In one aspect, a method utilizes some force or action to expose the internal tissue or structure and some force or action to separate the internal tissue or structure.

Abstract: An automated high throughput apparatus, method and system for seed sampling is provided. The seed sampling system includes an ablation subsystem having a controlled cutting path and a seed handling subsystem comprising a staging system having a plurality of seed staging positions for staging a batch of seed in a sequential manner, and a carrier system for simultaneously presenting seed staging positions at the cutting path for removing a sample portion from each seed in the batch. A method of this invention includes providing ablation means having a controlled cutting path, automatically staging a batch of seed at a plurality of staging positions in a sequential manner, simultaneously presenting the batch of seed at the cutting path, and removing a sample portion from each seed in the batch.

Abstract: Apparatuses and methods for selecting one or more seeds from a group of seeds based on a predetermined characteristic of the selected seeds are provided. In various embodiments, the seeds are selected from multiple containers of seeds and re-configured into a single container for later use. The apparatus includes an array of seed selectors that expel the selected seeds from the corresponding compartments through contact with the compartments. A transfer member then directs each expelled seed to a cavity of a collection tray or into an envelope or other receptacle. A controller may run operation of the apparatus and associate the selected seeds with the cavities and/or receptacle into which they are deposited. In this way, numerous seeds may be automatically selected substantially simultaneously or in rapid succession and re-configured in a short period of time and with limited user intervention.

Abstract: The present invention is generally directed to a system and method for obtaining a test sample from a seed or seeds. The method generally includes placing at least one seed into a seed sampling chamber, breaking the seed into a plurality of seed particles inside the seed sampling chamber, placing a sampling element into the seed sampling chamber, and collecting at least a portion of the plurality of seed particles with the sampling element by attracting at least a portion of the seed particles to a surface of the sampling element or by forcing at least a portion of the seed particles into a feature of the sampling element. In some embodiments, the method further includes using a sampling element transfer device to transfer the sampling element to an extraction well, which may be used to extract DNA or proteins from the collected portion of seed particles.