International Business Machines Corporation

Nikhil Bansal

Joel Leonard Wolf

Kirsten Weale Hildrum

Deepak Rajan

David Tao

Lisa Karen Fleischer

James R H Challenger

Richard Pervin King

Laura Wynter

Oktay Gunluk

Philip Shi-lung Yu

Frederick Douglis

John Davis Palmer

William H Tetzlaff

Elizabeth Suzanne Richards

Akshay Kumar Reddy Katta

Eugen Schenfeld

Yoonho Park

James R Giles

Xiaolan Zhang

Rohit Wagle

Chitra Venkatramani

Ranjita Bhagwan

Philippe L Seto

A method, apparatus, and computer program product for scheduling stream-based applications in a distributed computer system with configurable networks are provided. The method includes choosing, at a highest temporal level, jobs that will run, an optimal template alternative for the jobs that will run, network topology, and candidate processing nodes for processing elements of the optimal template alternative for each running job to maximize importance of work performed by the system. The method further includes making, at a medium temporal level, fractional allocations and re-allocations of the candidate processing elements to the processing nodes in the system to react to changing importance of the work. The method also includes revising, at a lowest temporal level, the fractional allocations and re-allocations on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work.

Method, apparatus, and computer program product for scheduling work in a stream-oriented computer system with configurable networks

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.

System and method for optimizing data in value-based storage system

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.

Method and apparatus for assigning fractional processing nodes to work in a stream-oriented computer system

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.

Methods and systems for assigning non-continual jobs to candidate processing nodes in a stream-oriented computer system

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.

Method and apparatus for assigning candidate processing nodes in a stream-oriented computer system

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.

A system and method for allocating distributed processing systems includes inputting component descriptions in a distributed processing system and determining importance of each component. Capacity and failure characteristics of resource groups representing units of available processing capacity are also input. Components are assigned to a plurality of resource groups based on the capacity. Each resource group includes components where the failure characteristics permit simultaneous failures, such that in the event of such failures, an output value of the application is maximized.

System and method for dependent failure-aware allocation of distributed data-processing systems

Growing community of inventors

Yorktown Heights, NY, United States of America

Nikhil Bansal