Patents by Inventor Brian K. Wade
Brian K. Wade 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: 9710040Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: GrantFiled: December 21, 2016Date of Patent: July 18, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Patent number: 9710039Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: GrantFiled: July 17, 2014Date of Patent: July 18, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Publication number: 20170102755Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: ApplicationFiled: December 21, 2016Publication date: April 13, 2017Inventor: Brian K. Wade
-
Patent number: 9557793Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: GrantFiled: May 2, 2016Date of Patent: January 31, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Publication number: 20160231796Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: ApplicationFiled: May 2, 2016Publication date: August 11, 2016Inventor: Brian K. Wade
-
Patent number: 9384057Abstract: One or more measurements of processor utilization are taken. A utilization ceiling is calculated. One or more processing units (PUs) are added automatically if it is determined that the utilization ceiling is greater than an available PU capacity. One or more PUs are removed automatically responsive to determining that the utilization ceiling is at least one PU less than the available PU capacity.Type: GrantFiled: November 18, 2013Date of Patent: July 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Patent number: 9384055Abstract: One or more measurements of processor utilization are taken. A utilization ceiling is calculated. One or more processing units (PUs) are added automatically if it is determined that the utilization ceiling is greater than an available PU capacity. One or more PUs are removed automatically responsive to determining that the utilization ceiling is at least one PU less than the available PU capacity.Type: GrantFiled: April 16, 2012Date of Patent: July 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Patent number: 9292348Abstract: Data processing system efficiency is improved by automatically determining whether to adjust for a next time interval a number N of processors running within the system for processing a workload. The automatically determining includes obtaining a measure of operating system overhead by evaluating one or more characteristics of processor time of the N processors consumed within the system for a time interval, and obtaining a measure of system utilization of the N processors running within the system for processing the workload for the time interval. The automatically determining further includes automatically ascertaining whether to adjust the number N of processors running within the system for the next time interval to improve system efficiency using the obtained measure of operating system overhead and the obtained measure of system utilization of the N processors.Type: GrantFiled: July 16, 2013Date of Patent: March 22, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin S. Adams, Mary Ellen Carollo, Brian K. Wade, Donald P. Wilton
-
Publication number: 20160019099Abstract: A method of calculating a processing power available from a supervisor of a multi-programmed computing system by a first partition of a plurality of partitions, the method comprising collecting, by the first partition, state data from the supervisor, the state data including a processing capacity of the multi-programmed computing system. The method further comprises initializing a remaining capacity variable to the processing capacity of the multi-programmed computing system; initializing variables, including setting a binary variable to a first logic value for each of the plurality of partitions; iteratively computing an entitlement and amount of power to award for each of the plurality of partitions having their respective binary variables set to the first logic value; and requesting the processing power from the supervisor, based on the iterative computation.Type: ApplicationFiled: July 17, 2014Publication date: January 21, 2016Inventor: Brian K. Wade
-
Publication number: 20150026697Abstract: Data processing system efficiency is improved by automatically determining whether to adjust for a next time interval a number N of processors running within the system for processing a workload. The automatically determining includes obtaining a measure of operating system overhead by evaluating one or more characteristics of processor time of the N processors consumed within the system for a time interval, and obtaining a measure of system utilization of the N processors running within the system for processing the workload for the time interval. The automatically determining further includes automatically ascertaining whether to adjust the number N of processors running within the system for the next time interval to improve system efficiency using the obtained measure of operating system overhead and the obtained measure of system utilization of the N processors.Type: ApplicationFiled: July 16, 2013Publication date: January 22, 2015Inventors: Kevin S. ADAMS, Mary Ellen CAROLLO, Brian K. WADE, Donald P. WILTON
-
Publication number: 20140075447Abstract: One or more measurements of processor utilization are taken. A utilization ceiling is calculated. One or more processing units (PUs) are added automatically if it is determined that the utilization ceiling is greater than an available PU capacity. One or more PUs are removed automatically responsive to determining that the utilization ceiling is at least one PU less than the available PU capacity.Type: ApplicationFiled: November 18, 2013Publication date: March 13, 2014Applicant: International Business Machines CorprationInventor: Brian K. Wade
-
Publication number: 20130275594Abstract: One or more measurements of processor utilization are taken. A utilization ceiling is calculated. One or more processing units (PUs) are added automatically if it is determined that the utilization ceiling is greater than an available PU capacity. One or more PUs are removed automatically responsive to determining that the utilization ceiling is at least one PU less than the available PU capacity.Type: ApplicationFiled: April 16, 2012Publication date: October 17, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Brian K. Wade
-
Method and computer system for controlling access by applications to this and other computer systems
Patent number: 6883098Abstract: Application execution contexts within an untrusted computer system are classified as trusted or untrusted based on respective names assigned to the execution contexts. If an application runs in an untrusted execution context, an operating system within the untrusted computer system prevents the application from initiating a connection with a trusted computer system and accessing sensitive parts of the untrusted computer system. If the application runs in a trusted execution context, the operating system permits the application to initiate a connection with the trusted computer system.Type: GrantFiled: September 20, 2000Date of Patent: April 19, 2005Assignee: International Business Machines CorporationInventors: John S. Roman, Brian K. Wade -
Publication number: 20040083089Abstract: A computer program product for execution at a first computer to emulate manual user input at a first computer to operate second and third computers. The program product includes a computer readable medium and the following programming recorded on the medium. A first program segment requests initialization of communication between the first computer and the second and third computers. A second program segment interacts with the second computer. A third program segment interacts with the third computer. The second program segment and the third program segment are executed effectively concurrently. According to the second program segment, execution of the second program segment is suspended pending the third computer reaching a certain state and the state being communicated to the second program segment. Such a state emulates human operator decisions and time that would be spent by the human operator in making operation decisions.Type: ApplicationFiled: October 24, 2002Publication date: April 29, 2004Applicant: International Business Machines CorporationInventor: Brian K. Wade
-
Patent number: 5630128Abstract: A multitasking operating system permits application programs (and their developers) to influence a schedule of execution of program threads derived from the application programs. Each of the program threads is assigned a priority level and a dispatch class in which the thread resides. Based on these parameters, the operating system schedules the threads for execution in the following manner. The operating system queues the highest priority thread which is available for execution from each dispatch class onto a run list for execution by a processor. The highest priority thread on the run list is executed first. An application program thread can change the dispatch class in which another program thread resides. An executing program thread can also voluntarily yield to a specified program thread in the same dispatch class or permit the highest priority available thread in the same dispatch class to be queued on the run list with itself being available and in contention for the run list.Type: GrantFiled: August 9, 1991Date of Patent: May 13, 1997Assignee: International Business Machines CorporationInventors: Joel A. Farrell, Stephen E. Record, Brian K. Wade
-
Patent number: 5247675Abstract: A multitasking operating system permits application programs (and their developers) to influence a schedule of execution of program threads which constitute the application programs by specifying parameters for the program threads. The parameters indicate each thread's priority level and dispatch class in which the thread resides. The application programs specify the thread's parameters based on the following principles of the operating system. The operating system queues the highest priority thread available for execution from each dispatch class onto a run list for execution by a processor. The highest priority thread on the run list is executed first. While this thread is dispatchable and being executed, no other thread from the same dispatch class can preempt it unless this executing thread voluntarily relinquishes control of the processor, even if the other thread has a higher priority.Type: GrantFiled: August 9, 1991Date of Patent: September 21, 1993Assignee: International Business Machines CorporationInventors: Joel A. Farrell, Stephen E. Record, Brian K. Wade