International Business Machines Corporation

Vdopia Inc.

Prashant Pandey

David Darden Chambliss

Divyesh Jadav

Jian J Xu

Tzongyu Paul Lee

Ramachandran Gopalakrishna Menon

Guillermo Alvarez

Srikanth Kakani

Chhavi Upadhyay

Kaladhar Voruganti

Karan Gupta

Himabindu Pucha

Ryan McConville

Eric Joseph Wood

Peter Clayton Belknap

Leonard Chi Chiu Chung

Bhupendra Singh

James Allen Larkby-Lahet

Harry M Yudenfriend

Vijayshankar Raman

James Lee Hafner

Rui Zhang

Garret Frederick Swart

Prasenjit Sarkar

Jaishankar Moothedath Menon

Joseph S Hyde, Ii

Renu Tewari

Aameek Singh

Inderpal Singh Narang

Vijay Krishnarao Naik

James Alan Ruddy

Tarun Thakur

Madhukar R Korupolu

Pradeep Varma

William Griswold Sherman

Upendra Sharma

Reshu Jain

Rajagopal Ananthanarayanan

Bruce Light Hillsberg

Bhuvan Bamba

Mansi Ajit Shah

Vitthal Mahadeo Gogate

Nagraj Alur

Satyam Soni

Abhay Kumar Singh

Pushpender Singh

A method for video playback uses only resources universally supported by a browser ('inline playback') operating in virtually all handheld media devices. In one case, the method first prepares a video sequence for display by a browser by (a) dividing the video sequence into a silent video stream and an audio stream; (b) extracting from the silent video stream a number of still images, the number of still images corresponding to at least one of a desired output frame rate and a desired output resolution; and (c) combining the still images into a composite image. In one embodiment, the composite image having a number of rows, with each row being formed by the still images created from a fixed duration of the silent video stream. Another method plays the still images of the composite image as a video sequence by (a) loading the composite image to be displayed through a viewport defined the size of one of the still images; (b) selecting one of the still images of the composite image; (c) setting the viewport to display the selected still image; and (d) setting a timer for a specified time period based on a frame rate, such that, upon expiration of the specified time period: (i) selecting a next one of the still images to be displayed in the viewport, unless all still images of the composite image have been selected; and (ii) return to step (c) if not all still images have been selected.

Video display method

A real time video stream production system includes: (a) an advertising insertion server receiving over a wide area network a real time video stream; and (b) an advertising controller, which receives the real time video stream from the advertising insertion server. The advertising controller has a user interface which allows an operator to cause advertising impression data available from an advertising server to be included in a modified video data stream presented to a media player client for display.

Method and apparatus for insertion of advertising in a live video stream

Embodiments of the invention relate to optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity. An exemplary embodiment includes reserving a predetermined number of storage allocation regions for each node in a cluster, wherein each storage allocation region comprises a set of contiguous data blocks on a single storage disk of locally attached storage; using a contiguous set of data blocks on a single storage disk of locally attached storage as a file system's block allocation granularity for striping data to be stored in the file system for a compute operation in the cluster; and using a single data block of a shared storage subsystem as the file system's block allocation granularity for striping data to be stored in the file system for a data access operation in the cluster.

Optimizing a file system for different types of applications in a compute cluster using dynamic block size granularity

Methods, systems, and physical computer-readable storage medium for processing a plurality of IO request jobs are provided. The method includes determining whether one or more request jobs are not meeting a QoS target, each job of the one or more request jobs having a corresponding priority, selecting a highest priority job from the one or more request jobs, if one or more request jobs are not meeting the QoS target, determining whether the highest priority job has a corresponding effective rate limit imposed thereon, if so, relaxing the corresponding effective rate limit, and if not, selecting one or more lower priority jobs from the one or more request jobs and tightening a corresponding effective limit on the one or more lower priority jobs from the one or more request jobs in accordance with a delay factor limit.

Methods, systems, and physical computer storage media for processing a plurality of input/output request jobs

A process for caching data in a cache memory includes upon detecting that a first page is in a first or second list, the first page is moved to a most recently used (MRU) position in the second list. Upon detecting that the first page is in a first history list, a first target size is updated to a second target size for the first and second lists, the first page is moved from the first history list to the MRU position in the second list, and the first page is fetched to the cache memory. Upon detecting that the first page is in a second history list, the second target size is updated to a third target size for the first and second lists, and the first page is moved from the second history list to the MRU position in the second list.

Stable adaptive replacement cache processing

An apparatus, system, and method are disclosed for reporting on enterprise data processing system configurations. A collection module records a plurality of entity configurations for a DPS in a history database. In one embodiment, a selection module selects a subset of entities of the DPS. A report module generates a historical report of the plurality of entity configurations. In addition, the report module may generate the historical report for the selected subset of the entities.

Apparatus, system, and method for reporting on enterprise data processing system configurations

Embodiments are provided for managing the system performance of resources performing tasks in response to task requests from tenants. In one aspect, a system that comprises at least one resource configured to perform at least one admitted task with an impact under the control of a computer system. The computer system provides services to more than one tenant. The computer system comprises a strategist configured to assess the impact of the admitted task to create a cost function vector containing multiple cost function specifications and a budget policy vector containing multiple budget policies and an actuator. The actuator receives the cost function vector and the budget policy vector from the strategist, receives a task request one of the more than one tenants, and calculates cost functions based upon the cost function vector to predict the impact of the task request on the resources for each of the task requests. The actuator throttles the task requests based upon the budget policies for the impact on the resources to create at least one of the admitted task performed by the resource and a delayed task request.

Vector throttling to control resource use in computer systems

Embodiments of the invention relate to block layout and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation, include both write affinity and wide striping region. An allocation map is maintained to define and support the block allocation regions. For each write transaction, a copy of data is written to both regions, and in the event there is a shortage of blocks in one of the regions, at least one block in the other region is dynamically converted to support the write transaction.

Method and apparatus for optimizing data allocation

A storage placement planning system receives a resource graph describing SAN's resources and virtual machine applications requiring a particular amount of a processing resource element and a storage resource element. The system then determines a coupled placement of the processing element and storage element for each of the applications on a coupled pair of the resource nodes based on a specified throughput and a distance factor between coupled pairs of resource nodes. The coupled placement is determined using an algorithm that implements a cost function that determines affinities between processing nodes and storage nodes for each of said applications of a particular workload. The coupled placement for each of said applications identifies the particular amount of processing resource element placed on a first node for providing a processing resource and the particular amount of storage resource element placed on a second node for providing a storage resource for that application.

Integrated placement planning for heterogenous storage area network data centers

The invention provides a method for improving frequency-based caching algorithms by maintaining a stable history of evicted items. One embodiment involves a process for caching data in a cache memory including logical pages including, upon detecting that a first page is being evicted from the cache memory, performing an addition process by adding metadata of the first page to a stable history list. Upon detecting a cache miss for a second page, if the stable history list contains metadata for the second page, then removing the second page metadata from the stable history list and applying a promotion determination for the second page to determine a priority value for the second page metadata and placing the second page in the cache memory based on the priority data. Upon detecting that metadata of a third page is to be evicted from the stable history list, applying an eviction determination to evict metadata of the third page from the stable history list based on a predetermined caching rule.

Method for improving frequency-based caching algorithms by maintaining a stable history of evicted items

Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes, each node comprising a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of multiple data strips and associated parity strips, the stripes distributed across multiple corresponding primary data nodes and multiple corresponding parity nodes. A primary data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the multiple data strips. A read-modify-write parity update protocol is performed for maintaining parity coherency, the primary data node driving parity coherency with its corresponding parity nodes, independently of other data nodes, in order to keep its relevant parity strips coherent.

Read-modify-write protocol for maintaining parity coherency in a write-back distributed redundancy data storage system

In one embodiment, a method comprises, using at least one processor, controlling communication between Service Level Agreement (SLA) processes of an SLA services module and at least one I/O performance gateway; and using a thread pair associated with each of the at least one processors, processing inbound signals from the at least one I/O erformance atewa being sent to the SLA services module via an inbound thread, and processing outbound signals to the at least one I/O performance gateway received from the SLA services module via an outbound thread, wherein the inbound thread and the outbound thread operate asynchronously to provide non-blocking messaging.

Threaded messaging in a computer storage system

A performance manager and method for managing the performance of a computer system based on a system model that includes measured entities representing the operational characteristics of the system components and relationships among the measured entities. The performance manager includes data producers for interacting with the interface agents of the components, an engine for exchanging information with the data producers and the system model, and an interaction model for determining relevant measured entities in the system model. The system model and interaction model are maintained in a repository where data might be accessed via an access interface. Incoming performance data is analyzed by an analyzer in the background to detect trends and relationships among the entities. An operator might review the relevant entities and apply controls to selected entities to manage the overall system performance as well as to resolve problems affecting the performance of the components in the system.

System and method for managing the performance of a computer system based on operational characteristics of the system components

A method is disclosed that places data-intensive subprocesses in close physical and logical proximity to the facility responsible for storing the data, so that high efficiencies at reduced cost are achieved. In one specific example, new computer programs, termed adjuncts, are added and placed in a logical partition on a storage facility so that they can be invoked using appropriate commands issued on the I/O channel. Further, programs or changes are added to existing programs on the host machine, wherein such programs or changes discover the function extensions and invoke them to perform data processing.

System to delegate virtual storage access method related file operations to a storage server using an in-band RPC mechanism

Growing community of inventors

San Jose, CA, United States of America

Prashant Pandey