Patents by Inventor Alexander Druyan
Alexander Druyan 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: 9723070Abstract: A system to improve cluster machine processing that may include a plurality of interconnected computers that process data as one if necessary, and at least one other plurality of interconnected computers that process data as one if necessary. The system may also include a central manager to control what data processing is performed on a shared processing job performed by the plurality of interconnected computers and the at least one other plurality of interconnected computers. Each of the plurality of interconnected computers runs parallel jobs scheduled by a local backfill scheduler. In order to schedule a cluster spanning parallel job, the local schedulers cooperate on placement and timing of the cluster spanning job, using existing backfill rules in order not to disturb the local job streams.Type: GrantFiled: January 31, 2008Date of Patent: August 1, 2017Assignee: International Business Machines CorporationInventors: David Paul Brelsford, Waiman Chan, Alexander Druyan, Joseph F. Skovira
-
Patent number: 9176774Abstract: A scheduler receives flexible reservation requests for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and a required resource. The consumable resources comprise machine resources and floating resources. The scheduler creates a flexible job for the flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the flexible reservation request. The scheduler, responsive to detecting the flexible job positioned in the prioritized job queue for scheduling next and detecting a selection of consumable resources available to match the at least one required resource for the duration, transfers the selection of consumable resources to the reservation and sets the reservation to an active state.Type: GrantFiled: April 5, 2013Date of Patent: November 3, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alexander Druyan, Wei Li, Kailash N. Marthi, Yun T. Xiang, Linda C. Cham
-
Patent number: 9015724Abstract: The present invention provides a method, program product, and information processing system that efficiently dispatches jobs from a job queue. The jobs are dispatched to the computational nodes in the system. First, for each job, the number of nodes required to perform the job and the required computational resources for each of these nodes are determined. Then, for each node required, a node is selected to determine whether a job scheduler has a record indicating if this node meets the required computational resource requirement. If no record exists, the job scheduler analyzes whether the node meets the computational resource requirements given that other jobs may be currently executing on that node. The result of this determination is recorded. If the node does meet the computational resource requirement, the node is assigned to the job. If the node does not meet the resource requirement, a next available node is selected.Type: GrantFiled: September 23, 2009Date of Patent: April 21, 2015Assignee: International Business Machines CorporationInventor: Alexander Druyan
-
Patent number: 8818833Abstract: This present invention provides an efficient method and system to manage service requests across multiple service request systems. This management method involves merging all service requests from multiple systems into standard system, sorting the request according to some standard and presenting a display list of all of the requests having a common characteristic to a technician or requester. Service requests are gathered from many different backend-ticketing systems and presented to the technicians in a single logical view. Service requests gathered from each backend ticketing system are packaged in an XML document format. The efficient use of a common XML format is an efficient way to manage all service requests from all backend-ticketing systems. These service requests can be sorted by ticket open or close date/time, status, severity of problem, etc. in ascending or descending order and be presented to the technicians in a single logical view.Type: GrantFiled: February 14, 2002Date of Patent: August 26, 2014Assignee: International Business Machines CorporationInventors: Alexander Druyan, Donald A. James, Ching Yu Conrad Lo, Arsalan K. Lodhi, Fabian F. Morgan, Sandra Juni Schlosser
-
Patent number: 8812578Abstract: Start times are determined for jobs to be executed in the future in a multi-cluster environment. The start times are, for instance, the earliest start times in which the jobs may be executed. The start times are computed in logarithmic time, providing processing efficiencies for the multi-cluster environment. Processing efficiencies are further realized by employing parallel processing in determining the start times.Type: GrantFiled: November 7, 2008Date of Patent: August 19, 2014Assignee: International Business Machines CorporationInventors: Alexander Druyan, David P. Brelsford
-
Publication number: 20130290974Abstract: A scheduler receives flexible reservation requests for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and a required resource. The consumable resources comprise machine resources and floating resources. The scheduler creates a flexible job for the flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the flexible reservation request. The scheduler, responsive to detecting the flexible job positioned in the prioritized job queue for scheduling next and detecting a selection of consumable resources available to match the at least one required resource for the duration, transfers the selection of consumable resources to the reservation and sets the reservation to an active state.Type: ApplicationFiled: April 5, 2013Publication date: October 31, 2013Inventors: Alexander DRUYAN, Wei LI, Kailash N. MARTHI, Yun T. XIANG, Linda C. CHAM
-
Patent number: 8453152Abstract: A scheduler receives at least one flexible reservation request for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and at least one required resource. The consumable resources comprise at least one machine resource and at least one floating resource. The scheduler creates a flexible job for the at least one flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the at least one flexible reservation request.Type: GrantFiled: February 1, 2011Date of Patent: May 28, 2013Assignee: International Business Machines CorporationInventors: Alexander Druyan, Wei Li, Kailash N. Marthi, Yun T. Xiang, Linda C. Cham
-
Publication number: 20120204185Abstract: A scheduler receives flexible reservation requests for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and a required resource. The consumable resources comprise machine resources and floating resources. The scheduler creates a flexible job for the flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the flexible reservation request. The scheduler, responsive to detecting the flexible job positioned in the prioritized job queue for scheduling next and detecting a selection of consumable resources available to match the at least one required resource for the duration, transfers the selection of consumable resources to the reservation and sets the reservation to an active state.Type: ApplicationFiled: April 18, 2012Publication date: August 9, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: LINDA C. CHAM, ALEXANDER DRUYAN, WEI LI, KAILASH N. MARTHI, YUN T. XIANG
-
Publication number: 20120198462Abstract: A scheduler receives at least one flexible reservation request for scheduling in a computing environment comprising consumable resources. The flexible reservation request specifies a duration and at least one required resource. The consumable resources comprise at least one machine resource and at least one floating resource. The scheduler creates a flexible job for the at least one flexible reservation request and places the flexible job in a prioritized job queue for scheduling, wherein the flexible job is prioritizes relative to at least one regular job in the prioritized job queue. The scheduler adds a reservation set to a waiting state for the at least one flexible reservation request.Type: ApplicationFiled: February 1, 2011Publication date: August 2, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: LINDA C. CHAM, ALEXANDER DRUYAN, WEI LI, KAILASH N. MARTHI, YUN T. XIANG
-
Patent number: 8082546Abstract: Jobs are scheduled such that resource reuse is maximized and deallocation of reusable resources is minimized. A multi-phase scheduling capability is provided in which during a first phase, weights are assigned to the reusable resources, and during a second phase, the jobs are scheduled. If reusable resources are available for the job, the job is assigned to those resources. Otherwise, a search is performed for a solution which minimizes the weight and number of reusable resources that are to be deallocated.Type: GrantFiled: September 29, 2006Date of Patent: December 20, 2011Assignee: International Business Machines CorporationInventors: Richard J. Coppinger, Alexander Druyan
-
Patent number: 7920282Abstract: A method is provided for prioritizing jobs in a computing environment having a plurality of nodes sharing one or more resources. Such method includes, given a job A to be scheduled having certain resource requirements, generating a list P of already scheduled jobs which utilize resources required by job A and which can be preempted by job A. For each resource requirement of job A, an ordered list of jobs which can be preempted by job A is created which is ranked by the applicability of each job in the list relative to resource requirements of job A, so as to provide a plurality of ordered lists, one for each resource requirement. An ordered list L is generated by selecting one of the ordered lists, adding the top-ranked job from that ordered list to list L, then adding the top-ranked job from another one of the ordered lists to list L and so on, by repetitively selecting the top-ranked job from individual ones of all the ordered lists.Type: GrantFiled: February 23, 2006Date of Patent: April 5, 2011Assignee: International Business Machines CorporationInventors: Richard J. Coppinger, Alexander Druyan
-
Publication number: 20110072437Abstract: The present invention provides a method, program product, and information processing system that efficiently dispatches jobs from a job queue. The jobs are dispatched to the computational nodes in the system. First, for each job, the number of nodes required to perform the job and the required computational resources for each of these nodes are determined. Then, for each node required, a node is selected to determine whether a job scheduler has a record indicating if this node meets the required computational resource requirement. If no record exists, the job scheduler analyzes whether the node meets the computational resource requirements given that other jobs may be currently executing on that node. The result of this determination is recorded. If the node does meet the computational resource requirement, the node is assigned to the job. If the node does not meet the resource requirement, a next available node is selected.Type: ApplicationFiled: September 23, 2009Publication date: March 24, 2011Applicant: International Business Machines CorporationInventor: ALEXANDER DRUYAN
-
Patent number: 7865896Abstract: A method, system and program product are provided for facilitating scheduling of computer jobs of a computing environment having a plurality of resources. The method includes decoupling a job scheduling algorithm from responsibility for maintaining data structures for tracking recorded usage of the plurality of resources by computer jobs. The decoupling includes (i) providing resource space data structures separate from the job scheduling algorithm for recording usage of the plurality of resources by computer jobs; and (ii) providing operators for facilitating manipulation of values within the resource space data structures by the job scheduling algorithm and by one or more functions external to and independent of the job scheduling algorithm.Type: GrantFiled: December 15, 2005Date of Patent: January 4, 2011Assignee: International Business Machines CorporationInventors: Richard J. Coppinger, Alexander Druyan
-
Publication number: 20100293549Abstract: A system to improve cluster machine processing that may include a plurality of interconnected computers that process data as one if necessary, and at least one other plurality of interconnected computers that process data as one if necessary. The system may also include a central manager to control what data processing is performed on a shared processing job performed by the plurality of interconnected computers and the at least one other plurality of interconnected computers. Each of the plurality of interconnected computers runs parallel jobs scheduled by a local backfill scheduler. In order to schedule a cluster spanning parallel job, the local schedulers cooperate on placement and timing of the cluster spanning job, using existing backfill rules in order not to disturb the local job streams.Type: ApplicationFiled: January 31, 2008Publication date: November 18, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: David Paul Brelsford, Waiman Chan, Alexander Druyan, Joseph F. Skovira
-
Publication number: 20100122255Abstract: Start times are determined for jobs to be executed in the future in a multi-cluster environment. The start times are, for instance, the earliest start times in which the jobs may be executed. The start times are computed in logarithmic time, providing processing efficiencies for the multi-cluster environment. Processing efficiencies are further realized by employing parallel processing in determining the start times.Type: ApplicationFiled: November 7, 2008Publication date: May 13, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alexander Druyan, David P. Brelsford
-
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: 20080082979Abstract: Jobs are scheduled such that resource reuse is maximized and deallocation of reusable resources is minimized. A multi-phase scheduling capability is provided in which during a first phase, weights are assigned to the reusable resources, and during a second phase, the jobs are scheduled. If reusable resources are available for the job, the job is assigned to those resources. Otherwise, a search is performed for a solution which minimizes the weight and number of reusable resources that are to be deallocated.Type: ApplicationFiled: September 29, 2006Publication date: April 3, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Richard J. Coppinger, Alexander Druyan
-
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