Patents by Inventor Ran Kalach

Ran Kalach 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: 20060117070
    Abstract: Method and system for establishing and maintaining quotas. An auto quota is defined and applied to a directory. Input and output is monitored to detect a successful operation that involves a subdirectory of the directory. A determination is made as to whether to apply a quota associated with the auto quota to the subdirectory. If the determination is that the quota is to be applied to the subdirectory, it is automatically applied.
    Type: Application
    Filed: November 30, 2004
    Publication date: June 1, 2006
    Applicant: Microsoft Corporation
    Inventors: Ravinder Thind, Neal Christiansen, Ran Kalach, James Benton, Rajeev Nagar
  • Publication number: 20060053259
    Abstract: A framework for taking shadow copies and performing backups in systems that may have data spread across multiple machines. A requester communicates names to a primary coordinator and requests the creation of shadow copies of all the volumes associated with the names. The primary coordinator communicates with one or more writers and one or more secondary coordinators to create the shadow copies of the volumes. The primary and one or more secondary coordinators create shadow copies of one or more of the volumes that reside on the machines upon which they execute. After the shadow copies of the volumes have been created, the requester may obtain data from the shadow copies and create a consistent backup.
    Type: Application
    Filed: September 9, 2004
    Publication date: March 9, 2006
    Applicant: Microsoft Corporation
    Inventors: Brian Berkowitz, Catharine Ingen, Paul Oltean, Ran Kalach, Reuven Lax
  • Publication number: 20050165820
    Abstract: A technique for recalling data objects stored on media. A queue is created for each medium on which data objects are located, where each request to recall a data object is placed on the queue corresponding to the medium on which the data object is located. A queue is “active” when its corresponding medium is mounted and being used for recall; otherwise the queue is “non-active.” A thread is created for each active queue, where the thread retrieves from a medium the requested items on the active queue. When plural drives are available for mounting and reading media, plural queues may be active concurrently, so that the plural queues' respective threads may recall items from the plural media in parallel. Preferably, the requests on each queue are organized in an order such that the offset locations of the requested items form two monotonically increasing sequences.
    Type: Application
    Filed: March 16, 2005
    Publication date: July 28, 2005
    Applicant: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach
  • Patent number: 6920447
    Abstract: A technique for recalling data objects stored on media. A queue is created for each medium on which data objects are located, where each request to recall a data object is placed on the queue corresponding to the medium on which the data object is located. A queue is “active” when its corresponding medium is mounted and being used for recall; otherwise the queue is “non-active.” A thread is created for each active queue, where the thread retrieves from a medium the requested items on the active queue. When plural drives are available for mounting and reading media, plural queues may be active concurrently, so that the plural queues' respective threads may recall items from the plural media in parallel. Preferably, the requests on each queue are organized in an order such that the offset locations of the requested items form two monotonically increasing sequences.
    Type: Grant
    Filed: February 15, 2001
    Date of Patent: July 19, 2005
    Assignee: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach
  • Patent number: 6889232
    Abstract: A method for concurrent data migration includes classifying files to be migrated into plural jobs, selecting media to which to migrate each job, and using plural drives concurrently to write the jobs to the media. The selection of a medium is performed in a way that prevents the number of writeable media from exceeding the number of available drives, unless no allocated medium has sufficient space to store any files in a migration job. A medium is preferentially selected that has already been allocated for writing, has space to store at least one file in the job, is not in use for another job, and can be robotically mounted on a drive. If such a medium does not exist, then the set of available media is canvassed to locate an alternative medium.
    Type: Grant
    Filed: February 15, 2001
    Date of Patent: May 3, 2005
    Assignee: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach
  • Publication number: 20050033932
    Abstract: A method for concurrent data migration includes classifying files to be migrated into plural jobs, selecting media to which to migrate each job, and using plural drives concurrently to write the jobs to the media. The selection of a medium is performed in a way that prevents the number of writeable media from exceeding the number of available drives, unless no allocated medium has sufficient space to store any files in a migration job. A medium is preferentially selected that has already been allocated for writing, has space to store at least one file in the job, is not in use for another job, and can be robotically mounted on a drive. If such a medium does not exist, then the set of available media is canvassed to locate an alternative medium.
    Type: Application
    Filed: September 8, 2004
    Publication date: February 10, 2005
    Applicant: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach
  • Publication number: 20020147881
    Abstract: A method for concurrent data migration includes classifying files to be migrated into plural jobs, selecting media to which to migrate each job, and using plural drives concurrently to write the jobs to the media. The selection of a medium is performed in a way that prevents the number of writeable media from exceeding the number of available drives, unless no allocated medium has sufficient space to store any files in a migration job. A medium is preferentially selected that has already been allocated for writing, has space to store at least one file in the job, is not in use for another job, and can be robotically mounted on a drive. If such a medium does not exist, then the set of available media is canvassed to locate an alternative medium.
    Type: Application
    Filed: February 15, 2001
    Publication date: October 10, 2002
    Applicant: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach
  • Publication number: 20020111929
    Abstract: A technique for recalling data objects stored on media. A queue is created for each medium on which data objects are located, where each request to recall a data object is placed on the queue corresponding to the medium on which the data object is located. A queue is “active” when its corresponding medium is mounted and being used for recall; otherwise the queue is “non-active.” A thread is created for each active queue, where the thread retrieves from a medium the requested items on the active queue. When plural drives are available for mounting and reading media, plural queues may be active concurrently, so that the plural queues' respective threads may recall items from the plural media in parallel. Preferably, the requests on each queue are organized in an order such that the offset locations of the requested items form two monotonically increasing sequences.
    Type: Application
    Filed: February 15, 2001
    Publication date: August 15, 2002
    Applicant: Microsoft Corporation
    Inventors: Ravisankar Pudipeddi, Ran Kalach