International Business Machines Corporation

Globalfoundries U.S. 2 LLC

Marc Adam Kaplan

Wayne A Sawdon

Larry Bert Brenner

John Arthur Pershing, Jr

Peter Richard Badovinatz

Tushar Deepak Chandra

Orvalle Theodore Kirby

Ajei Sarat Gopal

Marion Lee Blount

Joshua S Auerbach

Marcia Lambert Peters

John Joseph Turek

John E Drake, Jr

John G Dudley

Jeffrey Haskell Derby

Kenneth Harvey Potter, Jr

Shay Kutten

Dennis Duane Jurgensen

Sven Oehme

Chee-Seng Chow

Frank Bernhard Schmuck

Murthy V Devarakonda

Robert Evan Strom

Israel Cidon

Roch A Guerin

Deepavali M Bhagwat

Pradeep Kumar Dubey

Michael James Ward

Daniel Charles Sturman

Gerald Arnold Marin

Sumeer K Bhola

Inder Sarat Gopal

M Corneliu Constantinescu

Mark C Astley

John Joseph Edward Turek

Leo S Luan

Elizabeth A Hervatic

Yuanyuan Zhao

Mon-Song Chen

Sanjay Mukund Joshi

Tsipora P Barzilai

Bharath K Kadaba

Prabandham M Gopal

Kelly Anne Shaw

Joshua Seth Auerbach

Elizabeth Anne Hervatic

John Ellis Drake

Prabandham Madan Gopal

Jeffrey Owen Kephart

Akshat Verma

Yixin Diao

Rajarshi Das

Anna Povzner

Jason Christopher Young

Upendra Sharma

James John Seeger, Jr

Rohit Jain

Saurabh Bagchi

James P Janniello

Allan K Edwards

James Rubas

David William Davenport

Theodore E Tedijanto

Chandra Paul Immanuel

Jeffrey Charles Crigler

Frank Stewart Filz

Mandis Sadr Mohammad Beigi

Francis R Koperda

Rachel A Bodner

Embodiments relate to policy-based, multi-scheme data reduction for a computer memory. An aspect includes receiving a plurality of policy rules by a policy engine of the computer memory, wherein a first policy rule specifies applying a first data reduction scheme to data in the computer memory based on the data matching first characteristics, wherein a second policy rule specifies applying a second data reduction scheme to data in the computer memory based on the data matching second characteristics, wherein the first data reduction scheme is different from the second data reduction scheme. Another aspect includes determining, by the policy engine, that first data in the computer memory matches the first characteristics, and that second data in the computer memory matches the second characteristics. Yet another aspect includes applying the first data reduction scheme to the first data, and applying the second data reduction scheme to the second data.

Policy-based, multi-scheme data reduction for computer memory

A computer-implemented method according to one embodiment includes identifying an event associated with a high speed storage tier of a data storage system, determining a policy rule that is triggered in response to the event, and implementing one or more data management actions associated with the high speed storage tier according to the policy rule.

Dynamically managing a high speed storage tier of a data storage system

A computer-implemented method according to one embodiment includes identifying an event associated with data stored in a data storage system, determining a policy rule that is triggered in response to the event, and implementing one or more actions according to the policy rule.

Dynamically reacting to events within a data storage system

Embodiments relate to scheduling operations to perform on objects. A method for scheduling operations to perform on objects is provided. The method identifies a plurality of operations to perform on a plurality of objects each having at least one attribute. At least one of the operations has scheduling dependency on another operation. The method generates a numeric value for each of the objects from the attribute of the object. The method schedules the operations to perform on the objects based on the numeric values of the objects and the scheduling dependency.

Augmented directory hash for efficient file system operations and data management

A method for secure portable operating system interface (POSIX) directory traversing for opening and accessing files by inode number. The method includes receiving, by a process executed by a processor, a request for a ticket for traversing a file system. The process generates a secure key for a unique handle object based on the request for the ticket. An authentication code is generated for the ticket using a numeric file identifier and the secure key. In response to reading a directory with POSIX x and r permissions according to directory permission bits or an access control list (ACL), the ticket is returned including ticket information including the numeric file identifier, generation information and the authentication code. In response to a request to open a directory, the ticket information is validated based on the secure key. A directory is opened for reading using the validated ticket information and the unique handle.

Posixly secure open and access files by inode number

Aspects of the invention are provided for rate control and management of service requests. A token bucket is employed in conjunction with a capacity sharing scheme to manage processing of service requests. Each token represents the capacity reserved for a particular source of requests. Excess tokens may be shed, with the excess tokens representing available excess capacity. Similarly, a projected time at which the service request(s) may be released may be computed in the event the bucket does not contain the required quantity of tokens to process the request.

Rate control by token buckets

Managing a shared file system comprising a directory and files stored on a multiple storage devices shared by plural processing nodes, is provided. A plurality of parallel directory traversal records are partitioned into a plurality of ranges to allow for the records in each range to be written independently in parallel by plural processing nodes during parallel directory traversal. Parallel operations are performed comprising parallel directory traversal of all directory paths and files in the shared file system.

Scalable file management for a shared file system

There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.

Changed files list with time buckets for efficient storage management

There is provided, in a computer processing system, an apparatus for storage lifecycle management for a plurality of managed objects. The apparatus includes a policy decision manager for creating and managing a policy decision stash. The policy decision stash is associated with predictive policy decisions for the plurality of managed objects and is configured to allow the predictive policy decisions for the plurality of managed objects to be incrementally updated and accessed in the policy decision stash by a policy identifier and an effective timestamp.

Policy decision stash for storage lifecycle management

A method and system performs dynamic online multi-parameter optimization for autonomic computing systems. A simplex is maintained. The system's performance is measured for the particular setting of configuration parameters associated with each point in the simplex. A new sample point is determined using the geometric transformations of the simplex. A current best point in the simplex can be resampled to determine if the environment has changed. If a sufficiently different utility value is obtained from a previously sampled utility value for the point in the simplex, the simplex is expanded. If the difference is not sufficient enough, then contraction of the simplex is performed.

Dynamic online multi-parameter optimization system and method for autonomic computing systems

A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.

Concurrent evaluation of policies with synchronization

A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client is disclosed. The system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker may be operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.

Gapless delivery and durable subscriptions in a content-based publish/subscribe system

A content-based publish/subscribe system for providing gapless message delivery from a publishing client to a subscribing client, the system includes a plurality of brokers operatively coupled to one another via a network. Each of the brokers include at least one processor and are configured as a publisher-hosting broker, a subscriber-hosting broker or an intermediate broker. The subscriber-hosting broker is operatively coupled to the publisher-hosting broker via the network through the intermediate broker. At least a portion of the plurality of brokers are configured so as to eliminate a need for persistent storage of messages at the intermediate broker and to substantially guarantee a gapless delivery of one or more messages transmitted by the publishing client to the subscribing client, even in the presence of a failure in the publish/subscribe system.

Growing community of inventors

Katonah, NY, United States of America

Marc Adam Kaplan