International Business Machines Corporation

Fabio Benedetti

Arcangelo Di Balsamo

Pietro Iannucci

Luigi Pichetti

Alessandro Donatelli

Fabio Barillari

Stefano Sidoti

Claudio Marinelli

Scot MacLellan

Jonathan Mark Wagner

Fabio Cerri

Riccardo Rossi

Filomena Ferrara

Giulio Santoli

Paolo Deidda

David B Kumhyr

Liana Liyow Fong

Seetharami R Seelam

Rosario Gangemi

Antonio Di Cocco

Norman Bobroff

Jacques Fontignie

Gianluca Mariani

Marcello Vitaletti

Giovanni Lanfranchi

Marco De Santis

Yanbin Liu

Pietro Marella

Salvatore D'Alo'

Rosario Boccia

Maria Pia Cagnetta

Scot Maclellan

An access management process orchestration method, an access management governance orchestrator, and a computer program product. One embodiment may comprise receiving a request for accessing a managed resource of an information system, querying an authorization for accessing the resource from an access manager, and in response to the querying of the authorization, requesting an access control policy update to grant the access to the managed resource. Receiving the request, querying the authorization, and requesting the access control policy update may comprise generating a transaction record, and adding the transaction record to a distributed ledger, wherein the distributed ledger simultaneously maintains the transaction record at multiple nodes throughout a network.

Low trust privileged access management

Systems and methods for software tracking and management are disclosed. In embodiments, a computer-implemented method comprises: receiving, by a computing device, build output code from one or more user computer devices via a network, wherein the build output code is generated in response to a software build; automatically identifying, by the computing device, differences between the build output code and associated in-production software code; automatically mapping, by the computing device, the differences to microservices of the in-production software code; and generating, by the computing device, a list of microservices of the in-production software code affected by the differences in a rollout of the build output code based on the mapping.

Software change tracking and management

A diagnosis server for collaborating with electronic noses, a related mobile diagnosis unit and a related method may be provided. A diagnosis server may comprise a receiver unit for receiving a set of data from one out of a plurality of e-noses. The set of data may comprise a sensor identifier, a sensor output value, and a relevance flag for a predefined diagnosis. A determination unit may determine a probability factor for the predefined diagnosis based on the set of data, a relevance function and a distribution function.

Collaborative electronic nose management in personal devices

A system and diagnosis server are provided for collaborating with electronic noses, as well as a related mobile diagnosis unit and related method. The diagnosis server includes a receiver unit for receiving a set of data from one e-nose of a plurality of e-noses. The set of data may include a sensor identifier, a sensor output value, and a relevance flag for a predefined diagnosis. In addition, a determination unit determines a probability factor for the predefined diagnosis based on the set of data, a relevance function and a distribution function.

Provided are a computer program product, system, and method for monitoring resources in a cloud computing environment. A set of cloud resources is provisioned to a user of the cloud-computing environment. A set of private resources is provided for the user, each private resource being provisioned within the set of cloud resources of the user. Monitoring templates are exposed, each one for a corresponding type of a private resource to the user. A user subscription is received to at least one of the monitoring templates, wherein each of the subscribed monitoring templates is for one of the user private resources. A private monitoring agent is provided within the cloud resources of the user housing the private resource of the user to monitor the private resource according to the corresponding selected monitoring template.

Monitoring resources in a cloud-computing environment

A solution is proposed for maintaining virtual machines being available in a data-processing system. A mechanism determines a list of software components installed on each virtual machine, retrieves a set of maintenance policies for each software component, each maintenance policy being indicative of a patch to be applied to the corresponding software component. The mechanism determines a set of old virtual machines having at least one old software component thereof requiring the application of at least a new one of the corresponding patches according to a comparison among the maintenance policies and a maintenance register indicative of a current state of the software components of the virtual machines. The mechanism applies the corresponding at least one new patch to each old software component of each old virtual machine and updates the maintenance register according to the application of said at least one new patch to each old software component of each old virtual machine.

Maintenance of offline virtual machines based on a maintenance register

Methods and apparatus are provided for evaluating potential resource capacity in a system where there is elasticity and competition between a plurality of containers. A dynamic potential capacity is determined for at least one container in a plurality of containers competing for a total capacity of a larger container. A current utilization by each of the plurality of competing containers is obtained, and an equilibrium capacity is determined for each of the competing containers. The equilibrium capacity indicates a capacity that the corresponding container is entitled to. The dynamic potential capacity is determined based on the total capacity, a comparison of one or more of the current utilizations to one or more of the corresponding equilibrium capacities and a relative resource weight of each of the plurality of competing containers. The dynamic potential capacity is optionally recalculated when the set of plurality of containers is changed or after the assignment of each work element.

Methods and apparatus for resource capacity evaluation in a system of virtual containers

Protecting privacy when communicating with a web server via a communication network, includes receiving by a first privacy agent a request from an application program of a client system for a connection to a web server having a target web server address, sending the request together with a first identification from the first privacy agent to the second privacy agent, forwarding the request together with a second identification from the second privacy agent to the third privacy agent. Further processing is performed responsive to determining that the target web server address matches a defined web server address which is accessible by the third privacy agent.

Protecting privacy when communicating with a web server

A method for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Managing job execution

A system or computer usable program product for managing jobs scheduled for execution on a target system in which some jobs may spawn additional jobs scheduled for execution on the target system including intercepting jobs scheduled for execution in the target system, determining whether there is resource sufficiency in the target system for executing jobs, responsive to an affirmative determination of resource sufficiency, releasing previously intercepted jobs for execution in the target system, computing a limit of a number of jobs which can be concurrently scheduled by an external system to the target system, and transmitting the computed limit to the external system.

Methods, systems, and computer program products for aggregating service components in a data processing system according to predefined aggregation rules. The method includes providing a plurality of visual elements, each visual element representing a corresponding service component; selecting a new visual element for addition to an aggregation structure; determining a set of eligible visual elements of eligible service components among the instantiated service components; associating a visual cue with the eligible visual elements; and aggregating the new service component to a selected eligible service component in the aggregation structure. The new service component is compatible for aggregation with each eligible service component according to the aggregation rules. The aggregation structure includes an aggregation of instantiated visual elements of instantiated service components to define an aggregated service according to the aggregation of the instantiated service components.

Aggregating service components

Method and system for providing a mechanism for determining an optimal workload distribution, from a plurality of candidate workload distributions, each of which has been determined to optimize a particular aspect of a workload-scheduling problem. More particularly, the preferred embodiment determines a workload distribution based on resource selection policies. From this workload distribution, the preferred embodiment optionally determines a workload distribution based on job priorities. From either or both of the above parameters, the preferred embodiment determines a workload distribution based on a total prioritized weight parameter. The preferred embodiment also determines a workload distribution which attempts to match the previously determined candidate workload distributions to a goal distribution. Similarly, the preferred embodiment calculates a further workload distribution which attempts to maximize job throughput.

Method, system and computer program for distributing a plurality of jobs to a plurality of computers

The present invention proposes a scheduler, which is used to submit execution of jobs according to a predefined plan. Each job is defined by a corresponding descriptor. The descriptor specifies the resources to be used by the jobs (through their properties). In addition, for each resource the descriptor can also specify one or more relationships with other resources (defined by their properties as well). When the job must be submitted, the scheduler identifies the actual resources that possess the desired properties and that satisfy the desired relationships. For this purpose, the scheduler accesses a repository with stores information about the available resources and their relationships.

Method and system for scheduling jobs based on resource relationships

A solution is proposed for facilitating the selection of execution servers to be used in a scheduler for submitting the execution of jobs. Each job is defined by a corresponding descriptor. The descriptor specifies the execution servers to be used by the jobs in a formal way (through their properties); in addition, the descriptor may also include the definition of formal relationships to be satisfied by the execution server with other resources of the system (in turn defined in a formal way through their properties). A query is created according to the descriptor for selecting (concrete) execution servers having the desired properties and satisfying the desired relationships with the resources of the system. This query is then run on a central database, wherein all the concrete execution servers, resources and relationships are defined. In this way, it is possible to obtain a list of concrete execution servers eligible to execute the job in a single transaction.

Growing community of inventors

Rome, Italy

Fabio Benedetti