Patents by Inventor Rivka Matosevich
Rivka Matosevich 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: 10439927Abstract: Aspects of the present disclosure relate to transmitting prioritized path data to a device based on a set of topology rules and metrics associated with a storage target. A storage target path discovery request is received from the device. In response to the storage target path discovery request, metrics associated with the storage target are collected. Based on the collected metrics, available paths to the storage target are identified. A set of topology rules are then determined. Based on the topology rules and the collected metrics, a subset of available paths are selected. The subset of available paths are then prioritized into prioritized path data. The prioritized path data is then stored and transmitted to the device.Type: GrantFiled: January 31, 2018Date of Patent: October 8, 2019Assignee: International Business Machines CorporationInventors: Zah Barzik, Alon Marx, Rivka Matosevich, Osnat Shasha, Anna Stopel
-
Patent number: 10430281Abstract: Embodiments for space-efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time, are provided. Data is physically copied form the source to a repository to create a physical copy, and a data mapping is created that associates the physical copy with a most recent target copy.Type: GrantFiled: October 25, 2016Date of Patent: October 1, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Anan Marie, Rivka Matosevich-Mayraz
-
Publication number: 20190294346Abstract: A data handling system includes multiple storage devices that each have a limited number of write and erase iterations. In one scheme, a deterministic endurance delta is created between a storage device (benchmark storage device), and the other storage devices so that the benchmark storage device has less endurance than the other storage devices. The benchmark storage device will likely reach endurance failure prior to the other storage devices and the probability of non-simultaneous endurance failure increases. In another scheme, a deterministic endurance delta is created between each of the storage devices so that each of the storage devices have a different endurance level than the other storage devices. By implementing the endurance delta simultaneous endurance failures of the storage devices may be avoided.Type: ApplicationFiled: March 26, 2018Publication date: September 26, 2019Inventors: Zah Barzik, Ramy Buechler, Maxim Kalaev, Michael Keller, Amit Margalit, Rivka Matosevich
-
Publication number: 20190288933Abstract: Aspects of the present disclosure relate to transmitting prioritized path data to a device based on a set of topology rules and metrics associated with a storage target. A storage target path discovery request is received from the device. In response to the storage target path discovery request, metrics associated with the storage target are collected. Based on the collected metrics, available paths to the storage target are identified. A set of topology rules are then determined. Based on the topology rules and the collected metrics, a subset of available paths are selected. The subset of available paths are then prioritized into prioritized path data. The prioritized path data is then stored and transmitted to the device.Type: ApplicationFiled: June 3, 2019Publication date: September 19, 2019Inventors: Zah Barzik, Alon Marx, Rivka Matosevich, Osnat Shasha, Anna Stopel
-
Publication number: 20190278650Abstract: A mechanism is provided in a data processing system comprising a processor and a memory, the memory comprising instructions that are executed by the processor to specifically configure the processor to implement an initiator entity in a symmetric split-direction connection. The initiator entity generates a custom keepalive command and sends the custom keepalive command to a target entity via the symmetric split-direction connection. Responsive to the initiator entity determining a number of consecutive acknowledgement commands received in response to custom keepalive commands exceed a first threshold, the initiator entity reports the symmetric split-direction connection as sufficient. Responsive to the initiator entity determining a second number of consecutive keepalive commands sent without receiving an acknowledgement is greater than a second threshold, the initiator entity reports the symmetric split-direction connection as insufficient.Type: ApplicationFiled: March 6, 2018Publication date: September 12, 2019Inventors: Kobi Beifus, Dan Ben-Yaacov, Ofer Leneman, Amit Margalit, Rivka Matosevich, Tamar Shacked, Ovad Somech
-
Publication number: 20190238446Abstract: Aspects of the present disclosure relate to transmitting prioritized path data to a device based on a set of topology rules and metrics associated with a storage target. A storage target path discovery request is received from the device. In response to the storage target path discovery request, metrics associated with the storage target are collected. Based on the collected metrics, available paths to the storage target are identified. A set of topology rules are then determined. Based on the topology rules and the collected metrics, a subset of available paths are selected. The subset of available paths are then prioritized into prioritized path data. The prioritized path data is then stored and transmitted to the device.Type: ApplicationFiled: January 31, 2018Publication date: August 1, 2019Inventors: Zah Barzik, Alon Marx, Rivka Matosevich, Osnat Shasha, Anna Stopel
-
Publication number: 20190138211Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include identifying, in a storage system including multiple storage devices having respective sets of storage regions, respective default low storage region thresholds that are used for garbage collection. For each given storage region, a time threshold and an alternative low storage region threshold greater than the default low storage region threshold for the given storage device are defined. While processing input/output operations for each given storage device, a count of unused storage regions in the given storage device is maintained, a timer is initialized, and upon the timer matching the time threshold for the given storage device, a garbage collection operation is initiated. In some embodiments, processing the input/output operations includes using a log-structured array format.Type: ApplicationFiled: September 20, 2018Publication date: May 9, 2019Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Nikolas IOANNOU, Ioannis KOLTSIDAS, Amit MARGALIT, Rivka MATOSEVICH
-
Patent number: 10114701Abstract: Embodiments for space-efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time, are provided. Data is physically copied form the source to a repository to create a physical copy, and a data mapping is created that associates the physical copy with a most recent target copy.Type: GrantFiled: January 28, 2011Date of Patent: October 30, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Anan Marie, Rivka Matosevich-Mayraz
-
Publication number: 20170039107Abstract: Embodiments for space-efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time, are provided. Data is physically copied form the source to a repository to create a physical copy, and a data mapping is created that associates the physical copy with a most recent target copy.Type: ApplicationFiled: October 25, 2016Publication date: February 9, 2017Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Anan MARIE, Rivka MATOSEVICH-MAYRAZ
-
Patent number: 9514139Abstract: Embodiments for space-efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time, are provided. Data is physically copied form the source to a repository to create a physical copy, and a data mapping is created that associates the physical copy with a most recent target copy.Type: GrantFiled: February 28, 2013Date of Patent: December 6, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Anan Marie, Rivka Matosevich-Mayraz
-
Patent number: 8418159Abstract: An apparatus for optimizing a transaction comprising an initial sequence of computer operations, the apparatus includes a processing unit which identifies one or more idempotent operations comprised within the initial sequence, and which reorders the initial sequence to form a reordered sequence comprising a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations, the second sub-sequence comprising only the one or more idempotent operations.Type: GrantFiled: November 29, 2009Date of Patent: April 9, 2013Assignee: SAP AGInventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
-
Publication number: 20120197842Abstract: A computer implemented method for a space efficient cascading point-in-time copying of source data by creating a plurality of cascading point-in-time target copies, the target copies being created at different points in time. The method includes physically copying data from the source data to a repository to create a physical copy, and creating a data mapping that associates the physical copy with a most recent target copy. The method may be implemented in either of computer hardware configured to perform the method and computer software embodied in a non-transitory, tangible, computer-readable storage medium. Also disclosed are a corresponding computer program product and data processing system.Type: ApplicationFiled: January 28, 2011Publication date: August 2, 2012Applicant: International Business Machines CorporationInventors: Anan Marie, Rivka Matosevich-Mayraz
-
Publication number: 20100077398Abstract: An apparatus for optimizing a transaction comprising an initial sequence of computer operations, the apparatus includes a processing unit which identifies one or more idempotent operations comprised within the initial sequence, and which reorders the initial sequence to form a reordered sequence comprising a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations, the second sub-sequence comprising only the one or more idempotent operations.Type: ApplicationFiled: November 29, 2009Publication date: March 25, 2010Applicant: International Business Machines CorporationInventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
-
Patent number: 7661099Abstract: A method for optimizing a transaction consisting of an initial sequence of computer operations, the method including identifying one or more idempotent operations in the initial sequence. The method further includes reordering the initial sequence to form a reordered sequence consisting of a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations. The second sub-sequence has only the one or more idempotent operations.Type: GrantFiled: June 29, 2004Date of Patent: February 9, 2010Assignee: International Business Machines CorporationInventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
-
Patent number: 7107396Abstract: A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.Type: GrantFiled: October 31, 2003Date of Patent: September 12, 2006Assignee: International Business Machines CorporationInventors: Michael Factor, Rivka Matosevich, Sivan Tal
-
Publication number: 20050289548Abstract: A method for optimizing a transaction consisting of an initial sequence of computer operations, the method including identifying one or more idempotent operations in the initial sequence. The method further includes reordering the initial sequence to form a reordered sequence consisting of a first sub-sequence of the computer operations followed by a second sub-sequence of the computer operations. The second sub-sequence has only the one or more idempotent operations.Type: ApplicationFiled: June 29, 2004Publication date: December 29, 2005Applicant: International Business Machines CorporationInventors: Eitan Farchi, Shachar Fienblit, Amiram Hayardeny, Rivka Matosevich, Ifat Nuriel, Sheli Rahav, Dalit Tzafrir
-
Publication number: 20050278391Abstract: Techniques are provided for performing a copy operation. A fast reverse restore command indicating a new source and a new target is received, wherein the new source is an original target and the new target is an original source. A synchronous scan is performed on the new target. A new target structure associated with the new target is updated using a new source structure associated with the new source. Techniques are also provided for performing a copy operation in which a fast reverse restore command is received after an instant virtual copy has been performed from a new target to a new source and wherein the fast reverse restore command is performed before a background copy has been performed by the instant virtual copy.Type: ApplicationFiled: May 27, 2004Publication date: December 15, 2005Inventors: Gail Spear, Michael Factor, Rivka Matosevich, Shachar Fienblit, Sheli Rahav, Robert Bartfai, Dalit Tzafrir, Ifat Nuriel
-
Publication number: 20050097266Abstract: A system for managing variable sized pages of possibly non contiguous blocks in a Non-Volatile-Storage (NVS) for attaining a consistent NVS that survives malfunction events. Each page includes a self describing block or linked list of self describing blocks. the system includes: Volatile Storage storing auxiliary modules, means for performing an atomic “create a new page” procedure. Means for performing an atomic write “add block” procedure for adding a possibly non contiguous block to a page. The newly added block has a back pointer to a previous block in the page. Means for performing a “delete page” procedure for deleting all blocks in a page. Means for performing a recovery procedure for rolling backward the add block procedure and rolling forward the delete page procedure, in case of malfunction event, thereby attaining consistent NVS.Type: ApplicationFiled: October 31, 2003Publication date: May 5, 2005Applicant: International Business Machines CorporationInventors: Michael Factor, Rivka Matosevich, Sivan Tal