Abstract: The disclosed techniques for event notification enable applications that rely on event notifications to be ported transparently to clustered computing systems. The disclosed techniques for event notification exploit the characteristics of a clustered computing system and the characteristics of event notification in order to provide efficient event notification in clustered computing environments.

Abstract: A method for job delegation including receiving a job from a user by a first management object, identifying a target system for the job using a data model in the first management object and a job delegation policy, where the data model comprises an object representing the target system, and determining a first nexthop for the target system, where the first nexthop is a second management object. The method also includes placing the job on a queue corresponding to the second management object, where the queue is located in the first management object, receiving the job by the second management object, locating the target system and a driver corresponding to the target system using the second management object, and executing the job using the driver corresponding to the target system.

Abstract: A queue management system may store a queue of messages in a main queue. When a message is processed by an application, the message may be moved to a subqueue. In the subqueue, the message may be locked from other applications. After processing the message, the application may delete the message from the subqueue and complete the action required. If the application fails to respond in a timely manner, the message may be moved from the subqueue to the main queue and released for another application to service the message. If the application responds after the time out period, a fault may occur when the application attempts to delete the message from the subqueue. Such an arrangement allows a “peek and lock” functionality to be implemented using a subqueue.

Abstract: A method for preferential reply routing, the method includes: receiving a request-reply message from a requesting application; detecting there is a preferred partition of a reply queue managed locally to an application server to which the requesting application is connected; qualifying a name of a reply queue stored in the request-reply message so that the name refers to the local partition that is managed locally to the application server; determining whether the local partition is available; wherein in the event the local partition is available: storing a reply message in the local partition; and retrieving the reply message from the local partition in response to the requesting application.

Abstract: A message identifier of a first event is provided to a correlation engine. The correlation engine is to correlate the first event to one or more second events according to a predetermined correlation technique. The message identifiers of the second events are received from the correlation engine. A correlated message identified for the first event is generated based on the message identifier of the first event and on the message identifiers of the second events. The correlated message identifier for the first event is output.

Abstract: A method of emulating a service in a computer infrastructure includes the steps of providing a service proxy instance as a stand-in for the service and running the service proxy instance on a computer accessible to the computer infrastructure. The service proxy instance is configured at run time in accordance with a configuration file, wherein the configuration file includes an operating mode specification. The service proxy instance communicates with at least one destination in adherence to the operating mode specification and a communication protocol.

Abstract: Data processing on a network on chip (‘NOC’) that includes IP blocks, routers, memory communications controllers, and network interface controllers; each IP block adapted to a router through a memory communications controller and a network interface controller; each memory communications controller controlling communication between an IP block and memory; each network interface controller controlling inter-IP block communications through routers; each IP block adapted to the network by a low latency, high bandwidth application messaging interconnect comprising an inbox and an outbox; a computer software application segmented into stages, each stage comprising a flexibly configurable module of computer program instructions identified by a stage ID with each stage executing on a thread of execution on an IP block; and at least one of the IP blocks comprising an input/output (‘I/O’) accelerator that administers at least some data communications traffic to and from the at least one IP block.

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 method and apparatus is provided for providing and integrating high-performance message queues. “Contexts” are provided that allow independent worlds to be created and execute in parallel. A context is created with one or more threads. Each object is created with context affinity, allowing any thread inside the context to modify the object or process pending messages. Threads in a different context are unable to modify the object or process pending messages for that context. To help achieve scalability and context affinity, both global and thread-local data is often moved into the context. Remaining global data has independent locks, providing synchronized access for multiple contexts. Each context has multiple message queues to create a priority queue. There are default queues for sent messages and posted messages, carry-overs from legacy window managers, with the ability to add new queues on demand. A queue bridge is also provided for actually processing the messages.

Abstract: The present invention extends to methods, systems, and computer program products for using subqueues to enhance local message processing. Messages include queue IDs comprised of a parent portion and a suffix portion. The parent portion identifies a parent queue and the suffix portion identifies a subqueue of the parent queue. Message are logically moved between queues by changing suffix values, such as, for example, between subqueues, between the parent queue and a subqueue, and between a subqueue and the parent queue. Applications can examine messages and route messages to specified subqueues based on message content (including message bodies and headers). Suffix values can be changed in place (e.g., while the message remains physically stored in the queue) so as to preserve message sender identity and to avoid prematurely acknowledging delivery (i.e., no return ACK is generated).

Abstract: Dispatching an incoming message from a queue into message transfer session(s) from which message consumers may draw messages. The message is reversibly received from the queue, whereupon a context of a message is identified. If the context correlates to an existing message transfer session, the message is ultimately assigned to a message transfer session. If the context does not correlate to an existing message transfer session, a new message transfer session is created, and the message is assigned to that new message transfer session. Upon receiving an acknowledgement of successful processing of the message, the removal of the message from the queue-like communication medium is assured. Upon receiving an acknowledgement of unsuccessful processing of the message, the message is restored to the queue-like communication medium.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for retrieving events from an event port. A request to retrieve a specified number of events from an event port to which completed events are posted by one or more event sources is received from a computer software application. It is determined whether the specified number of events is available at the event port. If the specified number of events is available at the event port, the specified number of events is retrieved from the event port and the retrieved events are returned to the requesting computer software application. If fewer events than the specified number of events are available at the event port, the request is placed in a request queue with requests to be processed at a later time and the request queue is ordered based on priorities of the requests in the request queue.

Abstract: A method for improving the performance of a distributed object model over a network is disclosed. A client computer contains a client object which can call an interface on a server object located on a server computer. On the server side, the RPC dispatching layer is circumvented by providing a pointer into the DCOM dispatching layer directly from the RPC utility layer. The client can therefore specify an interface using only an interface pointer identifier, and need not also specify a RPC interface identifier. The DCOM dispatching can then call the appropriate stub for the interface specified by the client with the interface pointer identifier, while taking advantage of the RPC utility layer to perform security checking, thread management, socket management, and association management.

Abstract: A service exception resolution framework provides a centralized exception handling console (EHC) used to reprocess unfulfilled service requests that have result in service request exceptions. The EHC allows an operator to analyze multiple service request exceptions simultaneously from disparate applications and domains. The framework greatly reduces the time, cost, and resource expenditures needed to analyze and resolve service request exceptions and reprocess service requests regardless of the applications and domains from which the service request exceptions result.

Abstract: When a message is transmitted from a storing application of a process requesting server, a message queuing server stores the message in a queue. When storing the message in the queue, the message queuing server transmits information regarding this message to an extracting application of a process performing server, thereby controlling a linkage operation between the storing application of the process requesting server and the extracting application of the process performing server.

Abstract: Data processing on a network on chip (‘NOC’) that includes integrated processor (‘IP’) blocks, routers, memory communications controllers, network interface controllers, and network-addressed message controllers, with each IP block adapted to a router through a memory communications controller, a network-addressed message controller, and a network interface controller, where each memory communications controller controlling communications between an IP block and memory, each network interface controller controlling inter-IP block communications through routers, with each IP block also adapted to the network by a low latency, high bandwidth application messaging interconnect comprising an inbox and an outbox.

Abstract: A system and method is disclosed for establishing an interactive multimedia application environment in which server-side streaming media may be controlled by a client using a programming model provided at both a communication server and an interactive multimedia runtime on the client. The application program interface (API) preferably provides methods for the client user to establish a stream of data from the client to the communication server in addition to allowing a stream from the communication server to the client. The API also preferably allows the user at a client to exert control over the broadcasting of the media streams. Streams may be built, edited, paused, stopped, augmented, and the like by the client user. Each function that the client user may operate on the broadcast media stream is preferably viewable by all of the other subscribing clients.

Abstract: Disclosed herein is a method of accessing an Enterprise Java Bean (EJB) by a non-Java application within a computing environment, comprising: calling a client library by the non-Java application; invoking a function within the client library to construct an HTTP request corresponding to the calling input parameters from the non-Java application; passing the HTTP request from the client library to an EjbServlet; invoking a method on an EJB by the EjbServlet based upon the HTTP request; returning information from the invoked method from the EJB to the EjbServlet; decoding the returned information into an HTTP response string by the EjbServlet; transmitting the HTTP response from the EjbServlet to the client library; and parsing the HTTP response by the client library into return information compatible with the non-Java application and then passing the return information from the client library to the non-Java application.

Abstract: A mediation method and a mediation system divided into independent node components that process event records independently of the other components of the system. In addition, the system is provided with at least one node manager component that configures the node components and starts them up, when required. Further, the node manager component monitors the functioning of the node components and also stops the node components, if required. Each of the independent node components operates according to its own settings and is thus self-contained and capable of continuing operation even though some of the other components are temporarily inoperative. The system also includes a system database that manages configuration information and stores audit trail data.

Abstract: A method, apparatus, and computer program product includes serially receiving, from a source, a plurality of forward messages each addressed to one of a plurality of destinations; receiving a plurality of availability signals, each availability signal indicating that one of the destinations is available to accept a forward message; simultaneously sending a forward message to each available destination; simultaneously receiving, after a predetermined period of time, a plurality of reverse messages from the destinations, each reverse message corresponding to one of the forward messages simultaneously sent to an available destination; and serially sending the reverse messages to the source.

Abstract: In one embodiment, the present invention includes a system that can optimize message passing by, at least in part, automatically determining a minimum number of fabrics and virtual channels to be activated to handle pending connection requests and data transfer requests, and preventing processing of new connection requests and data transfer requests outside of a predetermined communication pattern. Other embodiments are described and claimed.

Abstract: Lock-free circular queues relying only on atomic aligned read/write accesses in multiprocessing systems are disclosed. In one embodiment, when comparison between a queue tail index and each queue head index indicates that there is sufficient room available in a circular queue for at least one more queue entry, a single producer thread is permitted to perform an atomic aligned write operation to the circular queue and then to update the queue tail index. Otherwise an enqueue access for the single producer thread would be denied. When a comparison between the queue tail index and a particular queue head index indicates that the circular queue contains at least one valid queue entry, a corresponding consumer thread may be permitted to perform an atomic aligned read operation from the circular queue and then to update that particular queue head index. Otherwise a dequeue access for the corresponding consumer thread would be denied.

Abstract: A method of data communication between a first virtual machine and a second virtual machine is disclosed. The second virtual machine is executing in a record/replay mode. The method includes copying data from the first virtual machine to a first queue. The first queue is configured to receive the data from the first virtual machine. The first queue has a first queue header section and a first queue data section. The first queue header being write protected and configured to store a tail pointer of the data in the first queue. The tail pointer is updated in the first header section. This update of the tail pointer causes a page fault. The method further includes handling page fault through a page fault handler. The handling includes copying the data from the first queue to a second queue. The second queue being configured to receive a copy of the data and to allow the second virtual machine to access the copy of the data.

Abstract: A message tracking and verifying system for verifying the correctness of messages being passed may comprise a tracking module for tracking a request message and a verifying module for verifying a response message. The tracking module may be configured to store a calculated source address and a calculated response address range. The verifying module may be configured to obtain an actual source address from the response message and an actual response address range for the response message. The correctness of the response message is determined based on the comparison of the calculated source address with the actual source address and the comparison of the calculated response address range with the actual response address range.

Abstract: A computer system and method of using a service oriented architecture (SOA) which runs business service application in a distributed network. The system has a channel dependent client layer containing a presentation layer and an application control layer, a channel independent service layer containing a business service layer and a data service layer and an integration layer. The integration layer can receive requests for service from the client layer and has a message generator for sending a request message to the service layer which is adapted to read the request message and in response, to run the business service application.

Abstract: Techniques involving contact information are disclosed. For example, an apparatus may include a contact entry generation module and an entry updating module. The contact entry generation module creates a contact entry having a location-specific information field. The entry updating module obtains an update for the location-specific information field from a remote device. This update corresponds to a current location.

Abstract: A transaction management engine, such as a business process management (BPM) engine, can allow an application to define transaction demarcations in order to ensure that portions of a workflow are processed atomically. In one such system, a JMS message is queued to the workflow as part of an existing transaction. If that transaction commits, the queued JMS message ensures that the workflow will be invoked in a new transaction that allows the workflow to perform the next unit of work in the newly initiated transaction. When the unit of work is completed, the workflow queues another JMS message. If this transaction commits, the transaction ensures the unit of work has executed in a transaction. When the workflow is invoked again due to the second JMS message, the workflow can continue its operation in a different transaction.

Abstract: One embodiment of the present invention provides a system that facilitates performing operations on a lock-free double-ended queue (deque). This deque is implemented as a doubly-linked list of nodes formed into a ring, so that node pointers in one direction form an inner ring, and node pointers in the other direction form an outer ring. The deque has an inner hat, which points to a node next to the last occupied node along the inner ring, and an outer hat, which points to a node next to the last occupied node along the outer ring. The system uses a double compare-and-swap (DCAS) operation while performing pop and push operations onto either end of the deque, as well as growing and shrinking operations to change the number of nodes that are in the ring used by the deque.

Abstract: Methods and apparatuses are disclosed for sending data from a process to an event dispatch thread for output, where the event dispatch thread handling events may be related to a user interface. The method may include the steps of providing the process. The process and the event dispatch thread executing independent of one another and the process generating a first method call during execution of the process and a final result upon completion of execution, where the first method call includes a partial result generated by the executing process. The method may further include sending the first method call, storing the first method, including coalescing the first method call with an existing method call, retrieving the partial result from the first method call, and outputting the retrieved first method call on the event dispatch thread such that the partial result is displayed to a user.

Abstract: Embodiments of the present invention provide a method, system and computer program product for single program code message retrieval for message queues. In an embodiment of the invention, a message queue data processing system can be configured for single program code message retrieval for message queues. The system can include a message queue executing in a host server and providing an API to applications communicatively coupled to the message queue over a computer communications network. The API exposed by the message queue can include a single program call including program code enabled to open a queuing resource in the message queue, to retrieve all messages in a message buffer from the queuing resource and to close the queuing resource.

Abstract: Methods, systems and computer products are provided for partitioning software application components into separate domains called concurrency domains. Computationally expensive, slow or long-running methods may be deployed into such domains, thus keeping the associated application more responsive to the end user. According to one aspect of the invention, a given concurrency domain is a partition of runtime objects for providing synchronization and thread isolation within the partition and for providing concurrency with other such partitions in a data-driven dynamically composed and reconfigured application.

Abstract: In an image output system in which a client terminal device is connected via a network to an image output device, the client terminal device contains a first transmitting/receiving unit for transmitting/receiving text data containing control information related to an image output by way of an electronic mail, whereas the image output device contains a second transmitting/receiving unit for transmitting/receiving the text data containing the control information related to the image output by way of the electronic mail between the first transmitting/receiving unit and the own second transmitting/receiving unit, and an image output unit for outputting an image based upon an image data file in accordance with the control information which is transmitted/received by the second transmitting/receiving unit.

Abstract: A method for measuring application responsiveness measures the time elapsed between receiving and processing a trailing tag message inserted into the application's message queue. The method receives a message, generates a trailing tag message associated with the message, and inserts the trailing tag message into the application's message queue. The trailing tag message includes a timestamp indicating when the trailing tag message was queued. A default message handler calculates the time elapsed between when the trailing tag message was queued and when the trailing tag message was processed. The elapsed time may then be used to calculated system responsiveness.

Abstract: A method and system of avoiding silent data corruption in a request-response messaging system where a requester relies on tags to match request messages with response messages. The silent data corruption occurring if the requester process a response message after a tag used with the response message was reused with another request message.

Abstract: A method and system for managing availability of a dependent thread to service a nested request is provided. A plurality of reply threads are maintained in a single thread pool. In addition, a counter is provided to track availability of a reply thread from the thread pool. A service thread that requires at least one reply thread to complete execution of a request must check the counter to determine availability of the reply thread prior to execution of the request. The process of determining availability of a reply thread prior to execution of a service thread request avoids initiating execution of a request that cannot be completed in a timely manner, or at all.

Abstract: Systems and methods that set priority levels to messaging systems initiated between end points (e.g., two SQL point services) thru service brokers. A priority component can apply priority at a session level to add priority capabilities on top of service brokers, and enable setting priority for all the messages in a session or conversation. Such priority can further affect the order in which messages from different conversations are sent and the order in which they are received.

Abstract: A target task ensures complete delivery of a global shared memory (GSM) message from an originating task to the target task. The target task's HFI receives a first of multiple GSM packets generated from a single GSM message sent from the originating task. The HFI logic assigns a sequence number and corresponding tuple to track receipt of the complete GSM message. The sequence number is unique relative to other sequence numbers assigned to GSM messages that have not been completely received from the initiating task. The HFI updates a count value within the tuple, which comprises the sequence number and the count value for the first GSM packet and for each subsequent GSM packet received for the GSM message. The HFI determines when receipt of the GSM message is complete by comparing the count value with a count total retrieved from the packet header.

Abstract: Embodiments described herein allow a service component author to write service components without having to handle incoming messages being received at any time. This may be facilitated by a message dispatch engine that dispatches messages from the incoming message queue only when the destination service component has indicated that it is ready to receive the message having that context. If the service component is not yet ready for the message, the message dispatch component may lock the message at least until the destination service component indicates that it is now ready to receive the message. Until that time, the message dispatch engine may ignore the locked message when finding messages to dispatch.

Abstract: A local computer system and a remote computer system are connected by a network. When the local computer system needs to initiate communication with the remote computer system or vice versa, a cross-system request is generated, and placed in a request queue on the computer system generating the request. All cross-system requests residing on request queues and are handled by two jobs executing on local computer system. The first of these jobs, a request push job, pushes cross-system requests existing on local computer system's request queue to the remote computer system's request queue. The second of these jobs, a request pull job, pulls cross-system requests existing on remote computer system's request queue over to local computer system's request queue. In this way, all cross-system communications are initiated from a computer system inside the firewall (e.g., local computer system) without violating any outside-in dataflow limitations.

Abstract: A method and system for processing MTOM messages comprising a root document and one or more binary attachments referenced by the root document, in a Web service requester or provider. When an inbound MTOM message is received, a pipeline comprising a plurality of message handlers is selected to process the received message. The message is unpackaged by separating the binary attachments from the root document, and the pipeline properties are checked to determine if conversion of the message is required by at least one message handler. Responsive to the result of the determination, either conversion of the message is carried out, by encoding the binary data in each of the attachments and replacing each reference in the root document to a binary attachment with the encoded data for that attachment, and processing the converted message by the pipeline, or the root document and binary attachments are processed by the pipeline.

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: Methods, systems, and products for random access for processing messages in a message queue that include creating a map relating message identification and message position, including adding an entry in the map whenever a message enters the queue; instantiating a plurality of consumers for the messages; and consuming, with the consumers, the messages in dependence upon the map. In typical embodiments, the plurality of consumers includes a particular number of consumers and such embodiments typically include assigning an ordinal value to each consumer and consuming the messages further comprises identifying the messages to be processed by each consumer in dependence upon the ordinal values, the number of consumers, and the message positions.

Abstract: Method for managing a data transmit queue, for use with a host and a network interface device. Roughly described, the host writes data buffer descriptors into a transmit descriptor queue, and the network interface device writes events to notify the host when it has completed processing of a transmit data buffer. Each of the transmit completion event descriptors notify the host of completion of a plurality of the transmit data buffers.

Abstract: In embodiments, an implementation of a service oriented architecture is provided including an application service bus capable of approximating point-to-point performance by reducing the format transformation of application messages by way of relaying them in a native format when the message format of a consumer application and/or service provider application is supported by the service bus. Preferably, the service bus is capable of supporting multiple message formats and transport protocols and comprises a plurality of components including a Service Initiator module, a Service Terminus module, a Service Locator module, and a Transport module. The service bus provides logical isolation between a consumer application and a provider application by exposing a set of interfaces for relaying service request and service response messages between the applications.

Abstract: Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.

Abstract: Systems and/or methods that facilitate transferring data between a processor component and memory components are presented. A transfer controller component facilitates controlling data transfers in part by receiving respective subsets of data from respective memory components and arranging the respective subsets of data based in part on a desired predefined data order. The processor component generates a transfer map that includes information to facilitate arranging data in a predefined order. The processor component generates respective subsets of commands that are provided to queue components in respective memory components to retrieve desired data from the respective memory components. Each memory component services the commands in its queue component in an independent and parallel manner, and transfers the data retrieved from memory to the transfer controller component, which can arrange the received data in a predefined order for transfer to the processor component.

Abstract: When an external user such as a trading partner makes a request into an access point of an application on an application server, that external user can be authenticated as a valid user on the system. The identity of the external user can then be switched to an internal system user identity, such as by pushing new user information on the user stack or by adding internal user context. This internal system user identity allows the user to access resources and applications on the application server that are not available to an external user. The use of this single internal system user identity allows for a single login process that can be used for all resources and applications on the server. The use of an internal user also prevents an external user from accessing those resources unless the user is first authenticated through a proper entry point.

Abstract: A tracking system includes a business system using a plurality of application modules each including a computer for processing a transaction including a plurality of steps. A messaging system includes a messaging computer program embodied in a computer readable medium in each of the computers for communicating between the computers. The messaging system generates queues of messages being communicated between the computers. The messaging system can be configured by an administrator to generate tracking data about the messages being communicated between the computers. A tracking module is included in one of the computers, and has the messaging computer program and a tracking computer program embodied in the computer readable medium for specifying status data for retrieval from the messaging queues, receiving the status data from the messaging queues into a tracking queue, and storing the status data in a data storage system.

Abstract: An asynchronous message passing mechanism that allows for multiple messages to be batched for delivery between processes, while allowing for full memory protection during data transfers and a lockless mechanism for speeding up queue operation and queuing and delivering messages simultaneously.

Abstract: A multiple processing architecture and a method of managing a work queue of that processing architecture. The multiple processing architecture comprises a plurality of distributed computer systems and a coupling facility. These systems are all connected to the coupling facility by a plurality of links The coupling facility holds and manages a work queue for the applications servers; and the processing system further includes queue managing means to separate the work queue into at least a plurality of separate zones, and to associate each of a plurality of subsets of the computer systems with a respective one of said zones whereby, for each of said subsets of computer systems, all of the computer systems in the subset can place work requests on, and retrieve work requests from, the zone associated with said subset.