International Business Machines Corporation

Brian Keith Martin

Gennaro A Cuomo

Daniel Christopher Shupp

Jason Robert McGee

Nitin Gaur

Christopher D Johnson

Michael L Fraenkel

Thomas R Gissel

Steven Dale Ims

Gabriel Garcia Montero

Aditya Abhay Desai

William Thomas Newport

Brad Byer Topol

Michael Joseph Spreitzer

Douglas Berg

Thomas Francis McElroy

John S Cox

Kulvir Singh Bhogal

Asser Nasreldin Tantawi

Malgorzata Steinder

Giovanni Pacifici

Donald Francis Ferguson

Madhu K Chetuparambil

Rajesh S Agarwalla

Subbarao K Meduri

Elizabeth Ann Black-Ziegelbein

Thomas Edward Musta

Erik Alan Daughtrey

Daniel John Moravec

Eric Jon Van Norman

Goran D Zlokapa

Erik John Burckart

Nataraj Nagaratnam

Curtis E Hrischuk

Anthony Joseph Nadalin

Nikolaos Anerousis

Graham Derek Wallis

Jian Tang

Dustin K Amrhein

David Ware

Martin J C Presler-Marshall

Nicholas Sauriol

Barton Clark Vashaw

Srinivas Hasti

Anthony Wayne Erwin

Michael J Smith

Chul Sung

Mukul Tuteja

Flannan Lok-Hang Lo

Marc E Haberkorn

Tsu-Phin Hee

Charles Plilip Fricano

Charles Philip Fricanco

Charles Philip Fricano

Neil George Stanley Young

Embodiments relate to a system, program product, and method for protecting cache access in a multi-tenant environment, and, more specifically, for allowing access to specified data, encrypted or unencrypted, in a shared cache to authorized tenants, while denying access to the data for unauthorized tenants. The system includes a server including one or more shared cache and a plurality of tenant devices coupled to the server. The server is configured to run one or more applications thereon, where each tenant has access to one or more authorized instances of the applications. The system also includes a cache proxy coupled to the tenant devices and the shared cache. The cache proxy facilitates enforcing one or more schemes to provide for separation of data for authorized tenants and their users using the shared cache from unauthorized tenants and users.

Protecting cache accesses in multi-tenant processing environments

A dynamic rebalancer operates in a server cluster independently of routers directing traffic to the servers in the cluster. An analysis component uses configuration information and statistics information to determine which session, if any, should be moved. A filter component receives transfer instructions from the analysis component. When the filter component receives transfer instructions from the analysis component, the filter component adds a redirect command to the client request. The filter component continually redirects client requests within the session to the new server until the client receives the redirect command and begins to send client requests to the new server.

Method and system for dynamically rebalancing client sessions within a cluster of servers connected to a network

Embodiments of the invention provide a method, system and computer program product for data duplication detection in an in memory data grid (IMDG). A method for data duplication detection in an IMDG includes computing a hash value for each binary data value in a key value pair of a partition in an IMDG. The method also includes generating a map including an entry for each unique computed hash value and one or more keys corresponding to binary data values of respective key value pairs from which the hash value had been uniquely computed. Thereafter, only those hash values in the map with multiple keys associated therewith are identified and binary data corresponding to the multiple keys of the identified hash values are reported as potential duplicate data in the IMDG.

Data duplication detection in an in memory data grid (IMDG)

Methods and systems of classifying suspicious users are described. A processor may determine whether a domain name, of an email address of a user that requested to access a network, is valid. The processor may classify the user as a suspicious user if the domain name is invalid. If the domain name is valid, the processor may determine a likelihood that the email address is a script-generated email address. The processor may classify the user as a suspicious user if the email address is likely to be a script-generated email address. If the email address is unlikely to be a script-generated email address, the processor may identify abnormal usage behavior exhibited by the user based on a reference model. The processor may classify the user as a suspicious user if abnormal usage behavior is identified, and may reject a subsequent request from the user to access the network.

Suspicious activity detection in computer networks

A code reuse user interface executed by a processor allows a code developer to specify unused data variables of a coded object definition to be reused, from pre-existing code within a new application, as a partial object without instantiation of the unused data variables. An indication from the code developer that at least one data variable of the reused coded object definition is specified as unused in the new application is detected within the code reuse user interface. The specified at least one unused data variable of the reused coded object definition is externalized from the code reuse user interface to a runtime environment, where as part of execution of the new application in the runtime environment, the runtime environment instantiates the reused coded object definition as the partial object without instantiation of the specified at least one unused data variable.

Sparse object instantiation

Embodiments of the present invention provide a method, system and computer program product for IMDG No-SQL schema optimization. In an embodiment of the invention, an IMDG No-SQL schema optimization method is provided. The method includes parsing documents of a No-SQL database, such as a document-oriented database, to select an object model mapping the documents of the No-SQL database to different portions of the IMDG, and selecting a partitioning schema for the IMDG according to the documents. Thereafter, a change in the documents of the No-SQL database can be detected, for example a change in data density of the documents of the No-SQL database, and in response to detecting the change, the documents of the No-SQL database are parsed to select a new object model of the No-SQL database mapping the documents to different portions of the IMDG, and to select a new partitioning schema for the IMDG according to the documents.

Optimization of an in memory data grid (IMDG) schema based upon a No-SQL document model

Embodiments of the present invention provide a method, system and computer program product for automated cluster member management based on node capabilities. In one embodiment of the invention, a method for automated cluster member management based on node capabilities can be provided. The method can include defining a membership policy for a cluster, the membership policy specifying a nodal configuration required for a node in a cluster. The method further can include evaluating different nodes in a computing environment against the membership policy for the cluster. Finally, the method can include associating cluster members in the cluster to only those of the nodes having respective configurations meeting the nodal configuration of the membership policy. Likewise, the method can include evaluating nodes already in the cluster, and disassociating cluster members in the cluster from those of the nodes having respective configurations failing to meet the nodal configuration of the membership policy.

Automated cluster member management based on node capabilities

A system and method of constructing cluster views may involve determining that a process such as an application server process having an IP address is stopped. Another IP address may be assigned to the process in response to determining that the process is stopped, wherein the other IP address is dedicated to processes that are stopped. If a connection request for the process is received at the other IP address, the connection request may be actively refused. The active refusal may significantly reduce the amount of time required to generate cluster views.

Cluster view performance

An apparatus, system, and storage medium that, in an embodiment, determine the classes that are needed during a first invocation of an application and preload those classes during a subsequent invocation of the application. In various embodiments, the classes may be preloaded if they are within a specified package, if they were needed greater than a threshold number of times, if the class path did not change between the first invocation and the subsequent invocation, or if the jar files the contain the classes are in a class path. In this way, an embodiment of the invention may increase the performance of class preloading.

Adaptive class loading

A method of routing messages to multiple consumers comprises determining a probability function defining message classification probabilities for each of a plurality of consumer sets, receiving a plurality of messages, classifying each message, storing each message in a queue, receiving notification of a consumer available to process a message, ascertaining the consumer set to which the available consumer belongs, accessing the probabilities for the ascertained consumer set, selecting a message classification according to the accessed probabilities, and transmitting a message, of the selected classification, to the available consumer.

Method of routing messages to multiple consumers

Prioritization of fragmented messages in an ORB is achieved by intercepting the flow of message data within the ORB, marking the current data stream location and issuing sufficient read commands to gather the message header and control area information. Then classification for priority can be performed using the data in the control area to classify the request. The classification information is stored for the message for later use by queuing and prioritization processes and the data stream marker is reset to the original location. When the queuing and prioritization processes are ready to dispatch the message, the message can be sent on to the higher levels of processing within the ORB where the higher levels of message processing code will process the message, totally unaware of the fact that the message has been classified and/or queued or prioritized prior to delivery to the higher level.

Method and program for classifying fragmented messages

Growing community of inventors

Cary, NC, United States of America

Brian Keith Martin