Patents by Inventor Enci Zhong
Enci Zhong 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: 11907170Abstract: Provided are a computer program product, system, and method for switching serialization techniques for handling concurrent write requests to a shared file. A first node serializes write requests from client nodes to write to the shared file. The first node determines whether to switch to a second node to manage write quests to the shared file based on a pattern of write requests to the shared file. The client nodes are notified to direct write requests to the shared file to the second node in response to determining to switch to the second node. The second node processes write requests to the shared file to serialize writes to the shared file after the client nodes are notified to submit the write requests to the shared file to the second node.Type: GrantFiled: June 14, 2021Date of Patent: February 20, 2024Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Enci Zhong, Frank Schmuck, Felipe Knop, Owen T. Anderson, Huzefa Pancha, Abhishek Jain
-
Patent number: 11803317Abstract: A method for executing operation requests includes formatting one or more storage devices and selecting one or more labeled replicas and one or more distinguished replicas, receiving an operation request with respect to a set of data blocks, identifying a preferred replica corresponding to the received operation request, determining whether the replication-pending bits for the preferred replica are set, and executing the received operation request with respect to the corresponding distinguished replica. A method for executing a write operation request additionally includes setting replication-pending bits with respect to the labeled replica, wherein the replication-pending bits indicate an incomplete write request, writing data to both a labeled replica and a distinguished replica, and clearing the replication-pending bits with respect to the labeled replica to indicate the completion of the write operation.Type: GrantFiled: December 15, 2020Date of Patent: October 31, 2023Assignee: International Business Machines CorporationInventors: Owen T. Anderson, Felipe Knop, Enci Zhong, Frank Schmuck, Deepavali M. Bhagwat, Hai Zhong Zhou
-
Publication number: 20230342063Abstract: A method and a computer system for asymmetric replication of data are provided. Storage of a set of data is organized as a first copy and as a second copy in non-volatile storage. The second copy is reliable and stored so as to be readable at a speed slower than for the first copy. A read instruction regarding the set of data is received and performed preferentially via the first copy such that the asymmetric replication achieves enhanced performance speed. A request to execute a write operation is received. The write operation is executed to the first copy and to the second copy. In response to determining that the write operation to the first copy was unsuccessful, a label for the first copy is set as stale.Type: ApplicationFiled: April 22, 2022Publication date: October 26, 2023Inventors: Frank Schmuck, Owen T. Anderson, DEEPAVALI M. BHAGWAT, Enci Zhong, Felipe Knop, John Lewars, Hai Zhong Zhou, D Scott Guthridge
-
Patent number: 11782630Abstract: A method and a computer system for asymmetric replication of data are provided. Storage of a set of data is organized as a first copy and as a second copy in non-volatile storage. The second copy is reliable and stored so as to be readable at a speed slower than for the first copy. A read instruction regarding the set of data is received and performed preferentially via the first copy such that the asymmetric replication achieves enhanced performance speed. A request to execute a write operation is received. The write operation is executed to the first copy and to the second copy. In response to determining that the write operation to the first copy was unsuccessful, a label for the first copy is set as stale.Type: GrantFiled: April 22, 2022Date of Patent: October 10, 2023Assignee: International Business Machines CorporationInventors: Frank Schmuck, Owen T. Anderson, Deepavali M. Bhagwat, Enci Zhong, Felipe Knop, John Lewars, Hai Zhong Zhou, D Scott Guthridge
-
Publication number: 20220398223Abstract: Provided are a computer program product, system, and method for switching serialization techniques for handling concurrent write requests to a shared file. A first node serializes write requests from client nodes to write to the shared file. The first node determines whether to switch to a second node to manage write quests to the shared file based on a pattern of write requests to the shared file. The client nodes are notified to direct write requests to the shared file to the second node in response to determining to switch to the second node. The second node processes write requests to the shared file to serialize writes to the shared file after the client nodes are notified to submit the write requests to the shared file to the second node.Type: ApplicationFiled: June 14, 2021Publication date: December 15, 2022Inventors: Enci ZHONG, Frank SCHMUCK, Felipe KNOP, Owen T. ANDERSON, Huzefa PANCHA, Abhishek JAIN
-
Publication number: 20220187990Abstract: A method for executing operation requests includes formatting one or more storage devices and selecting one or more labeled replicas and one or more distinguished replicas, receiving an operation request with respect to a set of data blocks, identifying a preferred replica corresponding to the received operation request, determining whether the replication-pending bits for the preferred replica are set, and executing the received operation request with respect to the corresponding distinguished replica. A method for executing a write operation request additionally includes setting replication-pending bits with respect to the labeled replica, wherein the replication-pending bits indicate an incomplete write request, writing data to both a labeled replica and a distinguished replica, and clearing the replication-pending bits with respect to the labeled replica to indicate the completion of the write operation.Type: ApplicationFiled: December 15, 2020Publication date: June 16, 2022Inventors: Owen T. Anderson, Felipe Knop, Enci Zhong, Frank Schmuck, DEEPAVALI M. BHAGWAT, Hai Zhong Zhou
-
Patent number: 9703285Abstract: A technique for determining scheduling priorities of jobs of different types to facilitate workload management in a clustered processing environment having a plurality of managed resource types is provided. The technique includes allocating shares of multiple managed resource types to users and user groups of the clustered processing environment. The technique also includes assigning a job priority for a subsequent job submitted by a user or group, wherein the calculated job priority is based on a type attribute of the subsequent job and the number of the user's or group's remaining shares of at least one managed resource type of the multiple of managed resource types.Type: GrantFiled: October 25, 2006Date of Patent: July 11, 2017Assignee: International Business Machines CorporationInventor: Enci Zhong
-
Patent number: 8347299Abstract: A method, information processing system, and computer program storage product for associating jobs with resource subsets in a job scheduler. At least one job class that defines characteristics associated with a type of job is received. A list of resource identifiers for a set of resources associated with the job class is received. A set of resources available on at least one information processing system is received. The resource identifiers are compared with each resource in the set of resources available on the information processing system. A job associated with the job class with is scheduled with a set of resources determined to be usable by the job based on the comparing.Type: GrantFiled: October 19, 2007Date of Patent: January 1, 2013Assignee: International Business Machines CorporationInventor: Enci Zhong
-
Patent number: 8332863Abstract: Fair share scheduling to divide the total amount of available resource into a finite number of shares and allocate a portion of the shares to an individual user or group of users as a way to specify the resource proportion entitled by the user or group of users. The scheduling priority of jobs for a user or group of users depends on a customizable expression of allocated and used shares by that individual user or group of users. The usage by the user or group of users is accumulated and an exponential decay function is applied thereto in order to keep track of historic resource usage for a user or group of users by one piece of data and an update timestamp.Type: GrantFiled: September 1, 2011Date of Patent: December 11, 2012Assignee: International Business Machines CorporationInventor: Enci Zhong
-
Patent number: 8087026Abstract: Fair share scheduling to divide the total amount of available resource into a finite number of shares and allocate a portion of the shares to an individual user or group of users as a way to specify the resource proportion entitled by the user or group of users. The scheduling priority of jobs for a user or group of users depends on a customizable expression of allocated and used shares by that individual user or group of users. The usage by the user or group of users is accumulated and an exponential decay function is applied thereto in order to keep track of historic resource usage for a user or group of users by one piece of data and an update timestamp.Type: GrantFiled: April 27, 2006Date of Patent: December 27, 2011Assignee: International Business Machines CorporationInventor: Enci Zhong
-
Publication number: 20110314477Abstract: Fair share scheduling to divide the total amount of available resource into a finite number of shares and allocate a portion of the shares to an individual user or group of users as a way to specify the resource proportion entitled by the user or group of users. The scheduling priority of jobs for a user or group of users depends on a customizable expression of allocated and used shares by that individual user or group of users. The usage by the user or group of users is accumulated and an exponential decay function is applied thereto in order to keep track of historic resource usage for a user or group of users by one piece of data and an update timestamp.Type: ApplicationFiled: September 1, 2011Publication date: December 22, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Enci Zhong
-
Patent number: 7716336Abstract: Disclosed are a method, information processing system, and computer readable medium for reserving resources in a massively parallel processing system comprising. The method includes receiving a reservation request for reserving at least one resource within a massively parallel processing system. The massively parallel processing system includes compute nodes, base partitions, switches, wires, and node cards. The reservation type associated with the reservation is determined. The reservation type is at least one of a number of compute nodes, a base partition list, a particular shape configuration, a particular job, and a particular partition. A set of requirements is generated based on the reservation type. A set of resources is identified for satisfying the set of requirements and the set of resources is reserved.Type: GrantFiled: October 27, 2006Date of Patent: May 11, 2010Assignee: International Business Machines CorporationInventors: Richard J. Coppinger, Alexander Druyan, Enci Zhong
-
Patent number: 7698251Abstract: A fault tolerant capability for the reliable collection and aggregation of disparate data from multiple processing units. Data of a processing unit is collected and locally aggregated at that processing unit. The locally aggregated data is stored in a local database, and periodically forwarded to a central manager. In response to receiving the data, the central manager determines whether the data should be included in a total aggregate of data for the processing environment.Type: GrantFiled: April 27, 2006Date of Patent: April 13, 2010Assignee: International Business Machines CorporationInventors: David P. Brelsford, Richard J. Coppinger, Alexander Druyan, Enci Zhong
-
Publication number: 20090106763Abstract: A method, information processing system, and computer program storage product for associating jobs with resource subsets in a job scheduler. At least one job class that defines characteristics associated with a type of job is received. A list of resource identifiers for a set of resources associated with the job class is received. A set of resources available on at least one information processing system is received. The resource identifiers are compared with each resource in the set of resources available on the information processing system. A job associated with the job class with is scheduled with a set of resources determined to be usable by the job based on the comparing.Type: ApplicationFiled: October 19, 2007Publication date: April 23, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: ENCI ZHONG
-
Publication number: 20080103861Abstract: A technique for determining scheduling priorities of jobs of different types to facilitate workload management in a clustered processing environment having a plurality of managed resource types is provided. The technique includes allocating shares of multiple managed resource types to users and user groups of the clustered processing environment. The technique also includes assigning a job priority for a subsequent job submitted by a user or group, wherein the calculated job priority is based on a type attribute of the subsequent job and the number of the user's or group's remaining shares of at least one managed resource type of the multiple of managed resource types.Type: ApplicationFiled: October 25, 2006Publication date: May 1, 2008Applicant: International Business Machines CorporationInventor: Enci ZHONG
-
Publication number: 20070256078Abstract: A system, method and program product is provided for reserving resources in a computing environment, and especially a distributed cluster environment. The method comprises the steps of analyzing specific requests relating to a received reservation and checking their sufficiency. Resource availability is then checking based on this information. Resources are then reserved and a new reservation created when above mentioned conditions are satisfied.Type: ApplicationFiled: April 28, 2006Publication date: November 1, 2007Inventors: Nathan Falk, Iris Harvey, Paula Trimble, Enci Zhong
-
Publication number: 20070256077Abstract: Fair share scheduling to divide the total amount of available resource into a finite number of shares and allocate a portion of the shares to an individual user or group of users as a way to specify the resource proportion entitled by the user or group of users. The scheduling priority of jobs for a user or group of users depends on a customizable expression of allocated and used shares by that individual user or group of users. The usage by the user or group of users is accumulated and an exponential decay function is applied thereto in order to keep track of historic resource usage for a user or group of users by one piece of data and an update timestamp.Type: ApplicationFiled: April 27, 2006Publication date: November 1, 2007Applicant: International Business Machines CorporationInventor: Enci Zhong
-
Publication number: 20070255835Abstract: Disclosed are a method, information processing system, and computer readable medium for reserving resources in a massively parallel processing system comprising. The method includes receiving a reservation request for reserving at least one resource within a massively parallel processing system. The massively parallel processing system includes compute nodes, base partitions, switches, wires, and node cards. The reservation type associated with the reservation is determined. The reservation type is at least one of a number of compute nodes, a base partition list, a particular shape configuration, a particular job, and a particular partition. A set of requirements is generated based on the reservation type. A set of resources is identified for satisfying the set of requirements and the set of resources is reserved.Type: ApplicationFiled: October 27, 2006Publication date: November 1, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Richard J. Coppinger, Alexander Druyan, Enci Zhong
-
Publication number: 20070255682Abstract: A fault tolerant capability for the reliable collection and aggregation of disparate data from multiple processing units. Data of a processing unit is collected and locally aggregated at that processing unit. The locally aggregated data is stored in a local database, and periodically forwarded to a central manager. In response to receiving the data, the central manager determines whether the data should be included in a total aggregate of data for the processing environment.Type: ApplicationFiled: April 27, 2006Publication date: November 1, 2007Applicant: International Business Machines CorporationInventors: David Brelsford, Richard Coppinger, Alexander Druyan, Enci Zhong
-
Patent number: 7188093Abstract: Methods and systems are disclosed for determining whether circular dependency exists in a plurality of dependency rules. The method includes generating for at least some of the plurality of dependency rules a plurality of exclusion lists. Each exclusion list is associated with at least one independent object of a dependency rule and lists as an item a dependent object of the dependency rule. Where an item listed in at least one of the generated exclusion lists corresponds to an independent object having its own exclusion list with at least one item, the at least one item is incorporated into the generated exclusion list. Where at least one of the generated exclusion lists for an independent object includes an item corresponding to the independent object, circular dependency is found. If not, and if all of the dependency rules have been read, circular dependency is not found.Type: GrantFiled: October 1, 2001Date of Patent: March 6, 2007Assignee: International Business Machines CorporationInventor: Enci Zhong