Patents by Inventor Yariv Bachar
Yariv Bachar 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).
-
Publication number: 20150154050Abstract: A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.Type: ApplicationFiled: February 10, 2015Publication date: June 4, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ron EDELSTEIN, Yariv BACHAR, Oded SONIN
-
Patent number: 9031911Abstract: For preserving past states of file system nodes, selective tuple versioning on a file system table is used by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system. A request is received for updating the node along with a node identification and associated attributes of the node needing to be updated. A second time value indicating the time of the updating is generated. The row for the node is duplicated into a new row in the file system table with an end time set equal to the second time value if the bit in the bitmap for the node is set. The row associated with the node is updated according to the update request.Type: GrantFiled: June 5, 2012Date of Patent: May 12, 2015Assignee: International Business Machines CorporationInventors: Yariv Bachar, Aviv Kuvent, Asaf Levy
-
Patent number: 9021486Abstract: A strictly increasing function is implemented to generate a plurality of unique creation stamps, each of the plurality of unique creation stamps increasing over time pursuant to the strictly increasing function. A new task to be placed with the plurality of tasks is labeled with a new unique creation stamp of the plurality of unique creation stamps. The one of the list of dismissal rules holds a minimal valid creation (MVC) stamp, which is updated when a dismissal action for the one of the list of dismissal rules is executed. The dismissal action acts to dismiss a selection of tasks over time due to continuous dispatch.Type: GrantFiled: August 19, 2010Date of Patent: April 28, 2015Assignee: International Business Machines CorporationInventors: Yariv Bachar, Ilai Harsgor-Hendin, Ehud Meiri, Oded Sonin
-
Patent number: 8972350Abstract: Selective tuple versioning is used on a file system providing file system snapshots using selective tuple versioning for maintaining the state of the file system. The selective tuple versioning works by adding a snapshot table to associate with a file system table by storing a timestamp and a snapshot identification (ID) relating to a snapshot created for preserving past nodes in the file system.Type: GrantFiled: June 5, 2012Date of Patent: March 3, 2015Assignee: International Business Machines CorporationInventors: Yariv Bachar, Aviv Kuvent, Asaf Levy
-
Patent number: 8959527Abstract: A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.Type: GrantFiled: November 5, 2013Date of Patent: February 17, 2015Assignee: International Business Machines CorporationInventors: Ron Edelstein, Yariv Bachar, Oded Sonin
-
Patent number: 8954985Abstract: A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.Type: GrantFiled: June 5, 2012Date of Patent: February 10, 2015Assignee: International Business Machines CorporationInventors: Ron Edelstein, Yariv Bachar, Oded Sonin
-
Publication number: 20150039766Abstract: In one embodiment, by way of example only, a resource threshold limits the resource usage of each of the multiplicity of clients. The resource threshold of each of the multiplicity of clients increases over time and decreases when the resources deplete and a resource request of a client is rejected. A subset of clients is created from the multiplicity of clients having a resource usage greater than the resource usage of the rejected client. A dynamic average of a normalized number of resources is calculated from the subset of clients. The resource threshold of each client from the subset of clients is decreased based on the dynamic average of the subset of clients, and further acquisition of resources is restricted from each client from the subset of clients in order to bring the resource usage of each of the subset of clients under the resource threshold.Type: ApplicationFiled: August 5, 2013Publication date: February 5, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yariv BACHAR, Ron EDELSTEIN, Alon HOROWITZ, Oded SONIN
-
Patent number: 8891473Abstract: Various embodiments for deduplicated data processing congestion control in a computing environment are provided. In one such embodiment, a congestion target setpoint is calculated using one of a proportional constant, an integral constant, and a derivative constant, wherein the congestion target setpoint is a virtual dimension setpoint. 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. A congestion limit is calculated from a comparison of the single congestion metric to the congestion target setpoint, the congestion limit being a manipulated variable. The congestion limit is compared to the number of active deduplicated data processes. If the number of active deduplicated data processes are less than the congestion limit, a new deduplicated data process of the number of active deduplicated data processes is spawned.Type: GrantFiled: November 9, 2012Date of Patent: November 18, 2014Assignee: International Business Machines CorporationInventors: Shay H. Akirav, Yariv Bachar, Asaf Levy, Ehud Meiri
-
Patent number: 8886908Abstract: A management of capacity types with different consumption policies for an object in a computing storage system is performed by updating a reference type bitmap in a segment-fragment table containing segments that reference fragments upon the creation of a segment for an object. A reference is created in an object-segment reference table, between the object and the segment, in compliance with a consumption policy upon the creation of one of the segments for the object. The reference types that reference the segment are removed upon deletion of the segment.Type: GrantFiled: June 5, 2012Date of Patent: November 11, 2014Assignee: International Business Machines CorporationInventors: Yariv Bachar, Johnny David, Asaf Levy, Elez Shenhar
-
Patent number: 8880482Abstract: 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 identifier (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 transmitted to the target repository during a subsequent replication process.Type: GrantFiled: January 2, 2013Date of Patent: November 4, 2014Assignee: International Business Machines CorporationInventors: Shay H. Akirav, Lior Aronovich, Ron Asher, Yariv Bachar, Ariel J. Ish-Shalom, Ofer Leneman
-
Publication number: 20140304476Abstract: For maintaining consistency for a cache that contains dependent objects in a computing environment, object dependencies for cached objects are managed by defining and maintaining object dependency lists for each one of the cached objects for identifying objects upon which the cached objects are dependent. Maintaining cache consistency for 2 types of cache eviction policies is supported by maintaining an object dependency lists for each one of the cached objects for identifying objects dependent upon the cached object. Each of the objects in an object dependency list is updated when the object is updated.Type: ApplicationFiled: April 3, 2013Publication date: October 9, 2014Inventors: Yariv BACHAR, Aviv KUVENT, Asaf LEVY, Konstantin MURADOV
-
Publication number: 20140280824Abstract: For efficient centralized stream initiation and retry control in a computing environment, using a centralized data streams management module for both managing when data streams should be opened and sent from a source location to a destination and for determining when to reattempt opening data streams sent from the source location to the destination after an nth number of consecutive failed attempts using an incrementing time calculation. The incrementing time calculation computes a dynamically calculated time period.Type: ApplicationFiled: March 14, 2013Publication date: September 18, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yariv BACHAR, Ron EDELSTEIN, Alon HOROWITZ, Oded SONIN
-
Patent number: 8806162Abstract: 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: GrantFiled: May 8, 2012Date of Patent: August 12, 2014Assignee: 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
-
Patent number: 8799596Abstract: 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: GrantFiled: August 20, 2010Date of Patent: August 5, 2014Assignee: International Business Machines CorporationInventors: Shay H. Akirav, Shiri Alexander, Yariv Bachar, Evgeny Budilovsky, Elena Drobchenko, Asaf K. Ekshtein, Dov N. Hepner, Aharon Lazar, Ofer Lenaman, Itay Maoz, Gil E. Paz, Tzafrir Z. Taub, Neville Yates
-
Publication number: 20140181832Abstract: For resource allocation of resources for a dual activity system, each of the dual activities may be started at a static quota and is allocated its respective static quota of resources, and determining which of the dual activities is a demanding dual activity. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. A reduced actual resource boundary for the demanding dual activity based on a multiplicative decrease of the dual activity's actual resource boundary is calculated, and the resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.Type: ApplicationFiled: February 26, 2014Publication date: June 26, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yariv BACHAR, Ron EDELSTEIN, Oded SONIN
-
Patent number: 8706994Abstract: 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) of a source instance is updated at a source component with the compacted information. 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: GrantFiled: January 17, 2013Date of Patent: April 22, 2014Assignee: International Business Machines CorporationInventors: Shay H. Akirav, Yariv Bachar, Elena Drobchenko, Samuel Krikler, Aharon Lazar, Itay Maoz, Dan Melamed, Gil E. Paz
-
Patent number: 8706698Abstract: A plurality of log processes are synchronized. Each is independently performed in parallel with one another, into a single set of log files. A line buffering mechanism of an operating system (OS) of the computing environment forecloses interleaving of the log processes. Log management operations are concurrently performed by a single process protected by a file-system lock of the OS. The log management operations include at least one of a log compression, log retention, and log rotation operation.Type: GrantFiled: September 21, 2011Date of Patent: April 22, 2014Assignee: International Business Machines CorporationInventors: Yariv Bachar, Ron Edelstein, Ehud Meiri
-
Patent number: 8683481Abstract: Exemplary method, system, and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.Type: GrantFiled: February 27, 2013Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Yariv Bachar, Ron Edelstein, Oded Sonin
-
Patent number: 8683480Abstract: Exemplary system and computer program product embodiments for resource allocation of a plurality of resources for a dual activity system by a processor device, are provided. In one embodiment, by way of example only, each of the activities may be started at a static quota. The resource boundary may be increased for a resource request for at least one of the dual activities until a resource request for an alternative one of the at least one of the dual activities is rejected. In response to the rejection of the resource request for the alternative one of the at least one of the dual activities, a resource boundary for the at least one of the dual activities may be reduced, and a wait after decrease mode may be commenced until a current resource usage is one of less than and equal to the reduced resource boundary.Type: GrantFiled: June 1, 2011Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Yariv Bachar, Ron Edelstein, Oded Sonin
-
Publication number: 20140059563Abstract: A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.Type: ApplicationFiled: November 5, 2013Publication date: February 27, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ron EDELSTEIN, Yariv BACHAR, Oded SONIN