Patents by Inventor Shay H. Akirav
Shay H. Akirav has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8266102Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement. If, during a subsequent recovery process, the dirty state is not yet cleared, the replicated component is deemed ineligible for participation in a full restoration operation.Type: GrantFiled: May 26, 2010Date of Patent: September 11, 2012Assignee: International Business Machines CorporationInventors: Shay H. Akirav, Evgeny Budilovsky, Elena Drobchenko, Aharon Lazar, Ofer Leneman, Itay Maoz, Gil E. Paz
-
Publication number: 20120226937Abstract: Communication is arrested between a source data entity and a replicated data entity at a location declared in a DR mode. The DR mode is negotiated to a central replication management component as a DR mode entry event. The DR mode entry event is distributed, by the central replication management component, to each member in a shared group. The DR mode is enforced using at least one replication policy.Type: ApplicationFiled: May 11, 2012Publication date: September 6, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Dov N. HEPNER, Ofer LENEMAN, Gil E. PAZ, Tzafrir Z. TAUB
-
Publication number: 20120226660Abstract: Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement. If, during a subsequent recovery process, the dirty state is not yet cleared, the replicated component is deemed ineligible for participation in a full restoration operation.Type: ApplicationFiled: May 4, 2012Publication date: September 6, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Evgeny BUDILOVSKY, Elena DROBCHENKO, Aharon LAZAR, Ofer LENEMAN, Itay MAOZ, Gil E. PAZ
-
Publication number: 20120221820Abstract: Visibility of a data storage entity on a first storage system is switched to a replicated data storage entity on a second storage system. Data from the data storage entity is replicated from the first storage system to the second storage system using a common serial number. The data storage entity is hidden from the first storage system by concealing the common serial number. An ejection of the data storage entity from the first storage system is automated, and the replicated data storage entity is introduced to the second storage system.Type: ApplicationFiled: May 8, 2012Publication date: August 30, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Shiri ALEXANDER, Yariv BACHAR, Evgeny BUDILOVSKY, Elena DROBCHENKO, Asaf K. EKSHTEIN, Dov N. HEPNER, Aharon LAZAR, Ofer LENEMAN, Itay MAOZ, Gil E. PAZ, Tzafrir Z. TAUB, Neville YATES
-
Publication number: 20120221818Abstract: A calculated factoring ratio is determined as a weighted ratio of current nominal data to physical data based on at least one storage capacity threshold and a used storage space currently physically consumed by one of backup and replication data. A maximal nominal estimated space in the computing storage environment is calculated. A remaining space, defined as the maximal nominal estimated space minus a current nominal space in the computing storage environment, is calculated. If the remaining space is one of equal and less than a user-configured reservation space for backup operations, data replication operations are accepted and stored in the computing storage environment.Type: ApplicationFiled: May 4, 2012Publication date: August 30, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Aviv CARO, Elena DROBCHENKO, Asaf K. EKSHTEIN, Dov N. HEPNER, Ofer LENEMAN, Tzafrir Z. TAUB
-
Publication number: 20120215748Abstract: A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism is adapted to limit a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and further adapted to operate on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification.Type: ApplicationFiled: April 27, 2012Publication date: August 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Ron ASHER, Yariv BACHAR, Lior KLIPPER, Oded SONIN
-
Publication number: 20120215999Abstract: A replication synchronization table (RST) is configured for the source instance. The RST is adapted for recording compacted information for at least one of a truncate and an erase operation applied on the source instance. The RST of the source instance is updated at a source component with the compacted information. The updated RST is transmitted from the source instance to the replicated instance. Based on the RST of the source instance and the RST of the replicated instance, data representative of a most recent position on the source component from which data should be transmitted to a replicated component to achieve a full synchronization is determined.Type: ApplicationFiled: April 27, 2012Publication date: August 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Elena DROBCHENKO, Samuel KRIKLER, Aharon LAZAR, Itay MAOZ, Dan MELAMED, Gil E. PAZ
-
Publication number: 20120158671Abstract: Methods, computer systems, and computer program products for processing data a computing environment are provided. The computer environment for data deduplication storage receives a plurality of write operations for deduplication storage of the data. The data is buffered in a plurality of buffers with overflow temporarily stored to a memory hierarchy when the data received for deduplication storage is sequential or non sequential. The data is accumulated and updated in the plurality of buffers per a data structure, the data structure serving as a fragment map between the plurality of buffers and a plurality of user file locations. The data is restructured in the plurality of buffers to form a complete sequence of a required sequence size. The data is provided as at least one stream to a stream-based deduplication algorithm for processing and storage.Type: ApplicationFiled: December 16, 2010Publication date: June 21, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Itai TZUR, Shay H. AKIRAV, Ron EDELSTEIN, Michael HIRSCH, Ariel J. ISH-SHALOM, Liran LOYA
-
Publication number: 20120096306Abstract: Various embodiments for disaster recovery (DR) failback in a computing environment by a processor device are provided. Pursuant to execution of a predetermined failback policy, if a storage device is not preexistent in a source storage system operable in the computing environment, and an owner of the storage device is one of a DR storage system and a storage system having previously withdrawn from a replication grid, and the DR storage system has authorization to transfer ownership of the storage device by a replacement operation, an instance of the storage device is replicated to the source storage system to generate a replicated instance of the storage device on the source storage system, and ownership of the storage device is designated as the source storage system for each of the instance and the replicated instance of the storage device.Type: ApplicationFiled: October 13, 2010Publication date: April 19, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Evgeny BUDILOVSKY, Aviv CARO, Elena DROBCHENKO, Dov N. HEPNER, Aharon LAZAR, Ofer LENEMAN, Itay MAOZ, Gil E. PAZ, Tzafrir Z. TAUB
-
Publication number: 20120089866Abstract: Various embodiments for disaster recovery (DR) production takeover in a computing environment by a processor device are provided. If, for a designated storage system operable in the computing environment, a takeover operation may be executed, and a DR storage system has validly replaced the designated storage system using a replacement process, a withdrawal of a DR mode of operation is performed, and ownership of at least one storage device operable in the computing environment is transferred to the DR storage system. The replacement process authorizes the DR storage system to transfer the ownership while withdrawn from the DR mode of operation.Type: ApplicationFiled: October 11, 2010Publication date: April 12, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Aviv CARO, Dov N. HEPNER, Ofer LENEMAN, Gil E. PAZ, Tzafrir Z. TAUB
-
Publication number: 20120047338Abstract: Various embodiments for switching visibility between virtual data storage entities in a data storage environment using a processor device are provided. Visibility of a data storage entity on a first storage system is switched to a replicated data storage entity on a second storage system. Data from the data storage entity is replicated from the first storage system to the second storage system using a common serial number. The data storage entity is hidden from the first storage system by concealing the common serial number. An ejection of the data storage entity from the first storage system is automated, and the replicated data storage entity is introduced to the second storage system.Type: ApplicationFiled: August 20, 2010Publication date: February 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Shiri ALEXANDER, Yariv BACHAR, Evgeny BUDILOVSKY, Elena DROBCHENKO, Asaf K. EKSHTEIN, Dov N. HEPNER, Aharon LAZAR, Ofer LENEMAN, Itay MAOZ, Gil E. PAZ, Tzafrir Z. TAUB, Neville YATES
-
Publication number: 20120047392Abstract: Various embodiments for disaster recovery (DR) replication throttling in a computing environment by a processor device are provided. Communication is arrested between a source data entity and a replicated data entity at a location declared in a DR mode. The DR mode is negotiated to a central replication management component as a DR mode entry event. The DR mode entry event is distributed, by the central replication management component, to each member in a shared group. The DR mode is enforced using at least one replication policy.Type: ApplicationFiled: August 18, 2010Publication date: February 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Dov N. HEPNER, Ofer LENEMAN, Gil E. PAZ, Tzafrir Z. TAUB
-
Publication number: 20110295797Abstract: Various embodiments for synchronization of source and replicated instances of sequential access storage components are provided. Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement.Type: ApplicationFiled: May 26, 2010Publication date: December 1, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Evgeny BUDILOVSKY, Elena DROBCHENKO, Aharon LAZAR, Ofer LENEMAN, Itay MAOZ, Gil E. PAZ
-
Publication number: 20110289290Abstract: Various embodiments for space reservation in a deduplication system are provided. A calculated factoring ratio is determined as a weighted ratio of current nominal data to physical data based on at least one storage capacity threshold and a used storage space currently physically consumed by one of backup and replication data. A maximal nominal estimated space in the computing storage environment is calculated. A remaining space, defined as the maximal nominal estimated space minus a current nominal space in the computing storage environment, is calculated. If the remaining space is one of equal and less than a user-configured reservation space for backup operations, data replication operations are accepted and stored in the computing storage environment.Type: ApplicationFiled: May 21, 2010Publication date: November 24, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Aviv CARO, Elena DROBCHENKO, Asaf K. EKSHTEIN, Dov N. HEPNER, Ofer LENEMAN, Tzafrir Z. TAUB
-
Publication number: 20110273982Abstract: Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a single congestion metric is determined from a sampling of a plurality of combined deduplicated data processing congestion statistics in a number of active deduplicated data processes. The congestion limit is calculated from a comparison of the single congestion metric to a congestion target setpoint, the congestion target setpoint being a virtual dimension setpoint and the congestion limit being a manipulated variable. The number of active deduplicated data processes is compared to the congestion limit. If the number of active deduplicated data processes is less than the congestion limit, a new deduplicated data process is spawned.Type: ApplicationFiled: May 4, 2010Publication date: November 10, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Asaf LEVY, Ehud MEIRI
-
Publication number: 20110040728Abstract: Various embodiments for replicating deduplicated data using a processor device are provided. A block of the deduplicated data, created in a source repository, is assigned a global block identification (id) unique in a grid set inclusive of the source repository. The global block id is generated using at least one unique identification value of the block, a containing grid of the grid set, and the source repository. The global block id is transmitted from the source repository to a target repository. If the target repository determines the global block id is associated with an existing block of the deduplicated data located within the target repository, the block is not received by the target repository during a subsequent replication process.Type: ApplicationFiled: August 11, 2009Publication date: February 17, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Lior ARONOVICH, Ron ASHER, Yariv BACHAR, Ariel J. ISH-SHALOM, Ofer LENEMAN
-
Publication number: 20110040942Abstract: Various embodiments for synchronization of source and replicated instances of sequential access storage components in a computing environment by a processor device are provided. A replication synchronization table (RST) is configured for the source instance. The RST is adapted for recording compacted information for at least one of a truncate and an erase operation applied on the source instance. The RST of the source instance is updated at a source component with the compacted information. The updated RST is transmitted from the source instance to the replicated instance. Based on the RST of the source instance and the RST of the replicated instance, data representative of a most recent position on the source component from which data should be transmitted to a replicated component to achieve a full synchronization is determined.Type: ApplicationFiled: August 11, 2009Publication date: February 17, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Yariv BACHAR, Elena DROBCHENKO, Samuel KRIKLER, Aharon LAZAR, Itay MAOZ, Dan MELAMED, Gil E. PAZ
-
Publication number: 20110040951Abstract: Various embodiments for deduplicated data processing rate control using at least one processor device in a computing environment are provided. A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times. The rate control mechanism is adapted to limit a data flow rate based on a penalty acquired during a last processing of one of the plurality of chunks in a retroactive manner, and further adapted to operate on at least one vector representation of at least one limit specification to accommodate a variety of available dimensions corresponding to the at least one limit specification.Type: ApplicationFiled: August 11, 2009Publication date: February 17, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Shay H. AKIRAV, Ron ASHER, Yariv BACHAR, Lior KLIPPER, Oded SONIN