Abstract: A method for more effectively distributing the I/O workload in a data replication system is disclosed herein. In selected embodiments, such a method may include generating an I/O request and identifying a storage resource group associated with the I/O request. In the event the I/O request is associated with a first storage resource group, the I/O request may be directed to a first storage device and a copy of the I/O request may be mirrored from the first storage device to a second storage device. Alternatively, in the event the I/O request is associated with a second storage resource group, the I/O request may be directed to a second storage device and a copy of the I/O request may be mirrored from the second storage device to the first storage device.

Abstract: Disclosed are a system, a method, and a computer program product to provide for the optimization of the output transfer load balance between the peer computers transferring data to one or more storage devices. The peer computers receive, organize and transfer the data to storage devices. The data set is composed of a plurality of data transfers. After an initial division of the data transfers between the two peers, each peer will have assigned responsibility for a number of data transfers. If the one of the peer computers completes offloading transactions earlier than the other peer, then the peer that is still transferring data will employ the other peer to execute a portion of the remaining data transfers. The operation of the system is symmetrical in that either peer may assist the other peer depending upon which peer has idle time.

Abstract: Disclosed are a system, a method, and a computer program product to provide for the optimization of the output transfer load balance between the peer computers transferring data to one or more storage devices. The peer computers receive, organize and transfer the data to storage devices. The data set is composed of a plurality of data transfers. After an initial division of the data transfers between the two peers, each peer will have assigned responsibility for a number of data transfers. If the one of the peer computers completes offloading transactions earlier than the other peer, then the peer that is still transferring data will employ the other peer to execute a portion of the remaining data transfers. The operation of the system is symmetrical in that either peer may assist the other peer depending upon which peer has idle time.

Abstract: Disclosed are a system, a method, and a computer program product to provide for the optimization of the output transfer load balance between the peer computers transferring data to one or more storage devices. The peer computers receive, organize and transfer the data to storage devices. The data set is composed of a plurality of data transfers. After an initial division of the data transfers between the two peers, each peer will have assigned responsibility for a number of data transfers. If the one of the peer computers completes offloading transactions earlier than the other peer, then the peer that is still transferring data will employ the other peer to execute a portion of the remaining data transfers. The operation of the system is symmetrical in that either peer may assist the other peer depending upon which peer has idle time.

Abstract: Disclosed are a system, a method, and a computer program product to optimize the overall latency of transferring data from peer computers to storage devices. The latency optimization occurs after a group of data is received and organized by the peer computers. The average amount of time to transfer data to each particular storage device from the peer computers is used to determine the assignment of data transfers between the peer computers. Each peer computer maintains continuously updated measurements of the average time to transfer data to each storage device. The updated transfer time measurements are based upon a moving average with adjustable weighting of past and present measurements enabling the system to adapt to changing conditions.

Abstract: Disclosed is a system, method, and article of manufacture for maintaining consistent copies of data between a primary site and a secondary site. One or more backup components receive backup messages from the primary site describing transactions. Transactions received from the primary site at the backup components are referred to as “inbound transactions.” The backup components associate these inbound transactions with an identifier such that all transactions associated with a certain identifier comprise all of the activity on the consistency group for a certain period of time. The backup captain periodically notifies the backup components to pause (i.e., stop receiving inbound transactions temporarily), and once all backup components indicate that they have paused, the backup components are notified to resume receiving transactions and associate the newly received transactions with a new identifier. At the same time, the backup components are sending transactions to the secondary storage devices.

Abstract: Disclosed are a system, a method, and a computer program product to efficiently create consistent transaction sets to maintain one or more copies of data at different data storage sites. All transactions sent to a primary backup appliance during a consistent transaction set creation interval are formed into a consistent transaction set by efficiently adding new transactions as they are received and removing unnecessary transfers as newer versions arrive. When the creation interval has expired, the complete consistent transaction set is transferred to a secondary backup appliance to be used to update a consistent backup copy of the primary site data. For each consistent transaction set, there will be a tree data structure (a search tree) created that contains the addressing information for all of the blocks of data in the consistent transaction set.

Abstract: Disclosed is a system, method, and article of manufacture for maintaining data integrity. A frequency for creating consistent transactions sets is negotiated. A consistent transactions set creation duration is negotiated. At an interval determined by the frequency, during the consistent transactions set creation duration, processing of a first consistent transactions set is completed, while processing of a second consistent transactions set is delayed until the end of the consistent transactions set creation duration. After the first consistent transactions set have been offloaded to secondary storage, consistent copies of data may be created.

Abstract: Disclosed is a system, method, and article of manufacture for maintaining data integrity. A frequency for creating consistent transactions sets is negotiated. A consistent transactions set creation duration is negotiated. At an interval determined by the frequency, during the consistent transactions set creation duration, processing of a first consistent transactions set is completed, while processing of a second consistent transactions set is delayed until the end of the consistent transactions set creation duration. After the first consistent transactions set have been offloaded to secondary storage, consistent copies of data may be created.

Abstract: Disclosed is a system, method, and article of manufacture for maintaining consistent copies of data between a primary site and a secondary site.

Abstract: The invention provides a glue-on closure for a composite can or the like that affords an original hermetic seal. A tamper-evident tear band allows the closure to be conveniently opened. Separate end wall and sidewall parts of the closure are configured to provide reclosability with a surface-to-surface contact plug fit.