Abstract: A system and method can verify trustfulness of a fabric component in an InfiniBand (IB) fabric. A subnet manager that is responsible for authenticating the fabric component using private/public key pairs. The subnet manager can first send a first encrypted message to a fabric component in the IB fabric, wherein the first encrypted message contains a token and is encrypted using a public key associated with the fabric component. Then, the fabric component is allowed to decode the first encrypted message using a private key associated with the fabric component, and to send a second encrypted message back to the subnet manager. Finally, the subnet manager can authenticate the fabric component if the second encrypted message contains correct information.

Abstract: Methods, systems, and computer readable media for predicting imminent Diameter overload conditions using load information are disclosed. One embodiment of a system for implementing the subject matter described herein includes a first Diameter node including at least one network interface for receiving Diameter messages and a Diameter overload prediction unit. The Diameter overload prediction unit may be configured to extract load information from the Diameter messages, detect a traffic pattern using the extracted load information, predict at least one overload condition associated with one or more other Diameter nodes, and communicate an indication of the predicted overload condition to at least some of the other Diameter nodes before a time at which the overload condition is predicted to occur.

Abstract: Systems for prosecuting Internet messaging campaigns. Two or more data sources are determined where at least one of the data sources comprise demographic attributes corresponding to shared IDs such as recipient IDs. A first join operation is performed over matching instances of the shared IDs in the two or more data sources. The first join operation results in a personalization table comprising rows having at least recipient IDs, respective external addresses, and at least one of the demographic attributes. The personalization table is transformed into a key-value data structure that is published to a caching subsystem. The caching subsystem is used to select a first set of recipients determined without performing a second join operation. Personalized messages to at least some of the first and second set of recipients are formed using the message template and the key-value data structures.

Abstract: Various arrangements for debugging logic being executed by a webserver is presented. A virtual machine of the webserver may execute runtime threads for a plurality of remote users. The web server may compile business logic code received from a developer computer system via a web-based interface into an logic insight injected code. The logic insight injected code may be compiled from the business logic code to include debugging functionality. The virtual machine of the webserver may execute the logic insight injected code concurrently with the runtime threads being executed for the plurality of remote users. The debugging functionality of the logic insight injected code being executed may not affect execution of the runtime threads for the plurality of users.

Abstract: Embodiments of the invention provide systems and methods for scheduling and executing user-restricted processes within distributed computing systems. More specifically, certain embodiments of the present invention describe systems and methods by which runtime requests to execute user-restricted processes may be received, processed, and scheduled via a user application of an enterprise system or other distributed computing system. Requests may be received via transaction pages of user applications to schedule and execute user-restricted processes. The user application, a process scheduler, and/or other components within the distributed computing system may determine user contexts associated with the requests, and may determine whether or not the requested processes may be scheduled and executed. Such processes may include, for example, report generation processes, processes to initiate system functions, and/or processes to perform system maintenance within the distributed computing environment.

Abstract: Various techniques are described herein for creating data partition process schedules and executing such partition schedules using multiple parallel process instances. Data processing tasks initiated by or for applications may be executed by creating and executing partition schedules, in which a number of different process instances are created and each assigned a subset of data to process. Partition schedules may be used to determine a number of process instances to be created, and each process instance may be assigned a unique set of run-time data values corresponding to a unique set of parameters within the data set to be processed by the application. The process instances may operate independently and in parallel to retrieve and process separate partitions of the data required for the overall data processing task initiated by/for the application.

Abstract: Embodiments of the invention provide systems and methods for an eService ecosystem that provides a common trouble ticket platform for creating and handling trouble tickets generated by and received from an “Internet of Things (IoT).” More specifically, many product vendors are moving to make all of their products internet connected. This move includes not only products that are typically considered to be technology-type products such as personal computers, cellphones, media players, etc., but any and all types of products including but not limited to household appliances, automobiles, medical devices, and a variety of other devices which are increasingly available with processing and communications abilities. Embodiments of the present invention provide a common trouble ticket management platform that all Internet of Things vendors can use.

Abstract: Systems and methods are provided for high-performance data processing. A policy is received that indicates a cutoff time. A request is processed to return the data item from the cache if the cutoff time is satisfied for the data item or return the data item from the database or not at all if the cutoff time is not satisfied for the data item. If the data item retrieved from the database, metadata associated with the data item is stored to indicate when the data item was last marked as in sync with the database.

Abstract: A method and apparatus for proactively communicating information between processes through a message repository is provided. To communicate with other processes, a process may post a message to a message repository. Other processes may, at regular or irregular intervals, search the message repository for new messages that have been posted to the repository since the last search, and retrieve those new messages. Processes may post and retrieve messages relative to the message repository by invoking methods provided by an application programming interface (API). By posting a message to the message repository, a particular process can inform other interested processes proactively of actions that the particular process has taken, is taking, or will take. By retrieving messages from the message repository, a process can determine what actions other processes have taken, are taking, or will take, and adjust accordingly.

Abstract: According to one aspect of the invention, for a database statement that specifies rollup operations, a data distribution key may be selected among a plurality of candidate keys. Numbers of distinct values of the candidate keys may be monitored with respect to a particular set of rows. Hash values may also be generated by column values in the candidate keys. The data distribution key may be determined based on results of monitoring the numbers of distinct values of the candidate keys as well as the frequencies of hash values computed based on column values of the candidate keys. Rollup operations may be shared between different stages of parallel executing processes and data may be distributed between the different stages of parallel executing processes based on the selected data distribution key.

Abstract: The disclosed embodiments provide a system that uses broadcast-based TLB sharing to reduce address-translation latency in a shared-memory multiprocessor system with two or more nodes that are connected by an optical interconnect. During operation, a first node receives a memory operation that includes a virtual address. Upon determining that one or more TLB levels of the first node will miss for the virtual address, the first node uses the optical interconnect to broadcast a TLB request to one or more additional nodes of the shared-memory multiprocessor in parallel with scheduling a speculative page-table walk for the virtual address. If the first node receives a TLB entry from another node of the shared-memory multiprocessor via the optical interconnect in response to the TLB request, the first node cancels the speculative page-table walk. Otherwise, if no response is received, the first node instead waits for the completion of the page-table walk.

Abstract: A method for optimizing code includes receiving, by a compiler and from an interpreter, a code section representation including an object allocation, compiling, by the compiler, the code section representation into machine code with a compact allocated object of the object allocation, and triggering a deoptimization returning execution to the interpreter in response to an attempted access of the compact allocated object. The method further includes setting, by the interpreter and within the code section representation, a flag indicating that a new compact allocated object is required at a location of the attempted access, receiving, by the compiler, the code section representation including the flag, compiling, by the compiler and according to the flag, the code section representation into new machine code including the new compact allocated object, and executing the new machine code with the new compact allocated object.

Abstract: A framework, which conforms to the OAuth standard, involves a generic OAuth authorization server that can be used by multiple resource servers in order to ensure that access to resources stored on those resource servers is limited to access to which the resource owner consents. Each resource server registers, with the OAuth authorization server, metadata for that resource server, indicating scopes that are recognized by the resource server. The OAuth authorization server refers to this metadata when requesting consent from a resource owner on behalf of a client application, so that the consent will be of an appropriate scope. The OAuth authorization server refers to this metadata when constructing an access token to provide to the client application for use in accessing the resources on the resource server. The OAuth authorization server uses this metadata to map issued access tokens to the scopes to which those access tokens grant access.

Abstract: A Diameter based network that includes nodes and accommodates Diameter communication sessions between nodes establishes a first Diameter communication session between a first node and a second node, and at some point determines that the first Diameter communication session is lost. The first node generates a query using a second Diameter communication session that is a different session than the first Diameter communication session. The first node transmits the query to the second node, where the query includes a session type and key identifiers for the first Diameter communication session. The second node re-establishes the first Diameter communication session with the first node and transmits, in response to the query, an indication that the first Diameter communication session exists.

Abstract: Systems and methods for peer-based code quality analysis reporting are provided. In accordance with an embodiment, a system can include a peer-based code quality analysis tool, executing on a computer, which is configured to receive one or more source code files, and perform an analysis of the one or more source code files based on a plurality of rules. The peer-based code quality analysis tool can further compare results of the analysis to peer results data to determine a percentile based score, and create an interactive report which includes the results of the analysis and the percentile based score.

Abstract: Described herein are systems and methods for providing context-sensitive data security, for business application performance optimization. In accordance with an embodiment, the system can be used together with a Role Based Access Control model. Data security predicates can be made context-sensitive, by taking into account the context in which an end-user is navigating an application. By providing context-sensitive data security in this manner, the complexity of database queries can be reduced, and the underlying relational database management system can create better-optimized execution plans.

Abstract: Systems, methods, and other embodiments associated with an integrated circuit that includes a plurality of parallel pillar structures is described. In one embodiment, a system includes a design logic configured to analyze a design of an integrated circuit to identify open tracks on each layer by determining a location of structures in each layer of the design. The open tracks are spaces on each layer of the design that are free from structures that obstruct routing the plurality of pillar metals. The system also includes routing logic configured to successively route the plurality of pillar metals in each of the layers of the design based, at least in part, on the parameters and the location of the structures. The routing logic routes pillars of the plurality of pillar metals that are in adjacent layers to be perpendicular and pillar metals that are within a same layer of the design to be parallel.

Abstract: Technology is disclosed for using workflows based on domains in a hierarchical data structure (e.g. LDAP directory) or other type of data structure. When a workflow is created, it is associated with domain. The domain is defined by a selected node and all nodes below that selected node in the hierarchical data structure. At run time, the system identifies which workflows perform a requested task and are associated with a domain that includes the target of the task. If multiple workflows are determined, the user is provided with the ability to choose one of the identified workflows for performing the tasks.

Abstract: A system and method for providing a software modeling framework which supports different types of dependency injection and other software modeling or software development frameworks, and which allows software developers to develop models that strategically layer different components for different implementations. A service provider interface (SPI) enables different DI frameworks to be incorporated into the system; while an application provider interface (API) enable machines or implementations to be constructed. Extenders can be modeled so that, for example a particular bundle requires a handler for a particular configuration manifest entry; while a particular module provides handling of that manifest entry.

Abstract: A web service interface may receive a web service request that describes multiple objects. Each of the multiple objects may be associated with a common object, such as in a parent-child relationship. The web service can identify the common object and the multiple relationships between objects, and instead of creating duplicate versions of the common object, the web service can create a single record representing the common object in, for example, a database. Records for each of the multiple objects referring to the common object can reference the common object record in the database using, for example, foreign keys.