Patents by Inventor Joel Leonard Wolf
Joel Leonard Wolf 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: 9886307Abstract: Methods, systems, and computer program products for cross-platform scheduling with fairness and platform-specific optimization are provided herein. A method includes determining dimensions of a set of containers in which multiple tasks associated with a request are to be executed; assigning each of the containers to a processing node on one of multiple platforms based on the dimensions of the given container, and to a platform owner selected from the multiple platforms based on a comparison of resource requirements of each of the multiple platforms and the dimensions of the given container; and generating container assignments across the set of containers by incorporating the assigned node of each container in the set of containers, the assigned platform owner of each container in the set of containers, one or more scheduling requirements of each of the platforms, one or more utilization objectives, and enforcing a sharing guarantee of each of the platforms.Type: GrantFiled: July 1, 2015Date of Patent: February 6, 2018Assignee: International Business Machines CorporationInventors: Kirsten W. Hildrum, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Kanthi K. Sarpatwar, Rohit Wagle, Joel Leonard Wolf
-
Patent number: 9886306Abstract: Methods, systems, and computer program products for cross-platform scheduling with fairness and platform-specific optimization are provided herein. A method includes determining dimensions of a set of containers in which multiple tasks associated with a request are to be executed; assigning each of the containers to a processing node on one of multiple platforms based on the dimensions of the given container, and to a platform owner selected from the multiple platforms based on a comparison of resource requirements of each of the multiple platforms and the dimensions of the given container; and generating container assignments across the set of containers by incorporating the assigned node of each container in the set of containers, the assigned platform owner of each container in the set of containers, one or more scheduling requirements of each of the platforms, one or more utilization objectives, and enforcing a sharing guarantee of each of the platforms.Type: GrantFiled: November 21, 2014Date of Patent: February 6, 2018Assignee: International Business Machines CorporationInventors: Kirsten W. Hildrum, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Kanthi K. Sarpatwar, Rohit Wagle, Joel Leonard Wolf
-
Publication number: 20160150002Abstract: Methods, systems, and computer program products for cross-platform scheduling with fairness and platform-specific optimization are provided herein. A method includes determining dimensions of a set of containers in which multiple tasks associated with a request are to be executed; assigning each of the containers to a processing node on one of multiple platforms based on the dimensions of the given container, and to a platform owner selected from the multiple platforms based on a comparison of resource requirements of each of the multiple platforms and the dimensions of the given container; and generating container assignments across the set of containers by incorporating the assigned node of each container in the set of containers, the assigned platform owner of each container in the set of containers, one or more scheduling requirements of each of the platforms, one or more utilization objectives, and enforcing a sharing guarantee of each of the platforms.Type: ApplicationFiled: November 21, 2014Publication date: May 26, 2016Inventors: Kirsten W. Hildrum, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Kanthi K. Sarpatwar, Rohit Wagle, Joel Leonard Wolf
-
Publication number: 20160147566Abstract: Methods, systems, and computer program products for cross-platform scheduling with fairness and platform-specific optimization are provided herein. A method includes determining dimensions of a set of containers in which multiple tasks associated with a request are to be executed; assigning each of the containers to a processing node on one of multiple platforms based on the dimensions of the given container, and to a platform owner selected from the multiple platforms based on a comparison of resource requirements of each of the multiple platforms and the dimensions of the given container; and generating container assignments across the set of containers by incorporating the assigned node of each container in the set of containers, the assigned platform owner of each container in the set of containers, one or more scheduling requirements of each of the platforms, one or more utilization objectives, and enforcing a sharing guarantee of each of the platforms.Type: ApplicationFiled: July 1, 2015Publication date: May 26, 2016Inventors: Kirsten W. Hildrum, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Kanthi K. Sarpatwar, Rohit Wagle, Joel Leonard Wolf
-
Patent number: 8806510Abstract: Techniques for determining feasibility of a set of one or more operator partitioning constraints are provided. The techniques include receiving one or more sets of operator partitioning constraints, wherein each set of one or more constraints define one or more desired conditions for grouping together of operators into partitions and placing partitions on hosts, wherein each operator is embodied as software that performs a particular function, processing each set of one or more operator partitioning constraints to determine feasibility of each set of one or more operator partitioning constraints, creating and outputting one or more candidate partitions and one or more host placements for each set of feasible partitioning constraints, and creating and outputting a certificate of infeasibility for each set of infeasible partitioning constraints, wherein the certificate of infeasibility outlines one or more reasons for infeasibility.Type: GrantFiled: September 10, 2009Date of Patent: August 12, 2014Assignee: International Business Machines CorporationInventors: Henrique Andrade, Bugra Gedik, Kirsten Weale Hildrum, Rohit Madhukar Khandekar, Sujay Sunil Parekh, Deepak Rajan, Joel Leonard Wolf, Kun-Lung Wu
-
Patent number: 8683150Abstract: A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.Type: GrantFiled: September 14, 2012Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Nikhil Bansal, Frederick Douglis, Lisa Karen Fleischer, Kirsten Weale Hildrum, Akshay Kumar Reddy Katta, John Davis Palmer, Elizabeth Suzanne Richards, David Tao, William Harold Tetzlaff, Joel Leonard Wolf, Philip Shi-lung Yu
-
Patent number: 8533722Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.Type: GrantFiled: June 3, 2008Date of Patent: September 10, 2013Assignee: International Business Machines CorporationInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf
-
Patent number: 8458720Abstract: A system and method for choosing non-continual jobs to run in a stream-based distributed computer system includes determining a total amount of resources to be consumed by non-continual jobs. A priority threshold is determined above which jobs will be accepted, below which jobs will be rejected. Overall penalties are minimized relative to the priority threshold based on estimated completion times of the jobs. System constraints are applied to ensure that jobs meet set criteria such that a plurality of non-continual jobs are scheduled which consider the system constraints and minimize overall penalties using available resources.Type: GrantFiled: August 17, 2007Date of Patent: June 4, 2013Assignee: International Business Machines CorporationInventors: Nikhil Bansal, Kirsten Weale Hildrum, Deepak Rajan, Joel Leonard Wolf
-
Patent number: 8437029Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.Type: GrantFiled: June 15, 2011Date of Patent: May 7, 2013Assignee: International Business Machines CorporationInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
-
Publication number: 20130013873Abstract: A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.Type: ApplicationFiled: September 14, 2012Publication date: January 10, 2013Inventors: Nikhil Bansal, Frederick Douglis, Lisa Karen Fleischer, Kirsten Weale Hildrum, Akshay Kumar Reddy Katta, John Davis Palmer, Elizabeth Suzanne Richards, David Tao, William Harold Tetzlaff, Joel Leonard Wolf, Philip Shi-lung Yu
-
Patent number: 8302097Abstract: The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances.Type: GrantFiled: June 25, 2007Date of Patent: October 30, 2012Assignee: International Business Machines CorporationInventors: Melissa Jane Buco, Rong Nickle Chang, Laura Zaihua Luan, Christopher Ward, Joel Leonard Wolf, Philip Shi-lung Yu
-
Patent number: 8275957Abstract: A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.Type: GrantFiled: April 3, 2008Date of Patent: September 25, 2012Assignee: International Business Machines CorporationInventors: Nikhil Bansal, Frederick Douglis, Lisa Karen Fleischer, Kirsten Weale Hildrum, Akshay Kumar Reddy Katta, John Davis Palmer, Elizabeth Suzanne Richards, David Tao, William Harold Tetzlaff, Joel Leonard Wolf, Philip Shi-lung Yu
-
Publication number: 20110246999Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.Type: ApplicationFiled: June 15, 2011Publication date: October 6, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
-
Patent number: 8018614Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.Type: GrantFiled: June 3, 2008Date of Patent: September 13, 2011Assignee: International Business Machines CorporationInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
-
Patent number: 7958093Abstract: A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.Type: GrantFiled: September 17, 2004Date of Patent: June 7, 2011Assignee: International Business Machines CorporationInventors: Kay Schwendimann Anderson, Frederick Douglis, Nagui Halim, John Davis Palmer, Elizabeth Suzanne Richards, David Tao, William Harold Tetzlaff, John Michael Tracey, Joel Leonard Wolf
-
Patent number: 7853949Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.Type: GrantFiled: March 13, 2006Date of Patent: December 14, 2010Assignee: International Business Machines CorporationInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf
-
Publication number: 20100242042Abstract: An apparatus and method for scheduling stream-based applications in a distributed computer system includes a scheduler configured to schedule work using three temporal levels. Each temporal level includes a method. A macro method is configured to schedule jobs that will run, in a highest temporal level, in accordance with a plurality of operation constraints to optimize importance of work. A micro method is configured to fractionally allocate, at a medium temporal level, processing elements to processing nodes in the system to react to changing importance of the work. A nano method is configured to revise, at a lowest temporal level, fractional allocations on a continual basis.Type: ApplicationFiled: March 13, 2006Publication date: September 23, 2010Inventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Kun-Lung Wu
-
Patent number: 7738129Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.Type: GrantFiled: March 13, 2006Date of Patent: June 15, 2010Assignee: International Business Machines CorporationInventors: Nikhil Bansal, James R. H. Challenger, Lisa Karen Fleischer, Oktay Gunluk, Kirsten Weale Hildrum, Richard P. King, Deepak Rajan, David Tao, Joel Leonard Wolf, Laura Wynter
-
Publication number: 20090300623Abstract: A system and method for choosing non-continual jobs to run in a stream-based distributed computer system includes determining a total amount of resources to be consumed by non-continual jobs. A priority threshold is determined above which jobs will be accepted, below which jobs will be rejected. Overall penalties are minimized relative to the priority threshold based on estimated completion times of the jobs. System constraints are applied to ensure that jobs meet set criteria such that a plurality of non-continual jobs are scheduled which consider the system constraints and minimize overall penalties using available resources.Type: ApplicationFiled: August 17, 2007Publication date: December 3, 2009Inventors: Nikhil Bansal, Kirsten Weale Hildrum, Deepak Rajan, Joel Leonard Wolf
-
Patent number: 7480913Abstract: The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances.Type: GrantFiled: September 9, 2003Date of Patent: January 20, 2009Assignee: International Business Machines CorporationInventors: Melissa Jane Buco, Rong Nickle Chang, Laura Zaihua Luan, Christopher Ward, Joel Leonard Wolf, Philip Shi-lung Yu