Abstract: The present disclosure provides novel compositions and methods for collectively transforming or genetically modifying a population of distinct germplasm of different germplasms or having different genotypes. The compositions of the present disclosure may include a population of distinct germplasm, such as embryo explants, and a heterologous polynucleotide molecule, a ribonucleoprotein, or a site-specific nuclease. The methods of the present disclosure may include one or more steps of explant preparation, explant rehydration, Rhizobiales bacterium inoculation and co-culture or particle bombardment, bud induction, extended bud induction, and/or regeneration or development of genetically modified plants or plant parts. The methods provided herein may include transforming at least one plant cell of the embryo explants with a heterologous polynucleotide.

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for transferring data items and locks associated with the data items from one node to another.

Abstract: A method for locking resources, including: receiving, by an accelerator, a first request from a first client to lock a first resource; evaluating, by a computer processor of a server, a hash function using an identifier of the first resource as an input to the hash function; identifying, by the computer processor and based on evaluating the hash function, a first hash bucket in a shared memory residing in a physical memory of the server; detecting that the first hash bucket is occupied; and sending the first request to a master lock monitor residing in a user space of the server based at least on detecting that the first hash bucket is occupied.

Abstract: Magnetic locking mechanisms, linear movement generators, and holders are disclosed. According to an aspect, a magnetic locking mechanism includes a first component defining a first recess. The magnetic locking mechanism also includes a second component defining a second recess. Further, the magnetic locking mechanism includes a third component being attached to a first magnet and capable of being positioned in a first position such that the third component is partially within the first and second recesses for holding the first and second components together in at least one direction. Further, the third component is capable of being positioned in a second position such that the third component is outside of the first recess.

Abstract: A method and computer-readable storage representing resources in a cluster by a plurality of attribute-value pairs that together are part of a “resource profile,” in which each attribute-value pair defines all, or a portion of, a management policy that applies to the resource. A clusterware manager configures a resource according to the resource profile, and follows a resource profile syntax that specifies a runtime value for the resource in which an actual value is substituted at runtime.

Abstract: A cluster management system dynamically assigns a category to a server node based on the server node's attributes. The system can detect a change in value of a server attribute of a first server node. Then, in response to detecting the change in value of the server attribute, the system identifies a plurality of server attributes for the first server node, and dynamically assigns to the first server node a category that matches the server attributes. Further, the system can add the server node to a server pool that has a matching category with the server node.

Abstract: A method for offloading computation flexibly to a communication adapter includes receiving a message that includes a procedure image identifier associated with a procedure image of a host application, determining a procedure image and a communication adapter processor using the procedure image identifier, and forwarding the first message to the communication adapter processor configured to execute the procedure image. The method further includes executing, on the communication adapter processor independent of a host processor, the procedure image in communication adapter memory by acquiring a host memory latch for a memory block in host memory, reading the memory block in the host memory after acquiring the host memory latch, manipulating, by executing the procedure image, the memory block in the communication adapter memory to obtain a modified memory block, committing the modified memory block to the host memory, and releasing the host memory latch.

Abstract: A cluster management system dynamically assigns a category to a server node based on the server node's attributes. The system can detect a change in value of a server attribute of a first server node. Then, in response to detecting the change in value of the server attribute, the system identifies a plurality of server attributes for the first server node, and dynamically assigns to the first server node a category that matches the server attributes. Further, the system can add the server node to a server pool that has a matching category with the server node.

Abstract: A method for locking resources, including: receiving, by an accelerator, a first request from a first client to lock a first resource; evaluating, by a computer processor of a server, a hash function using an identifier of the first resource as an input to the hash function; identifying, by the computer processor and based on evaluating the hash function, a first hash bucket in a shared memory residing in a physical memory of the server; detecting that the first hash bucket is occupied; and sending the first request to a master lock monitor residing in a user space of the server based at least on detecting that the first hash bucket is occupied.

Abstract: A method for offloading computation flexibly to a communication adapter includes receiving a message that includes a procedure image identifier associated with a procedure image of a host application, determining a procedure image and a communication adapter processor using the procedure image identifier, and forwarding the first message to the communication adapter processor configured to execute the procedure image. The method further includes executing, on the communication adapter processor independent of a host processor, the procedure image in communication adapter memory by acquiring a host memory latch for a memory block in host memory, reading the memory block in the host memory after acquiring the host memory latch, manipulating, by executing the procedure image, the memory block in the communication adapter memory to obtain a modified memory block, committing the modified memory block to the host memory, and releasing the host memory latch.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for transferring data items and locks associated with the data items from one node to another.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: A method and computer-readable storage representing resources in a cluster by a plurality of attribute-value pairs that together are part of a “resource profile,” in which each attribute-value pair defines all, or a portion of, a management policy that applies to the resource. A clusterware manager configures a resource according to the resource profile, and follows a resource profile syntax that specifies a runtime value for the resource in which an actual value is substituted at runtime.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: Techniques are provided for managing access to resources that are shared by a cluster of nodes. One aspect of the invention is to require verification that a quorum is a valid quorum prior to enforcing the access rights specified by a node that is a member of the group of nodes holding the quorum. Further, the verification that a quorum is a valid quorum prior to enforcing access rights occurs only if the quorum associated with the specified access rights is suspected to be invalid.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: A composite resource is established that includes a plurality of members. Each of the members is capable of providing a comparable service. A coordinator monitors a state of each member of the composite resource. A component requests the service from the coordinator. The coordinator arranges for the service to be provided to the component by a particular member of the composite resource. When the particular member ceases to be active, the service is automatically provided to the component by another member in the composite resource. A state of the composite resource is maintained independently of the state of each member in the composite resource.