International Business Machines Corporation

David Blair Whitworth

Lokesh M Gupta

Kevin J Ash

Diane Garza Flemming

Michael T Benhase

William A Maron

Greg Robert Mewhinney

Wen-Tzer Thomas Chen, Jr

Mysore Sathyanaranyana Srinivas

Karthick Rajamani

John Charles Elliott

Charles Robert Lefurgy

Malcolm Scott Allen-Ware

Shawn P Authement

J Carlos A Pratt

Mysore Sathyanarayana Srinivas

Trung Ngoc Nguyen

Bret Ronald Olszewski

Eric Philip Fried

Brian Chase Twichell

Matthew J Kalos

Karl Allen Nielsen

Clint Alan Hardy

Randal Craig Swanberg

Michael Edward Factor

Kenneth Wayne Todd

Louis Alonso Rasor

Ronen Itshak Kat

Dalit Naor

Lee Charles LaFrese

Seamus Burke

Luc Rene Smolders

Jimmy Ray Hill

William Eugene Baker

Jeffrey Anderson Smith

Miriam Allalouf

James William VanFleet

Boyan Zhao

For efficient task scheduling using a locking mechanism, a new task is allowed to spin on the locking mechanism if a number of tasks spinning on the locking mechanism is less than a predetermined threshold for parallel operations requiring locks between the multiple threads.

Efficient task scheduling using a locking mechanism

A method includes monitoring power usage for a storage system that includes a set storage units at a first level of storage granularity and a set of storage sub-units at a second level of storage granularity, wherein the second level of storage granularity is finer than the first level of storage granularity. The method further includes assigning a non-uniform power budget to the set of storage units and adjusting a power budget for the storage sub-units according to the non-uniform power budget assigned to the storage units. A corresponding computer program product and computer system are also disclosed herein.

Storage system power usage

Mechanisms for improving computing system performance by a processor device. System resources are organized into a plurality of groups. Each of the plurality of groups is assigned one of a plurality of predetermined task pools. Each of the predetermined task pools has a plurality of tasks. Each of the plurality of groups corresponds to at least one physical boundary of the system resources such that a speed of an execution of those of the plurality of tasks for a particular one of the plurality of predetermined task pools is optimized by a placement of an association with the at least one physical boundary and the plurality of groups.

Task pooling and work affinity in data processing

Data operations, requiring a lock, are batched into a set of operations to be performed on a per-core basis. A global lock for the set of operations is periodically acquired, the set of operations is performed, and the global lock is freed so as to avoid excessive duty cycling of lock and unlock operations in the computing storage environment.

Deferred RE-MRU operations to reduce lock contention

Computer program product for managing storage system power usage by adjusting a flash device erasure rate and a data write rate for storage sub-units according to a non-uniform power budget

Deferred re-MRU operations to reduce lock contention

Managing storage system power usage by adjusting a flash device erasure rate and a data write rate for storage sub-units according to a non-uniform power budget

Exemplary method, system, and computer program product embodiments for increased cache performance using multi-level queues by a processor device. The method includes distributing to each one of a plurality of central processing units (CPUs) workload operations for creating complete tracks from partial tracks, creating sub-queues of the complete tracks for distributing to each one of the CPUs, and creating demote scan tasks based on workload of the CPUs. Additional system and computer program product embodiments are disclosed and provide related advantages.

Increased cache performance with multi-level queues of complete tracks

Monitoring power usage for a storage system that includes a set of storage units and a set of storage sub-units

Various embodiments for cache management in a distributed computing storage environment are provided. In one embodiment, a processor device, for a plurality of input/output (I/O) operations, initiates a process, separate from a process responsible for data segment assembly, for waking a predetermined number of waiting I/O operations.

Efficient processing of cache segment waiters

For a plurality of input/output (I/O) operations waiting to assemble complete data tracks from data segments, a process, separate from a process responsible for the data assembly into the complete data tracks is initiated, and the at least one complete data track is removed off of a free list by a first I/O waiter.

A method for processing instructions. The instructions are processed by a processor unit while using a first table in a plurality of tables to predict a set of instructions needed by the processor unit after processing of a conditional instruction. An identification is formed that a rate of success in correctly predicting the set of instructions when using the first table is less than a threshold number. A sequence of the instructions being processed by the processor unit is searched for an instruction that matches a marker in a set of markers for identifying when to use the plurality of tables. An identification that the instruction that matches the marker is formed. A second table from the plurality of tables referenced by the marker is identified. The second table is used in place of the first table.

Using a plurality of tables for improving performance in predicting branches in processor instructions

For a plurality of input/output (I/O) operations waiting to assemble complete data tracks from data segments, a process, separate from a process responsible for the data assembly into the complete data tracks, is initiated for waking a predetermined number of the waiting I/O operations.

A method, system and program are provided for controlling access to a specified cache level in a cache hierarchy in a multiprocessor system by evaluating cache statistics for a specified application at the specified cache level against predefined criteria to prevent the specified application from accessing the specified cache level if the specified application does not meeting the predefined criteria.

Use of cache statistics to ration cache hierarchy access

Growing community of inventors

Austin, TX, United States of America

David Blair Whitworth