Patents by Inventor Sanjay Shyam
Sanjay Shyam 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: 7349908Abstract: A dynamic construct is associated with one or more operational parameters of one or more components of a storage management system, wherein a pointer to the construct is retained in metadata for the storage management system, the values of the construct are stored in a first repository separate from a second repository normally used to store the metadata for the storage management system. The value of the construct in the first repository is allowed to change dynamically at any point of time without affecting the metadata in the second repository. Thereafter, the value of the construct in the first repository is retrieved and used as the operational parameter, instead of a static value in the metadata in the second repository. This provides a level of indirection that allows the construct to be applied dynamically in the storage management system.Type: GrantFiled: February 21, 2002Date of Patent: March 25, 2008Assignee: International Business Machines CorporationInventors: Sanjay Shyam, Victor Sheng-Jian Liang, Savur Anand Rao, Stephen Merritt Branch, Patricia Driscoll Choi, Mark Edward Thomen
-
Patent number: 7146453Abstract: A method and computer that reduces ABENDs due to end of volume encounters of a job. The method provides an extend-to-new volume processing in response to such encounters. The method permits the definition of primary storage groups and extend storage groups and allows the linking of an extend storage group to a primary storage group. When the job encounters an end-of-volume condition on the current storage volume and is further unable to extend to a new volume in the primary storage group, the method then tries to find a new volume in one or more extend storage groups that are linked to that primary storage group. If no new volume can be found in an extend storage group, an ABEND process is performed.Type: GrantFiled: February 6, 2002Date of Patent: December 5, 2006Assignee: International Business Machines CorporationInventors: Sanjay Shyam, Stevan Charles Allen, Victor S. Liang, Savur Anand Rao
-
Patent number: 6934800Abstract: A computer system that includes a computer and a storage system. The storage system includes a plurality of storage resources, each of which includes one or more storage volumes. Data sets are allocated among the storage volumes according to a policy of requirements and preferences based on separation of critical data sets so that a single point of failure in one storage resource will have minimal impact on data sets stored in a different resource. According to the method, a second currently stored data set to be separated from a new first data set is identified. A storage resource and any volume thereof that contains the second data set is identified. An eligible volume list for selection of a storage volume for the first data set is formed according to the policy. The storage volumes of the storage resource identified as containing the second data set are excluded from the eligible volume list.Type: GrantFiled: February 6, 2002Date of Patent: August 23, 2005Assignee: International Business Machines CorporationInventors: Stevan Charles Allen, Sanjay Shyam, Victor S. Liang, Savur Anand Rao
-
Publication number: 20050086430Abstract: Disclosed is a method, system, and program for storing data. A cluster is associated with a plurality of storage groups. A storage group preference order is designated for data sets associated with the cluster. When a request to store a data set for the cluster is received, one of the plurality of storage groups is selected using the storage group preference order.Type: ApplicationFiled: October 17, 2003Publication date: April 21, 2005Inventors: Stevan Allen, Sanjay Shyam, Victor Liang, Savur Rao
-
Publication number: 20030158849Abstract: A dynamic construct is associated with one or more operational parameters of one or more components of a storage management system, wherein a pointer to the construct is retained in metadata for the storage management system, the values of the construct are stored in a first repository separate from a second repository normally used to store the metadata for the storage management system. The value of the construct in the first repository is allowed to change dynamically at any point of time without affecting the metadata in the second repository. Thereafter, the value of the construct in the first repository is retrieved and used as the operational parameter, instead of a static value in the metadata in the second repository. This provides a level of indirection that allows the construct to be applied dynamically in the storage management system.Type: ApplicationFiled: February 21, 2002Publication date: August 21, 2003Applicant: International Business Machines CorporationInventors: Sanjay Shyam, Victor Sheng-Jian Liang, Savur Anand Rao, Stephen Merritt Branch, Patricia Driscoll Choi, Mark Edward Thomen
-
Publication number: 20030149835Abstract: A computer system that includes a computer and a storage system. The storage system includes a plurality of storage resources, each of which includes one or more storage volumes. Data sets are allocated among the storage volumes according to a policy of requirements and preferences based on separation of critical data sets so that a single point of failure in one storage resource will have minimal impact on data sets stored in a different resource. According to the method, a second currently stored data set to be separated from a new first data set is identified. A storage resource and any volume thereof that contains the second data set is identified. An eligible volume list for selection of a storage volume for the first data set is formed according to the policy. The storage volumes of the storage resource identified as containing the second data set are excluded from the eligible volume list.Type: ApplicationFiled: February 6, 2002Publication date: August 7, 2003Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Stevan Charles Allen, Sanjay Shyam, Victor S. Liang, Savur Anand Rao
-
Publication number: 20030149847Abstract: A method and computer that reduces ABENDs due to end of volume encounters of a job. The method provides an extend-to-new volume processing in response to such encounters. The method permits the definition of primary storage groups and extend storage groups and allows the linking of an extend storage group to a primary storage group. When the job encounters an end-of-volume condition on the current storage volume and is further unable to extend to a new volume in the primary storage group, the method then tries to find a new volume in one or more extend storage groups that are linked to that primary storage group. If no new volume can be found in an extend storage group, an ABEND process is performed.Type: ApplicationFiled: February 6, 2002Publication date: August 7, 2003Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sanjay Shyam, Stevan Charles Allen, Victor S. Liang, Savur Anand Rao
-
Patent number: 6591334Abstract: A method and apparatus for reducing space allocation failures in a computer system that utilizes direct access storage devices to store data. The method comprises the steps of determining if authorization has been given to attempt to allocate an initial space request over more than one volume, and, if so, attempting to allocate space on a plurality of volumes. If the initial space request cannot be allocated on a plurality of volumes, the initial space request is reduced by a preset percentage, the five-extent limit is removed and an attempt is made to allocate the reduced space request on the plurality of volumes with the five extent limit removed. Alternatively, if authorization has not been given to attempt to allocate the initial space request over more than one volume, the initial space request is reduced by a preset percentage, the five-extent limit is removed and an attempt is made to allocate the reduced space request on a single volume.Type: GrantFiled: June 19, 2000Date of Patent: July 8, 2003Assignee: Hitachi Global Storage Technologies Netherlands B.V.Inventors: Sanjay Shyam, Victor Liang, Gary A. Pizl, Ray P. Swartz
-
Patent number: 6088764Abstract: A method and apparatus for reducing space allocation failures in a computer system that utilizes direct access storage devices to store data. The method comprises the steps of determining if authorization has been given to attempt to allocate an initial space request over more than one volume, and, if so, attempting to allocate space on a plurality of volumes. If the initial space request cannot be allocated on a plurality of volumes, the initial space request is reduced by a preset percentage, the five-extent limit is removed and an attempt is made to allocate the reduced space request on the plurality of volumes with the five extent limit removed. Alternatively, if authorization has not been given to attempt to allocate the initial space request over more than one volume, the initial space request is reduced by a preset percentage, the five-extent limit is removed and an attempt is made to allocate the reduced space request on a single volume.Type: GrantFiled: July 14, 1997Date of Patent: July 11, 2000Assignee: International Business Machines CorporationInventors: Sanjay Shyam, Victor Liang, Gary A. Pizl, Ray P. Swartz