Abstract: A message is buffered and processing statistics are associated with the message, including characterizations of whether a process instance is to process the message, a number of process instances handling the message, and a number of process instances that have processed the message. A process instance may be generated to process content of the message depending on the message. The message may be dequeued based on the processing statistics. For example, if the processing statistics indicate that no process instances are handling the message and no process instance is to process content of the message. Also, if the content of the message is to be processed by a threshold number of process instances, the message is only dequeued if the processing statistics indicate that the threshold number of process instances have processed the content of the message.

Abstract: A method, system and article of manufacture that provides a control queue that regulates access to a shared resource, a software component that manages a clients interest in the shared resource and a registration mechanism in various messaging topologies; for example, within a message-oriented middleware framework where the messaging topology is configured as a point-to-point message topology within the MOM framework or a publication-subscription messaging topology within the MOM framework.

Abstract: Methods, systems, and computer-readable media are disclosed for monitoring a distributed application. A particular method identifies a plurality of components of a distributed application. The method also identifies a specific technology associated with a particular component and attaches a technology specific interceptor to the particular component based on the identified specific technology. The method includes intercepting messages that are sent by or received by the particular component using the technology specific interceptor. At least one potential work item is generated based on the intercepted messages. The method includes determining whether to schedule the at least one potential work item for execution based on a predicted impact of the at least one work potential item on performance of the distributed application.

Abstract: The example embodiments disclosed herein relate to application integration techniques built around the publish-and-subscribe model (or one of its variants). In certain example embodiments, a first standards-based messaging protocol (e.g., the JMS messaging protocol) may be used to create a trigger so that a message envelope according to a second standards-based messaging protocol (e.g., SOAP) may be communicated over the first standards-based messaging transport layer. In other words, in certain example embodiments, a trigger according to a first protocol (e.g., JMS) may have a message according to a second protocol (e.g., SOAP) associated therewith so as to enable the message to be communicated over the first protocol's transport layer. The trigger may be configured to receive a message from a web service consumer via the JMS messaging protocol and pass it to the web service stack for dispatch to the web service provider.

Abstract: A multi-modal user-interface for an electronic device comprises two user-interface components (10, 11). Each user-interface component (10, 11) has its own individual event queue (12, 13), event checking loop (14, 15), and “action listener” (16, 17). Each user-interface component (10, 11), identifies and detects user-interaction events and posts those events to its own respective event queue. The interaction event queues (12, 13) are arranged such that when an interaction event happens at one or other queue 1(2, 13), any appropriate user interface actions that are possible at the respective queue are executed immediately, and at the same time the event is reported to the interaction queue at the other user-interface component via a communications channel (18). In this way, a distributed interaction event queue arrangement is maintained.

Abstract: A system, method and computer program product are provided for sharing information in a distributed system. After information is received, it is stored on a bulletin board. In use, the information is shared, in real-time, among a plurality of heterogeneous processes.

Abstract: The present invention relates to devices and methods that coordinate an external conversation process between entities with an internal workflow of one of the entities. More particularly, it relates to devices and methods that are compliant with an inter-enterprise conversation process standard for routing electronic commerce documents between enterprises. Particular aspects of the present invention are described in the claims, specification and drawings.

Abstract: Systems and methods are provided for processing different concurrent tasks by a subsystem managed by a central processor. Each tasks is comprised of successive messages including a first message, intermediate messages, and a last message. Each intermediate message comprises a subtask parameter and a link to the next message that indicates the time when the next message is to be processed. The central processor and the subsystem are connected to a storage memory and several counters associated with respective tasks. The system and method reduce task disruptions of the system.

Abstract: A log information issuing device includes a priority information manager in which priority information is stored, a priority of a log message being defined in the priority information, a message queue that has a plurality of queues for storing the log message according to the priority, a message sorting processor that refers to the priority information to store the log message in the message queue, an internal resource information collector that determines a load state of an internal resource from operating information on the internal resource, a log message queue processor that takes out the log message from the message queue, the log obtaining condition defining a condition of the log message is taken out from the message queue according to the load state, and a log processor supplies the log message as the log information, the log message being taken out by the log message queue processor.

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 system, method and computer program product for communicating between two virtual machines including utilizing first and second virtual machine queues associated with respective first and second virtual machines to communicate between the virtual machines.

Abstract: Techniques for managing messages in computer systems are provided. In one embodiment, in response to a publisher attempting to enqueue a message in a queue, a determination is made whether a condition is satisfied. The condition is based on the current usage of the queue by the publisher. Based on whether the condition is satisfied, a decision is made whether to enqueue the message in the queue. The decision whether to enqueue the message may comprise restricting the publisher from enqueueing any more messages in the queue until the same or a different condition is satisfied.

Abstract: The invention includes a method and apparatus for processing protocol messages for multiple protocol instances. In one embodiment, a method for processing protocol messages includes receiving a plurality of messages for a plurality of processors where each received message is associated with one of the protocol instances, generating a processing request for each message, queuing the processing requests, and servicing the queues in a manner for arbitrating access by the queues to the processors for processing the messages. A processing request generated for a received message identifies one of the protocol instances with which the message is associated. The processing requests are queued using a plurality of queues associated with the respective plurality of protocol instances, where each processing request is queued in one of the queues associated with the one of the protocol instances with which the processing request is associated.

Abstract: A first in, first out queue uses a sequence of arrays to store elements in the queue. The arrays are constructed using a lock free queue, and within each array, a lock free mechanism may be used to enqueue and dequeue elements. Many embodiments may use atomic operations to ensure successful placement of elements in the queue, as well as remove elements from the queue. The atomic operations may be used within a loop until successful.

Abstract: A method for providing “guaranteed message delivery” for network based communications between a client machine and a server. The client machine includes a Client Runtime Environment (CRE) and the server includes a Server Runtime Environment (SRE). The method includes the following steps. A first message queue is maintained in the CRE. A first unique identification is attached to the first message from the first message queue and the first message is sent from the CRE to the SRE via a network communication. The SRE receives the first message and sends an acknowledgement of the receipt of the first message to the CRE. Upon receiving of the acknowledgement within a certain time threshold, the CRE removes the first message from the first message queue in the CRE. A method of providing “server-push” of messages from the server to the client machine utilizing a push Servlet and a push API.

Abstract: A system and method for workforce management. Information is received from a first application. The information is converted into a message in accordance with a predefined syntax. The message is placed into a queue. A topic is received from a second application. A determination is made if the message corresponds to the topic, and the message is sent to the second application.

Abstract: A method and system of inherited transactions in an asynchronous messaging are provided. A producer requests a message put operation in a transaction. A consumer carries out a get operation with the option to inherit the transaction of the put operation. In an inherited transaction, the consumer's transaction will not commit until the transaction it has inherited from commits. Work performed in the producer's transaction is visible to the consumer, but work performed in the consumer's transaction is not visible to the producer preserving asynchronous messaging semantics. A transaction hierarchy results and only the net effect of transaction hierarchy is hardened to non-volatile storage.

Abstract: Embodiments of the present invention provide a method, system and computer program product for agnostic processing of message queues and sequential files. In an embodiment of the invention, a method for agnostic processing of message queues and sequential files can be provided. The method can include receiving an access request for a resource that is uniform for both a message queue and a sequential file and identifying a resource type of the resource. In response to identifying the resource type as a message queue, a corresponding access request specific to a message queue can be invoked in the message queue. Otherwise a corresponding access request specific to a sequential file can be invoked responsive to identifying the resource type as a sequential file.

Abstract: An integrated circuit with an array of nodes linked by an on-chip communication network. Messages are communicated between nodes utilizing logical channels representing hardware resources at the associated nodes. A given logical channel is associated with a receiver node and a transmitter node. A set of logical channels are associated with a logical mux channel. The nodes are adapted to carry out operations utilizing a given logical mux channel associated therewith in order to identify a logical channel that is associated with the given logical mux channel and that has a predetermined ready state. In the preferred embodiment, the operations are invoked by a calling thread that is blocked in the event that no logical channel associated with the given logical mux channel has a predetermined ready state. The calling thread is then reactivated in the event that at least one logical channel associated with the given logical mux channel transitions to the predetermined ready state.

Abstract: A robust toolkit provides facilities that can be assembled in a modular manner to specify the fundamental architecture of a net-centric application. A bootstrapping process assembles various facilities within the architecture. A configuration facility defines an API for getting properties that can be defined in any number of different types of sources. A factory de-couples how a resource is produced from where the resource is used. A selector framework applies standard query language to contexts other than querying a database. A pipeline architecture defines a model view controller-like framework for a processing pipeline. Selectors are used to specify when certain portions of a Web conversation should be made available to a user. An authorization facility associates permissions with a user to specify which portions of an application a user is authorized to use.

Abstract: The present invention relates to devices and methods that coordinate an external conversation process between entities with an internal workflow of one of the entities. More particularly, it relates to devices and methods that are compliant with an inter-enterprise conversation process standard for routing electronic commerce documents between enterprises. Particular aspects of the present invention are described in the claims, specification and drawings.

Abstract: A method and apparatus for propagating and managing data, transactions and events either within a database, or from one database to another is provided. In one embodiment, messages are propagated from a source to a first queue and a second queue with the queues associated with the same database. The connection from the source to each queue maintains its own propagation job. This method could also be employed with cluster databases.

Abstract: Various embodiments of the present invention are directed to methods and systems for data transfer between electronic, hand-held devices, including cell phones, and computer systems, including servers and PCs, as well as component methods and systems of these data-transfer methods and systems. Component methods and systems of the present invention include secure links between various devices, enhancements to electronic hand-held devices that enable service applications to run continuously or intermittently on the devices, deployment of dynamically created service applications to electronic, hand-held devices, and various additional component methods and systems that facilitate the above-mentioned component methods and systems. One embodiment of the present invention is a robust, efficient, secure, and user-friendly method and system for transferring data between cell phones and personal computers.

Abstract: A method, system, method and computer program product for facilitating collective communication in parallel computing. A system for parallel computing includes one or more communicators. Each of the one or more communicators comprises a plurality of processes. A memory pool including one or more early arrival buffers is provided. One or more tokens are assigned to a specified communicator included in the communicators. Each of the processes comprised by the specified communicator may consume any token assigned to the specified communicator. Requesting an early arrival buffer included in the memory pool requires consuming at least one token. A collective communication operation is performed using the specified communicator. The collective communication operation is performed eagerly using early arrival buffers obtained by consuming the tokens assigned to the communicator.

Abstract: A system, method, and a computer program product for processing messages in a message queuing system includes an application repository, a message store, and a queue-less application programming interface in each message queuing system. The application repositories may store application identification data provided by applications. The application programming interfaces may put messages to and get messages from the message queuing systems, and provide with each connect and put request application identification data.

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: A system and method for integrating messages across multiple applications. The applications may be on one server or on several servers, and each application may service one or more e-clients. The system and method securely segregates the data for each e-client. Further, the system can be dynamically reconfigured by adding or deleting new messages and/or applications, without affecting the performance of the unchanged parts of the system. The various applications using the system need not be aware of the existence of the other applications.

Abstract: The present invention extends to methods, systems, and computer program products for coordinating application state and communication medium state. Embodiments of the invention provide mechanisms by which a dispatcher can enable application code to coordinate changes in application state with the consumption of messages from a communication medium. The coordination can be automatic where the dispatcher performs the coordination, or manual, where the coordination is performed more expressly by application code. Embodiments also include mechanisms by which applications targeting an execution (e.g., continuation based) runtime may compose alternative state transitions in the application with a peek lock protocol.

Abstract: Messages may be provided to a source queue in serialized order, each message associated with a serialization context. The messages may be buffered in the source queue until a transmission time is reached, in turn, for each buffered message. Transmission-ready messages may be sent from the source queue according to the serialized order, using the serialization context, while continuing to store existing messages that are not yet transmission-ready. A queue assignment of the serialization context may be changed to a target queue. Subsequent messages may be provided with the serialization context to the target queue for buffering therein, while remaining transmission-ready messages may be continued to be sent from the source queue. All of the existing messages from the source queue associated with the serialization context may be determined to have been sent, and the subsequent messages may begin to be sent from the target queue in serialized order, using the serialization context.

Abstract: System, method, and computer program product for automatically monitoring message flow in a message queuing system in an asynchronous messaging network. A message queuing application programming interface appends, in a message descriptor field for recording and monitoring message flow, unique application identification keys of applications that process the message, operation codes applied to the message, and time stamps of operations applied during message processing. The keys are generated by the start-up of the applications and are filled in by each PUT and GET function of the API. After processing of the message, the entries included in the message descriptor field are monitored, and any deviation from a predefined message flow is automatically detected and reported.

Abstract: In one embodiment, a computer system instantiates a queue manager configured to process a plurality of existing queue manager commands on messages in a message queue. The computer system instantiates a virtualized instance of a queue manager in a virtual layer associated with the queue manager in the computing system. The a virtualized queue manager instance provides supplemental queue manager commands usable in addition to existing queue manager commands, such that the queue manager can be used to implement the supplemental commands without substantial modification. The computer system receives an indication that a message in a message queue is to be accessed according to a specified command provided by the instantiated virtualized queue manager instance that is not natively supported by the queue manager and the virtualized queue manager performs the specified supplemental command as indicated by the received indication by performing one or more existing queue manager commands.

Abstract: A method for facilitating network communications from one or more independent execution threads by a dedicated worker thread. Because an operating system is not designed for use with a large number of threads, such a system requires the use of multiple computers for simulating a large number of virtual users. This increases complexity, as well as cost. The present invention reduces the number of threads needed, which reduces resource needs, and in turn increases the number of virtual users that can be simulated. According to the present invention, a worker thread uses non-blocking function calls to efficiently handle requests for network operations.

Abstract: A forced lock-step operation between a CPU (software) and the hardware is eliminated by unburdening the CPU from monitoring the hardware until it is finished with its task. This is done by providing a data/control message queue into which the CPU writes combined data/control messages and places an End tag into the queue when finished. The hardware checks the content of the message queue and starts decoding the incoming data. The hardware processes the data read from the message queue and the processed data is then written back into the message queue for use by the software. The hardware raises an interrupt signal to the CPU when reaching the End tag. Speed differences between hardware and software can be compensated for by changing the depth of the queue.

Abstract: Managing an asynchronous messaging queue with a client computer in an asynchronous messaging system, where the client computer is programmed to store an manage the asynchronous messaging queue, includes receiving a reactive message in the asynchronous messaging queue, the reactive message including an identification of a referenced message and an action to be performed on the referenced message; and performing the action on the previously initiated message with the client computer if the referenced message is present in the asynchronous messaging queue.

Abstract: The present invention provides a method, system and computer program product for automatically generating message queue scripts for defining one or more Websphere® Message Queue™ (WMQ) objects on one or more queue managers. A user provides parameters corresponding to the WMQ objects as input in an input parameter file. The parameters include the name of the WMQ objects and the queue managers. Further, a message queue environment consistency check is performed on the input parameter file for validating the parameters provided. The validation is performed by using a database that stores information about the message queue environment. After successful validation of the input parameter file, one or more message queue scripts are generated for defining the WMQ objects on the queue managers. Fallback scripts may also be generated for rolling back the modifications performed on the queue managers, if required at a later stage.

Abstract: According to an aspect of the embodiment, a message queuing unit of the message processing apparatus stores received messages. A message reception control unit receives a notification of destinations of messages, extracts only the messages for current processes based on a process control table recording current or standby of processes, and transmits the messages to corresponding applications as current processes. On the other hand, the message reception control unit does not transmit the messages to the applications as standby processes.

Abstract: A system and method for delivering data from a device driver to an application increases the usage of synchronous processing (fast I/O mode) of data requests from the application by utilizing thread scheduling to enhance the likelihood that the requested data are available for immediate delivery to the application. If the amount of data in a data queue for storing data ready for delivery is low, the thread scheduling of the system is modified to promote the thread of the device driver to give it the opportunity to place more data in the data queue for consumption by the application. The promotion of the thread of the device driver may be done by switching from the application thread to another thread (not necessarily the device driver thread), boosting the device driver's priority, and/or lowering the priority of the application, etc.

Abstract: A system and method for operating a storage system is provided. A plurality of operating system transaction entries are stored in a log, and a swarm of messages with respect to the plurality of operating system transaction entries is established. The swarm of messages is delivered to an operating system of the storage system. A processor performs a parallel retrieval process for a plurality of messages in the swarm of messages by processing the plurality of messages in an arbitrary order without regard to an underlying order of the messages.

Abstract: A low latency peripheral device sharing system has a host computer with an operating system, a kernel memory buffer, applications, device specific drivers, and a peripheral server driver. The server driver intercepts function calls invoking the local serial ports, and passes standard serial data from the application to a local area network. A device server on the local area network reads the data using a hybrid read block (semi-blocking read), and writes the data to the FIFO registers of the serial device and the remaining data to a queue for the serial device. Finally, the device server times the serial data and returns an intercharacter interval timer flag to the host computer to terminate a read operation.

Abstract: The present invention adds support for concurrency to a mainstream object-oriented language. Language extensions are provided that can enable programs to be developed that can either be run in one address space, distributed across several process on a single computer, or distributed across a local-area or wide-area network, without recoding the program. Central to this aspect is the notion of a service, which can execute its own algorithmic (logical) thread. Services do not share memory or synchronize using explicit synchronization primitives. Rather, both data sharing and synchronization is accomplished via message-passing, e.g., a set of explicitly declared messages are sent between services. Messages can contain data that is shared, and the pattern of message exchange provide the necessary synchronization.

Abstract: A method of performing message operations includes receiving a message operation request identifying a queue, retrieving a list of the subset of partitions associated with the alias received in the request, and selecting at least one of the partitions within the retrieved subset. According to the method, the queue includes a plurality of partitions, the request identifies the queue with an alias, and the alias having a subset of the plurality of partitions associated therewith.

Abstract: A system for processing multiple potentially related requests is provided. The system includes a pending request queue, a related request queue, an in-process queue, and an adapter. The pending request queue receives requests from at least one application. The in-process queue receives a first request from the pending request queue when no other requests are present in the in-process queue related to the first request. The related request queue receives the first request from the pending request queue when other requests are present in the in-process queue related to the first request. The adapter monitors the pending request queue, related request queue, and in-process queue. The adapter also communicates information related to the requests from the pending request queue to the related request and in-process queues as appropriate. The adapter also communicates information related to the requests from the in-process queue to a processor for processing the requests.

Abstract: A messaging system and method are provided to enable transactional work, done as a result of a recipient processing an asynchronous message, to be involved in the transaction under which message was sent. Involvement may be directly in the senders transaction or indirectly through a separate transaction which can be a subordinate to, a child of, or merged with the transaction under which message was sent. The message is delivered by calling an operation, a definition of which has been registered for the queue. If the message is added to a queue for subsequent delivery to a recipient, details of the transaction under which message was sent are added to the message. As a result the recipient can take appropriate action to ensure that any transactional work, it causes to happen, will be done directly or indirectly under the scope of the transactions under which message was sent.

Abstract: To enable use of an application on an application server at a mobile communication device, at a transaction server, a message received from the mobile is pushed out to the application. Any return messages is routed back to the mobile. The transaction server may use a queue to store all messages destined to a given application and attempt to push all messages on a given queue on receipt of a further message for the queue.

Abstract: A method, apparatus, and system are provided for a Message-Oriented Middleware (MOM) provider having multiple logical MOM server instances. In an embodiment, a number of application servers are communicatively coupled on an enterprise network. In an embodiment, the MOM provider includes an MOM server instance implemented on each of the plurality of application servers. Each MOM server instance may include a session container to manage one or more sessions and a destination container to provide one or more destinations. In an embodiment, each destination is identified by a globally unique identifier.

Abstract: A method for managing the protocol of read/write messages in a PCI Express communication link is disclosed. The method comprises maintaining queues of write requests and read requests associated with each of a plurality of request identifications that are contained in a message header, wherein the read requests associated with a request identification are held in abeyance until such time that write requests associated with the request identification are completed.

Abstract: A message brokering mechanism for performing a recovery operation in a transaction processing system including first and second stages operable to exchange message requests and responses. The first stage may receive a message request from a message source and may check whether the message request is a special message request. This may be by way of checking if a recovery attribute of the message request is set. A normal message request may have a recovery attribute that is not set. If the message request is a special message request, it may be dispatched to the second stage. If the message request is a normal message request, it may be dispatched to the second stage if the normal message request is not a repeat normal message request.

Abstract: The present invention provides an online messaging architecture configured to process incoming request messages and provide reply messages in an efficient manner. The invention reduces processing overhead within a mainframe computing environment were individual requests are treated as individual transactions by instead storing requests within a queue, spawning necessary processes according to the queue and processing multiple transactions in a pseudo batch manner.

Abstract: An information processing system includes a synchronous processing unit configured to execute a group of modules to perform synchronous real-time processing in a single process serving as a unit of execution of a program, a parallel processing unit configured to arrange modules which allow asynchronous processing and which should perform parallel processing in different processes and execute the modules in parallel, and an intermodule communication unit configured to perform transmission and reception of data among the modules by means of message passing.

Abstract: Systems and methods for publishing information to a plurality of software applications are provided. The methods may comprise identifying a plurality of records to transmit to the software applications based on a last sequential identification code in a high watermark table of a persistent store. The plurality of records may be generated subsequent to a previous record corresponding to the last sequential identification code. A plurality of corresponding messages each corresponding to a record of the plurality of records may be prepared. Each of those messages may then be transmit to at least one software application and may include a most recent message corresponding to a most recent record. In the high water mark table of the persistent store, an updated last sequential identification code may be stored as a pointer for subsequent reference. The updated last sequential identification code may correspond to the most recent message transmitted in the plurality of corresponding messages.