Abstract: A system and method may be utilized to identify concurrency levels of processing stages in a distributed system, identify common resources and bottlenecks in the distributed system using the identified concurrency levels, and allocate resources in the distributed system using the identified concurrency levels.

Abstract: A system and method may be utilized to identify concurrency levels of processing stages in a distributed system, identify common resources and bottlenecks in the distributed system using the identified concurrency levels, and allocate resources in the distributed system using the identified concurrency levels.

Abstract: One aspect provides an apparatus including: at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code including: computer readable program code configured to, responsive to a request for data and a miss in both a first cache and a second cache, retrieve the data from memory, the first cache storing at least a subset of data stored in the second cache; computer readable program code configured to infer from information available from the first cache a replacement entry in the second cache; and computer readable program code configured to, responsive to inferring from information available from the first cache a replacement entry in the second cache, replace an entry in the second cache with the data from memory. Other aspects are described and claimed.

Abstract: One aspect provides a method including: responsive to a request for data and a miss in both a first cache and a second cache, retrieving the data from memory, the first cache storing at least a subset of data stored in the second cache; inferring from information pertaining to the first cache a replacement entry in the second cache; and responsive to inferring from information pertaining to the first cache a replacement entry in the second cache, replacing an entry in the second cache with the data from memory. Other aspects are described and claimed.

Abstract: Affinity-based preferential call technique, in one aspect, may improve performance of distributed applications in a hybrid system having heterogeneous platforms. A segment of code in a program being executed on a processor may be intercepted or trapped in runtime. A platform is selected in the hybrid system for executing said segment of code, the platform determined to run the segment of code with best efficiency among a plurality of platforms in the hybrid system. The segment of code is dynamically executed on the selected platform determined to run the segment of code with best efficiency.

Abstract: Techniques for quantifying and improving consumability of software bundles are provided. In one aspect, a method for quantifying a consumability of a software bundle is provided which includes the following steps. Constituent software products of the bundle are identified. Software components an installation of which is a pre-requirement for an installation of the software products are identified. Software units an installation of which is a pre-requirement for an installation of the software components are identified. Dependency graphs are created for the software components. The dependency graphs for the components are merged to create dependency graphs for the products. The dependency graphs for the products are merged to create a dependency graph for the bundle. The dependency graph for the bundle is used to quantify the consumability of the bundle.

Abstract: Yield management techniques are provided. In one aspect of the invention, a technique for managing one or more computing resources comprises the following steps/operations. Data associated with at least one potential demand for use of the one or more computing resources is obtained. Then, a management model (e.g., a yield management model or a revenue management model) is generated in accordance with at least a portion of the obtained data, wherein the management model is operative to determine an allocation of the one or more computing resources based on combinations of price levels and service levels that may be offered to one or more users of the one or more computing resources so as to attempt to satisfy at least one management goal.

Abstract: A data processing system includes a plurality of virtual machines each having associated memory pages; a shared memory page cache that is accessible by each of the plurality of virtual machines; and a global hash map that is accessible by each of the plurality of virtual machines. The data processing system is configured such that, for a particular memory page stored in the shared memory page cache that is associated with two or more of the plurality of virtual machines, there is a single key stored in the global hash map that identifies at least a storage location in the shared memory page cache of the particular memory page. The system can be embodied at least partially in a cloud computing system.

Abstract: An exemplary method in accordance with embodiments of this invention includes, at a virtual machine that forms a part of a cluster of virtual machines, computing a key for an instance of a memory page that is to be swapped out to a shared memory cache that is accessible by all virtual machines of the cluster of virtual machines; determining if the computed key is already present in a global hash map that is accessible by all virtual machines of the cluster of virtual machines; and only if it is determined that the computed key is not already present in the global hash map, storing the computed key in the global hash map and the instance of the memory page in the shared memory cache.

Abstract: A system, method and computer program product for presenting Uniform Resource Locator (URL) search results in response to a user query. The method includes receiving inputs from a plurality of users, each input from a respective user representing a path traversal of web pages identified by that user as having a relevance as determined by that user from a list of search result URLs generated by a search engine in response to a query. The system generates, from the received user inputs, a traversal result comprising a super directed graph, or a sub-directed graph constructed from the super directed graph, of web page nodes representing the URLs interconnected by edges, the super directed graph configured to include those URLs based on a popularity measure of the pages traversed; and the traversal result is displayed to include the URLs for user selection, in response to a subsequent user query.

Abstract: A system and method may be utilized to identify concurrency levels of processing stages in a distributed system, identify common resources and bottlenecks in the distributed system using the identified concurrency levels, and allocate resources in the distributed system using the identified concurrency levels.

Abstract: A system and method may be utilized to identify concurrency levels of processing stages in a distributed system, identify common resources and bottlenecks in the distributed system using the identified concurrency levels, and allocate resources in the distributed system using the identified concurrency levels.

Abstract: Methods and arrangements for facilitating accelerations of database functions. A field programmable gate array is incorporated. At least one query control block is incorporated in the field programmable gate array, and database management system operations are accelerated via the field programmable gate array. The accelerating includes employing the at least one query control block to execute a query without reconfiguring the field programmable gate array.

Abstract: Methods and arrangements for facilitating accelerations of database functions. A field programmable gate array is incorporated. At least one query control block is incorporated in the field programmable gate array, and database management system operations are accelerated via the field programmable gate array. The accelerating includes employing the at least one query control block to execute a query without reconfiguring the field programmable gate array.

Abstract: A method and structure for reducing customer dissatisfaction for waiting includes a queue monitoring subsystem which detects an entry of a customer into a waiting queue. A reward computing subsystem calculates a reward for the customer for being in the waiting queue, and a communication subsystem communicates the reward to the customer. At least one of subsystems is automated.

Abstract: A method for configuring a large hybrid memory subsystem having a large cache size in a computing system where one or more performance metrics of the computing system are expressed as an explicit function of configuration parameters of the memory subsystem and workload parameters of the memory subsystem. The computing system hosts applications that utilize the memory subsystem, and the performance metrics cover the use of the memory subsystem by the applications. A performance goal containing values for the performance metric is identified for the computing system. These values for the performance metrics are used in the explicit function of performance metrics, configuration parameters and workload parameters to calculate values for the configuration parameters that achieve the identified performance goal. The calculated values of the configuration parameters are implemented in the memory subsystem.

Abstract: Techniques for quantifying and improving consumability of software bundles are provided. In one aspect, a method for quantifying a consumability of a software bundle is provided which includes the following steps. Constituent software products of the bundle are identified. Software components an installation of which is a pre-requirement for an installation of the software products are identified. Software units an installation of which is a pre-requirement for an installation of the software components are identified. Dependency graphs are created for the software components. The dependency graphs for the components are merged to create dependency graphs for the products. The dependency graphs for the products are merged to create a dependency graph for the bundle. The dependency graph for the bundle is used to quantify the consumability of the bundle.

Abstract: A system and method for processing an information unit/packet (IU) in a stream processing system includes decomposing an IU into sub-information units persisted other than in the IU. An index or reference is generated in the IU for retrieving the persisted sub-information units during processing.

Abstract: A method for implementing inter-domain information quality assessment includes calculating relationships among domains in a knowledge base by identifying features that respectively define each of the domains and identifying domains having correlating features. The method also includes assigning values to pairs of the domains that reflect a closeness of the relationships based upon the correlating features. The method further includes evaluating a reputation of an entity in one domain based on past performance of the entity with respect to another domain where the other domain is determined, via the assigned values, to be related to the domain. The past performance of the entity indicates capabilities of the entity to render accurate predictions about events in a particular domain. The method also includes calculating a value representing the reputation of the entity with respect to the domain based upon the evaluation and assigning the value representing the reputation to the entity.

Abstract: Affinity-based preferential call technique, in one aspect, may improve performance of distributed applications in a hybrid system having heterogeneous platforms. A segment of code in a program being executed on a processor may be intercepted or trapped in runtime. A platform is selected in the hybrid system for executing said segment of code, the platform determined to run the segment of code with best efficiency among a plurality of platforms in the hybrid system. The segment of code is dynamically executed on the selected platform determined to run the segment of code with best efficiency.