Patents by Inventor Guy Laden

Guy Laden 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: 20130325950
    Abstract: A system for communicating information among a plurality of nodes of a network. The system comprises a plurality of disseminating modules installed in a plurality of nodes of a network which hosts a plurality of replicas of data having a plurality of objects, each the disseminating module has access to a dataset defining a plurality of write request dissemination topologies. Each disseminating module is defined to receive a write request from a client, to select dynamically one of the write request dissemination topologies according to at least one parameter of the client, and to disseminate the write request according to the selected write request dissemination topology.
    Type: Application
    Filed: June 3, 2012
    Publication date: December 5, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Guy Laden, Roie Melamed
  • Publication number: 20130138889
    Abstract: Systems and methods for cache optimization, the method comprising monitoring cache access rate for one or more cache tenants in a computing environment, wherein a first cache tenant is allocated a first cache having a first cache size which may be adjusted; determining a cache profile for at least the first cache over one or more time intervals according to data collected during the monitoring, analyzing the cache profile for the first cache to determine an expected cache usage model for the first cache; and analyzing the cache usage model and factors related to cache efficiency for the one or more cache tenants to dictate one or more constraints that define boundaries for the first cache size.
    Type: Application
    Filed: November 30, 2011
    Publication date: May 30, 2013
    Applicant: International Business Machines Corporation
    Inventors: Gregory Chockler, Guy Laden, Ýmir Vigfússon
  • Publication number: 20130138891
    Abstract: Systems and methods for cache optimization are provided. The method comprises monitoring cache access rate for a plurality of cache tenants sharing same cache mechanism having an amount of data storage space, wherein a first cache tenant having a first cache size is allocated a first cache space within the data storage space, and wherein a second cache tenant having a second cache size is allocated a second cache space within the data storage space. The method further comprises determining cache profiles for at least the first cache tenant and the second cache tenant according to data collected during the monitoring; analyzing the cache profiles for the plurality of cache tenants to determine an expected cache usage model for the cache mechanism; and analyzing the cache usage model and factors related to cache efficiency or performance for the one or more cache tenants to dictate one or more occupancy constraints.
    Type: Application
    Filed: May 21, 2012
    Publication date: May 30, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregory Chockler, Guy Laden, Benjamin M. Parees, Ymir Vigfusson
  • Patent number: 7970736
    Abstract: A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.
    Type: Grant
    Filed: August 27, 2009
    Date of Patent: June 28, 2011
    Assignee: International Business Machines Corporation
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Kim Ta-Shma
  • Patent number: 7900003
    Abstract: A method for storing an information block that includes determining to store a current version of an information block stored in a memory unit. The checking if a current version of the information is already stored in a storage unit. The current version of the information block is sent from the memory unit to the storage unit if the answer is negative. Generating storage unit location information indicative of a location, at the storage unit, of the current version of the information block if the answer is positive.
    Type: Grant
    Filed: April 20, 2007
    Date of Patent: March 1, 2011
    Assignee: International Business Machines Corporation
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Ta-Shma, Aviad Zlotnick
  • Patent number: 7664766
    Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.
    Type: Grant
    Filed: September 12, 2006
    Date of Patent: February 16, 2010
    Assignee: International Business Machines Corporation
    Inventors: Michael Factor, Shachar Fienblit, Guy Laden, Paula Ta-Shma
  • Publication number: 20090319738
    Abstract: A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.
    Type: Application
    Filed: August 27, 2009
    Publication date: December 24, 2009
    Applicant: International Business Machines Corporation
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Kim Ta-Shma
  • Patent number: 7603392
    Abstract: A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.
    Type: Grant
    Filed: June 5, 2006
    Date of Patent: October 13, 2009
    Assignee: International Business Machines Corporation
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Kim Ta-Shma
  • Publication number: 20080263296
    Abstract: A method for storing an information block that includes determining to store a current version of an information block stored in a memory unit. The checking if a current version of the information is already stored in a storage unit. The current version of the information block is sent from the memory unit to the storage unit if the answer is negative. Generating storage unit location information indicative of a location, at the storage unit, of the current version of the information block if the answer is positive.
    Type: Application
    Filed: April 20, 2007
    Publication date: October 23, 2008
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Ta-Shma, Aviad Zlotnick
  • Publication number: 20080155198
    Abstract: A method for managing data, the method includes: providing a write-back cache unit coupled to at least one storage unit; receiving a request to write a new data version to a certain cache data allocation unit; determining, in response to a data storage policy, whether to overwrite a cached data version being cached in the certain cache data allocation unit or to perform a destage of the cached data version to a first storage unit before writing the new data version to the certain cache allocation unit; receiving a request to read a data version that corresponds to a certain point in time and scanning a first data structure representative of write operations and a second data structure representative of revert operations to determine a location of the requested data version.
    Type: Application
    Filed: December 19, 2007
    Publication date: June 26, 2008
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: MICHAEL E. FACTOR, Shachar Fienblit, Guy Laden, Dean Har'el Lorenz, Shlomit Sarah Pinter, Paula Kim Ta-Shma
  • Publication number: 20080065669
    Abstract: A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.
    Type: Application
    Filed: September 12, 2006
    Publication date: March 13, 2008
    Inventors: Michael Factor, Shachar Fienblit, Guy Laden, Paula Ta-Shma
  • Publication number: 20070282926
    Abstract: A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.
    Type: Application
    Filed: June 5, 2006
    Publication date: December 6, 2007
    Inventors: Shmuel Ben-Yehuda, Michael Factor, Guy Laden, Paula Kim Ta-Shma