Abstract: The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.

Abstract: A method and system for processing Web service messages within an object oriented runtime environment is described. In one embodiment, the method includes steps for invoking a single instance of a state-less protocol for processing inbound and outbound flows of Web services messages. After determining Web services messages have been received out of order, processing of the outbound flow of any remaining messages is suspended until a complete set of messages is received. The messages are rearranged into proper order before completing processing of the outbound flows of the remaining messages.

Abstract: Provided are method, apparatus and computer program product for managing persistence in a messaging network. A determination of whether to save data relating to a message-based communication to persistent storage at a message server is made with reference to characteristics of at least one messaging client involved in the message-based communication. The characteristics may include, for example, connection reliability information for the client's previous connections to the message server, such as numbers of disconnections within a defined period or average connection duration, for a messaging client to which at least one message is to be transmitted by the message server. The characteristics may represent a number of matching subscribers per publication. These and/or other example characteristics may be captured in a database at the message server and may be evaluated (for example by SQL queries applied to the database) to determine whether a persistent save operation is required or can be omitted.

Abstract: An apparatus is provided with a change management module adapted to manage making changes to a data processing device of a data processing environment.

Abstract: The present invention discloses a queue manager that includes a smart alias function. The smart alias function can associate a queue name with two or more queues. The queues associated with the queue name for a given operation can be dependent upon programmatically determinable conditions. For example, the queue name (Queue A) can cause a message to be put in a Queue A1 when smart aliased. The same queue name (Queue A) can cause a message to be retrieved from Queue A2 when smart aliased. Additional processing can be performed against messages placed in Queue A1, and post processed messages can be placed in Queue A2. The queue manager can be a component that receives digitally encoded messages, that stores the received digitally encoded messages, and that provides the digitally encoded messages to authorized requesting software applications. The queue manager and the smart alias function can be software/firmware.

Abstract: A method for minimizing the message flow wait time for management user exits in a message broker application. A message broker application processes a request in a request and a response message flow. The request message flow generates a request identifier, collects information about the request message flow, and stores the request identifier and information in a global data map. The response message flow uses the request identifier to access the map and read the collected information without having to acquire a lock on the map. The response message flow also collects information about the response message flow, and generates management information about the request based on the information about the request message flow and the information about the response message flow. A dedicated clean up thread in the message broker application is used to remove used items from the global data map.

Abstract: A method, system and computer program product for operating a transaction manager. An invocation to begin a transaction as well as a message sequence number for the transaction are received. It is then determined if the message sequence number is greater than the last processed message sequence number. If the message sequence number is greater than the last processed message sequence number, then the transaction is started. Otherwise, if the message sequence number is not greater than the last processed message sequence number, then the transaction is failed.

Abstract: A screen program described with a non-object-oriented language is divided into a View performing a screen display and a Model that is an external processing logic of the screen display, and the View is associated with the Model by a binding setting. By associating plural Views with a Model, when the display has the same values in plural screens, the same processing result can be displayed on all screens only by processing the Model. The Model is associated with a schema describing a limitation of the input value from the screen, and a check of whether the input value from the screen is in the correct form or not is performed collectively.

Abstract: A method for dynamically arranging DSP tasks. The method comprises receiving an audio bit stream, checking a remaining execution time as the DSP transforms the audio information into spectral information, simplifying the step of transforming the audio information when the DSP detects that the remaining execution time is shorter then a predetermined interval, and skipping one section of the audio information and decoding the remaining section when the execution time is less than a predetermined interval.

Abstract: A method, system, and medium are provided for re-routing messages from a particular parallel queue instance that is experiencing below normal message throughput. The messages are re-routed to the other parallel queue instances by disabling the slow queue instance. A series of determinations are made, prior to disabling the queue instance, to confirm that disabling the queue instance is the preferred response to the decreased throughput for the queue instance.

Abstract: The order of messages in an asynchronous message system is preserved, by generating a message and tagging the generated message with a sequence identifier and a sequence number. The order of messages is further preserved by processing the tagged message by checking a log to determine whether the sequence identifier is in the log, sending the tagged message to a selected consumer if the sequence identifier is not in the log and sending the tagged message to a particular consumer if the sequence identifier is in the log. Still further, the order of messages is preserved by writing an entry to the log having the sequence identifier and the sequence number of the tagged message and a consumer identifier of the selected consumer if the sequence identifier of the tagged message is not in the log.

Abstract: Methods, apparatuses, and systems directed to facilitating secure, structured interactions between code modules executing within the context of a document processed by a user agent, such as a browser client, that implements a domain security model. In a particular implementation, a module connector script or object loaded into a base document discovers listener modules and sender modules corresponding to different origins or domains, and passes information between them. In this manner, a listener module may consume and use information from a sender module located on the same page simply by having an end-user add both modules to a web page without having to explicitly define any form of interconnection. For example, a photo module may access a user account at a remote photo sharing site, and provide one or more photos to a module that renders the photographs in a slide show.

Abstract: Methods, apparatuses, and systems directed to facilitating secure, structured interactions between code modules executing within the context of a document processed by a user agent, such as a browser client, that implements a domain security model. In a particular implementation, a module connector script or object loaded into a base document discovers listener modules and sender modules corresponding to different origins or domains, and passes information between them. In this manner, a listener module may consume and use information from a sender module located on the same page simply by having an end-user add both modules to a web page without having to explicitly define any form of interconnection. For example, a photo module may access a user account at a remote photo sharing site, and provide one or more photos to a module that renders the photographs in a slide show.

Abstract: Allocating space for storing heterogeneous messages in a message queue according to message classification. The classification may comprise message type, application type, network type, and so forth. Messages of multiple classification values may be queued in a single queue, referred to as a primary queue. When the allocated portion of the primary queue is reached for a particular message classification, then subsequent messages having that classification are sent to a secondary queue for queuing. The secondary queue also allocates space according to message classification. When space for a particular message classification becomes available in the primary queue, one or more messages having that classification may be moved from the secondary queue to the primary queue.

Abstract: Described is a notifications platform that routes notifications to endpoints of recipients, corresponding to email, instant messaging, text messaging, telephones, social networks, blogs and/or the like. A publisher of a notification designates the recipients, while preference data of each recipient determines whether that publisher is able to send to that recipient, and if so, to which endpoints. The notification may be modified via one or more templates to be appropriate for a locale of the recipient, as well as appropriately formatted for the endpoint, which may also be locale-specific.

Abstract: An invention for creating, sending, and using self-descriptive objects as messages over a network is disclosed. In an embodiment of the present invention, self-descriptive persistent dictionary objects are serialized and sent as messages across a message queuing network. The receiving messaging system unserializes the message object, and passes the object to the destination application. The application then queries or enumerates message elements from the instantiated persistent dictionary, and performs the programmed response. Using these self-descriptive objects as messages, the sending and receiving applications no longer rely on an a priori convention or a special-coding serialization scheme. Rather, messaging applications can communicate arbitrary objects in a standard way with no prior agreement as to the nature and semantics of message contents.

Abstract: A lockless processor core communication capability is provided herein. The lockless communication capability enables lockless communication between cores of a multi-core processor. Lockless communication between a first core and a second core of a multi-core processor is provided using a message queuing mechanism. The message queuing mechanism includes a message queue, a first bitmap, and a second bitmap. The message queue includes a plurality of messages configured for storing data queued by the first core for processing by the second core. The first bitmap includes a plurality of bit positions associated with respective messages of the message queue, and is configured for use by the first core to indicate availability of respective queued message data.

Abstract: A method for automated scripting includes providing a first menu corresponding to a first object, wherein the first object is a message queue (MQ) object. A first parameter for the first object is received. A second parameter is also received, wherein the second parameter is entered by a user in the first menu. The method further includes creating the first object based on the first parameter and the second parameter.

Abstract: A data management system or “DMS” provides a wide range of data services to data sources associated with a set of application host servers. The data management system typically comprises one or more regions, with each region having one or more clusters. A given cluster has one or more nodes that share storage. To facilitate the data service, a host driver embedded in an application server connects an application and its data to a cluster. The host driver provides a method and apparatus for capturing real-time data modifications and application state notifications and, in response, generating data transactions in the form of an event journal that is provided to the data management system. The driver functions to translate traditional file/database/block I/O into a continuous, application-aware, output data stream.

Abstract: Architecture that includes an asynchronous library which remembers the synchronization context that initiated an asynchronous method call and when the request is completed, the library restores the synchronization context of the calling thread before executing a callback. This ensures that the callback executes on the same thread as the original asynchronous request. The callback to the asynchronous operation that asynchronous library provides automatically “jumps threads” to maintain thread affinity.

Abstract: A communication method for collective operations is provided which eliminates the need for a three layered structure. Instead, the method of the present invention employs a control structure which is specifically designed to keep track of the progress of the collective communication operations and the facilities for the handling of asynchronous message passing. The method of the present invention thus eliminates the need for an intermediary, point-to-point communication layer that is required to follow message matching semantics for sending messages, receiving messages and for awaiting message arrivals. Application layer tasks and user defined programs running in the communication layer share access to the control structure as a mechanism for synchronizing and scheduling the progress of the collective communication operation.

Abstract: An event queue managing module that prevents unnecessary events from continuously executing applications when an application execution environment resumes from a suspended state, and including: a queue managing unit for storing event objects reported from an event detector of a basic software unit into an event queue in order of occurrence of events and managing their queue; an event classification detection unit for detecting the event classification and parameter of the event objects whose queue is managed by the queue managing unit; a stop state detection unit for detecting a stop state of an application execution environment; and an event deletion unit for deleting an unnecessary event from the event objects stored in the event queue when the application execution environment is in the stop state.

Abstract: In an embodiment, a reception thread receives a source node identifier, a type, and a data pointer from an application and, in response, creates a receive request. If the source node identifier specifies a source node, the reception thread adds the receive request to a fast-post queue. If a message received from a network does not match a receive request on a posted queue, a polling thread adds a receive request that represents the message to an unexpected queue. If the fast-post queue contains the receive request, the polling thread removes the receive request from the fast-post queue. If the receive request that was removed from the fast-post queue does not match the receive request on the unexpected queue, the polling thread adds the receive request that was removed from the fast-post queue to the posted queue. The reception thread and the polling thread execute asynchronously from each other.

Abstract: A system and method for distributing processing utilizing message queues as a method of distributing binary objects as “messages” and invoking the embedded logic of the received message to perform a portion of a distributed application is disclosed. More particularly, but not by way of limitation, a system and method for the integrated distribution and execution of objects as they are retrieved or extracted from a message queue on a remote system to provide executable functionality portions of a distributed application. In one embodiment a failed processing step results in the message being retained in the message queue to allow for subsequent retry processing.

Abstract: An improved industrial automation system and communication system for implementation therein, and related methods of operation, are described herein. In at least some embodiments, the improved communication system allows communication in the form of messages between modules in different control or enterprise domains. Further, in at least some embodiments, such communications are achieved by providing a communication system including a manufacturing service bus having two internal service busses with a bridge between the internal busses. Also, in at least some embodiments, a methodology of synchronous messaging is employed.

Abstract: An improved industrial automation system and communication system for implementation therein, and related methods of operation, are described herein. In at least some embodiments, the improved communication system allows communication in the form of messages between modules in different control or enterprise domains. Further, in at least some embodiments, such communications are achieved by providing a communication system including a manufacturing service bus having two internal service busses with a bridge between the internal busses. Also, in at least some embodiments, a methodology of synchronous messaging is employed.

Abstract: A method for passing messages in a parallel computer system constructed as a plurality of compute nodes interconnected as a network where each compute node includes a DMA engine but includes only a limited number of byte counters for tracking a number of bytes that are sent or received by the DMA engine, where the byte counters may be used in shared counter or exclusive counter modes of operation. The method includes using rendezvous protocol, a source compute node deterministically sending a request to send (RTS) message with a single RTS descriptor using an exclusive injection counter to track both the RTS message and message data to be sent in association with the RTS message, to a destination compute node such that the RTS descriptor indicates to the destination compute node that the message data will be adaptively routed to the destination node.

Abstract: Various embodiments of the present invention are directed to systems and methods for enabling software applications running on separate devices to exchange data via multiple data communication methods. In various embodiments, a data communication system is provided comprising multiple data communication devices running one or more software applications and communication manager middleware. In various embodiments, the data communication system permits the software applications to exchange data without knowledge of the actual method and/or protocol used to exchange a given set of data, and intelligently manage the exchange of data between software applications by, among other things, transmitting sets of data using a preferred communication method selected based on one or more message attributes or communication method attributes.

Abstract: An operating system is provided wherein a plurality of objects are established and registered in response to requests from hardware or software associated with the computer system. The objects include at least one type, at least one attribute, and a handle. The plurality of objects are then manipulated to effect processing and exchange of information.

Abstract: A system and computer program product that off-loads the processing associated with responding to user status requests for software task execution queues or for queued software tasks that are managed by a software task manager. A software task manager is periodically queried for status and the results of that periodic query are stored in a file. User queries for the status of the software task manager are handled by a separate process on a separate computing node. Queries submitted by users for the status of queues or queued software tasks managed by the software task manager are satisfied by retrieving the status data that are stored in the file. Alternative embodiments distribute copies of the file to several computing nodes to further alleviate the processing bottleneck caused by responding to frequent task manager status queries from many users.

Abstract: Various embodiments include a method and system for queuing messages for transmission to/from a vehicle. One or more messages from one or more applications for performing one or more vehicle-related events may be received. The one or more messages may include a message identifier for each of the one or more vehicle applications to correlate the one or more messages with the one or more applications. The messages may be queued for transmission. A vehicle's connectivity to a wireless network is determined and, if the vehicle is connected to the wireless network, the one or more queued messages are transmitted. The one or more vehicle-related events based on the one or more messages are performed.

Abstract: A system for supporting the diversity of a ubiquitous computing environment according to the present invention has a message bus including a message broker managing an intermediary role of delivering an actual message between the subsystems and a messaging adaptor managing an interface function between the message broker and the subsystems, wherein the messaging adaptor is installed in the subsystems and includes a first adaptor including a first application port for interfacing with the subsystems, and a second adaptor including a second application port for interfacing with the first adaptor and the broker port operating with the message broker.

Abstract: A centralized polling system is set forth for providing constant time select call functionality to a plurality of polling tasks in an operating system kernel. In one aspect, the CPS registers for and thereby captures events of interest on a continual basis. Polling tasks are supplied with active events thereby eliminating the need to repetitively poll large numbers of inactive sockets. An exemplary embodiment of the CPS includes a system interface to the operating system kernel, a data structure for maintaining a profile for each of the polling tasks, and an application programming interface for registering the polling tasks, receiving the active sockets and corresponding read/write event types via the system interface, updating the profile within the data structure for each of the polling tasks, and returning the current read and write ready sockets to respective ones of the polling tasks.

Abstract: Provided are a method, apparatus and a computer program for managing message queues. Message streaming is enabled in a transactional messaging system that supports priority ordering of messages, without the need for complex locking mechanisms. Any messages which are transferred from a message queue to a message consumer after the message consumer initiates commit processing are replaced on the message queue at an appropriate position ahead of other messages. As part of commit processing, the consumer sends back to the manager of the message queue an identification of messages delivered to it before the commit, and this list of messages is extracted and compared with a message log to identify undelivered messages. Successfully delivered and committed messages can be committed by the queue manager, and undelivered messages can be replaced on the queue. A special high priority is assigned to the replaced messages to place them ahead of other messages.

Abstract: A method and apparatus for processing message is described. In one embodiment, an application programming interface is configured for receiving and sending messages. A building block layer is coupled to the application programming interface. A channel layer is coupled to the building block layer. A transport protocol stack is coupled to the channel layer for implementing properties specified by the channel layer. The transport protocol stack has a concurrent stack consisting of an out of band thread pool and a regular thread pool. The transport protocol layer is to process messages from each sender in parallel with the corresponding channel for each sender.

Abstract: In an embodiment, a method is provided. In an embodiment, the method provides determining that a message has been placed in a send buffer; and transferring the message to an application on a second virtual machine by bypassing use of an operating system to process the message by directly placing the message in an application memory space from which the application can retrieve the message.

Abstract: A method is provided for use in a system that includes a host machine that includes multiple physical CPUs (PCPUs) and at least two cache nodes that are shared by different sets of the PCPUs, comprising: creating in a memory device multiple sets of lanes each lane set associated with a respective PCPU set; tracking levels of processing activity of the PCPUs of each PCPU set; using an MSIX vector value to associate lanes with PCPUs; receiving a IO request from any given PCPU from among the multiple PCPUs; and assigning the IO request to a respective lane based at least in part upon the PCPU set associated with the lane and PCPU processing activity levels.

Abstract: Techniques are described for managing execution of programs, including using excess program execution capacity of one or more computing systems. For example, a private pool of excess computing capacity may be maintained for a user based on unused dedicated program execution capacity allocated for that user, with the private pool of excess capacity being available for priority use by that user. Such private excess capacity pools may further in some embodiments be provided in addition to a general, non-private excess computing capacity pool that is available for use by multiple users, optionally including users who are associated with the private excess capacity pools. In some such situations, excess computing capacity may be made available to execute programs on a temporary basis, such that the programs executing using the excess capacity may be terminated at any time if other preferred use for the excess capacity arises.

Abstract: Methods, systems, and products are provided for monitoring messages in a distributed data processing system. Embodiments typically include putting a message containing a monitoring token on a queue on a server; receiving a call to get the message from the queue on the server; determining, with an API exit running on the server, whether the call to get the message is made by a process running on a remote client or by a process running on the server; and if the call to get the message is made by a process running on the server, removing the monitoring token from the message with the API exit. Many embodiments also include removing the monitoring token from the message with a channel exit running on the remote client, if the call to get the message is made by a process on the remote client.

Abstract: The present invention relates to a method for message delivery from a sender process to a receiver process within a computer system, comprising performing an atomic check for the receiver process and a parent of the receiver process, returning a first status of the receiver process and a second status of the parent of the receiver process based on the atomic check, and delivering the message according to the first status and the second status, wherein the first status and the second status stay unchanged during the atomic check.

Abstract: A system for coordinating information between management entities includes a CIMOM registry broker storing registration information for CIMOMs in the system. The CIMOM registry broker is operable to extract objects from at least some of the CIMOMs in response to a request from an entity external to the system. The CIMOM registry broker is also operable to correlate information in the extracted objects into a single response table, and send the single response table to the entity external to the system. The system also includes a plurality of agents, wherein each agent is associated with one of the CIMOMs and is operable to communicate information from the CIMOMs to the CIMOM registry broker. The system also includes at least one management channel providing bidirectional communication between the CIMOM registry broker and the agents in the system.

Abstract: A cloud computing monitoring system has an alert capturing system and a message transfer system that provides performance tracking and alert management to a local monitoring system. The alert capturing system may operate as part of a managed code framework and may capture and route alerts that may be transmitted to an operating system, as well as application exceptions and debugging information. A message queuing system may transmit the alerts to a local monitoring system, which may have a connector that subscribes to the cloud system's message queuing system.

Abstract: A method for passing data from a first processing thread to a second processing thread, wherein the first processing thread produces data to be processed by the second processing thread. The data from the first processing thread may be inserted into objects that in turn are inserted into a queue ob objects to be processed by the second thread. The queue may be a circular array, wherein the array includes a pointer to a head and a pointer to a tail, wherein only the first processing thread modifies the tail pointer and only the second processing thread modifies the head pointer.

Abstract: A method and apparatus for modifying an events queue for extending an extended mark-up language (XML) processor's feature set are described. In one embodiment, the method includes the parsing of an XML document to generate an initial event queue. During parsing of the XML document, an event associated with a parser plug-in module may be detected. When an event associated with a parser plug-in module is detected, control is passed to the plug-in module to perform event-based functionality to modify the initial event queue to form a modified event queue. Subsequently, any additional event information contained within the modified event queue, as generated by the parser plug-in module, is reported to, for example, an end user application. Other embodiments are described and claimed.

Abstract: An embodiment of the present invention provides a network interface card (NIC), comprising an intelligent wake mechanism and a device driver associated with the intelligent wake mechanism and configured to agree with embedded software on a set of wake codes and wake behaviors associated with the wake codes such that when the NIC encounters a wake event, the NIC first adds the wake code to a command queue, then it drives a PME pin to high to wake a device connected to the NIC.

Abstract: A method and system for event polling have been disclosed. According to one embodiment, a computer-implemented method comprises receiving a session request from a client device. A session key is provided to the client device in response to the session request. A session timer is set for a predetermined time period. An event revision number is received from the server device. The client is provided with an updated event revision number if the event revision number matches an expected revision number. An event from an instant messaging server is placed in a queue until the event revision number matches the expected revision number, the event including one or more of instant messages, buddy events, typing, and application events.

Abstract: Embodiments of the invention provide a method, system and computer program product for message merging in a messaging queue. In an embodiment of the invention, a method for message merging in a messaging queue can be provided. The method can include receiving a request to add a new message to a message queue in a message queue manager executing in memory by a processor of a host computing platform. The method can also include a merge indicator to stipulate whether or not a merge should take place. The method also can include identifying an association key associating the new message with an existing message in the message queue and locating an associated message in the message queue corresponding to the identified association key. Finally, the method can include merging the new message with the located associated message in the message queue.

Abstract: An example embodiment provides a process relating to an inference engine for enterprise systems and enterprise contracts. In the example, the inference engine receives a fact and stores it in an input queue. Then the inference engine retrieves the fact from the input queue and routes the fact to a schedule queue on the basis of the fact's processing schedule and a condition that is part of a rule. The inference engine retrieves the fact from the schedule queue in accordance with the processing schedule and routes the fact to a rule executer on the basis of the fact's contents. The rule executer applies an action to the fact, where the action is also part of the rule and the action transforms the fact or creates new facts. Then the inference engine routes the transformed fact or new facts to the input queue and possibly to a persistent storage device.

Abstract: Data interchanges are processed so that problematic individual elements within the data interchanges do not cause the processing of the data interchanges to be suspended unless there is a catastrophic error. The data interchanges are split up by flat file and/or XML disassemblers of a message engine into independent messages even if some elements are incorrect or cause processing failures. Those messages in the interchange that may be processed are processed, while those that would cause processing errors are suspended in a suspend queue for recovery processing. Even when a message is placed in the suspend queue, processing continues with the next independent message in the data interchange. Messages that are placed in the suspend queue for lack of routing information may be resumed by providing the routing information and again attempting to route the previously suspended message.

Abstract: A method for queuing data for an application server is described. The method includes creating a queue entry record corresponding to the data, storing a queue entry including the data and the corresponding queue entry record in a queue, and receiving a command regarding the data from the application server.