International Business Machines Corporation

Michael Joseph Spreitzer

Malgorzata Steinder

Giovanni Pacifici

Asser Nasreldin Tantawi

Chunqiang Tang

Brian Keith Martin

Constantin Mircea Adam

Alaa Salah Youssef

Hai Huang

Hai Shan Wu

Paolo Dettori

Ali Kanso

Mariusz Sabath

Brian Keith Smith

Claris Castillo

Erik John Burckart

Gennaro A Cuomo

Curtis E Hrischuk

Ian N Whalley

Graham Derek Wallis

David Ware

Srinivas Hasti

Wolfgang Segmuller

John Paul Cammarata

Lin Sun

Aaron J Quirk

Xiao Liang Hu

Seetharami R Seelam

Andrew Russell Low

Yixin Diao

Nikolaos Anerousis

Vasanth Bala

Brian L Pulito

Douglas Berg

Rui Xiong Tian

James Edwin Hanson

Diana Jeanne Arroyo

Elizabeth Ann Black-Ziegelbein

Neil G S Young

Erik Alan Daughtrey

Michel Imhasly

Thomas D Haywood

Lan Vuong

Neil George Stanley Young

Jin Liang

According to one or more embodiments of the present invention, a computer-implemented method includes uploading, by a first instance of an integrated development environment (IDE), a first source-code change to a change log of a version control system. A second instance of the IDE is used to upload a second source-code change to the change log of the version control system. A determination is made that the second source-code change conflicts with the first source-code change. Based on the determination that the second source-code change conflicts with the first source-code change, generating a notification of the second source-code change is generated in the first instance of the IDE.

Collaborative software development tool for resolving potential code-change conflicts in real time

Techniques are provided for automated employment of respective quota managers for framework instances, where the respective quota managers can negotiate amongst themselves to manage usage of a resource of a shared computing system in relation to a quota for the resource for a tenant of the shared computing system. This can allow tenants to share their quota among multiple frameworks, enable quota exchange between multiple frameworks, and choose a quota with a minimum costs, and thus maximize savings.

Quota management protocol for shared computing systems

Using a metadata of a layer, a prediction factor including a level of participation of the layer in a set of container images is computed. Each container image includes a corresponding set of layers and is usable to configure a container in a container-based virtualized data processing environment. Using a set of levels of participation corresponding to a set of layers, and using a condition in a prediction algorithm, a subset of layers that have to be pre-provisioned at a node is predicted. The subset of layers is adjusted, to form an adjusted subset of layers, by looking ahead at a container requirement of a workload that is planned for processing at a future time. The adjusted subset of layers is caused to be provisioned on the node prior to the future time.

Predictive layer pre-provisioning in container-based virtualization

A technique is provided for creating virtual units in a computing environment. A virtual system definition is received by a processor that is utilized to create the virtual units for a virtual system. Relationship constraints between the virtual units in the virtual system are received by the processor. The relationship constraints between the virtual units include a communication link requirement between the virtual units and/or a location requirement between the virtual units. The virtual units in the virtual system are deployed by the processor according to the relationship constraints between virtual units.

Integrated virtual infrastructure system

A system for managing inbound messages in a server complex including one or more message consumers. The system includes a server configured to receive the inbound messages from a first peripheral device and to transmit messages to one or more of the plurality of message consumers. The system also includes an inbound message queue coupled to the server, the inbound message queue configured to store inbound message until an age of any message stored on the inbound message queue exceeds a predetermined threshold.

Inbound message rate limit based on maximum queue times

The invention relates to memory overload management for Java virtual machines (JVMs) in Web application sever systems. Disclosed is a method and system of memory overload management for a Web application sever system, wherein the Web application sever system comprises multiple JVMs, the method comprising: determining one or more replica shards for which replacement shall be performed; determining one or more target JVMs for storing a corresponding replica shard set including at least one replica shard from the one or more replica shards; and for each target JVM, performing the following: judging whether the free memory of the target JVM is adequate for storing the corresponding replica shard set; if the judging result is negative, performing the following: causing the target JVM to suspend the creation of session until the free memory of the target JVM becomes adequate for storing the corresponding replica shard set.

Managing memory overload of java virtual machines in web application server systems

A method and structure for processing an application program on a computer. In a memory of the computer executing the application, an in-memory cache structure is provided for normally temporarily storing data produced in the processing. An in-memory storage outside the in-memory cache structure is provided in the memory, for by-passing the in-memory cache structure for temporarily storing data under a predetermined condition. A sensor detects an amount of usage of the in-memory cache structure used to store data during the processing. When it is detected that the amount of usage exceeds the predetermined threshold, the processing is controlled so that the data produced in the processing is stored in the in-memory storage rather than in the in-memory cache structure.

I/O performance of data analytic workloads

A method, system and computer program product for storing data in memory. An example system includes at least one multistage application configured to generate intermediate data in a generating stage of the application and consume the intermediate data in a subsequent consuming stage of the application. A runtime profiler is configured to monitor the application's execution and dynamically allocate memory to the application from an in-memory data grid.

Execution of dataflow jobs

An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. A weight for a message is determined at a message management computing device based upon a number of hops and a latency of networks passed through by the message. A hop latency target for a current hop segment is evaluated relative to an overall latency target and the determined weight for the message. A priority of the message is adjusted in response to determining that the overall latency target, relative to the weight for the message and the hop latency target for the current hop segment, exceeds a configured allowable hop latency deviation for the current hop segment.

Path-based adaptive prioritization and latency management

A method for determining an application instance placement in a set of machines under one or more resource constraints includes the following steps. An estimate is computed of a value of the first metric that can be achieved by a current application instance placement and a current application load distribution. A new application instance placement and a new application load distribution are determined, wherein the new application instance placement and the new load distribution optimize the first metric.

Dynamic application instance placement in data center environments

A system, computer program and method for transmitting requested data from a data source in response to data transmission requests from at least one electronic device according to differential rates of throughput. Data transmission requests are classified into one of a plurality of throughput classes, with each throughput class having an assigned rate of throughput. A proportion of data transmission requests to be processed from each throughput class is selected such that each data transmission request has a rate of throughput approximating the assigned rate of throughput of its class. The requested data is then sent from the data source to the electronic device.

Providing different rates to different users of a download service

Provides control of the workload, flow control, and concurrency control of a computer system through the use of only external performance monitors. Data collected by external performance monitors are used to build a simple, black box model of the computer system, comprising two resources: a virtual bottleneck resource and a delay resource representing all non-bottleneck resources combined. The service times of the two resource types are two parameters of the black box model. The two parameters are evaluated based on historical data collected by the external performance monitors. The workload capacity that avoids saturation of the bottleneck resource is then determined and used as a control variable by a flow controller to limit the workload on the computer system. The workload may include a mix of traffic classes. In such a case, data is collected, parameters are evaluated and control variables are determined for each of the traffic classes.

Controlling workload of a computer system through only external monitoring

Coordinating tasks of performance management and application placement management in a dynamic fashion by: estimating capacity needs for various service classes of service requests; computing desired capacities of at least one application for said service requests; deciding whether the desired capacities are satisfied by a current application placement; making no change to current application placement if the desired capacities are satisfied; determining a new application placement based on the desired capacities and a projected load if the desired capacities are not satisfied; computing corresponding capacity constraints for all pairs of service classes and servers; and computing an optimal allocation of capacities among the service classes so as to optimize a quality of service.

Coordinating service performance and application placement management

An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. In an embodiment of the invention, a method of managing a message being conveyed through a request response protocol network via a path includes: receiving the message; determining for the message at least one of: an incoming portion of the path or an outgoing portion of the path; and adjusting a priority of the message based on a latency target for the determined portion of the path.

Growing community of inventors

Croton-on-Hudson, NY, United States of America

Michael Joseph Spreitzer