Abstract: Various technologies pertaining to instant messaging are described herein. A persistent instant messaging group is created, wherein the persistent instant messaging group comprises a plurality of members and persists over a plurality of instant messaging sessions. Instances of an instant messaging application are installed on mobile telephones, and the instant messaging application is used to transmit instant messages between members of the persistent instant messaging group. Messages directed towards offline members of the persistent instant messaging group are transmitted to such members when they come online.

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: Disclosed are various embodiments for balancing a load on a queue among multiple consumers. A target polling hit rate is derived for at least one queue from a consumer load. The consumer load dictates a read rate of the at least one queue. The consumer load on the at least one queue is adjusted responsive to a difference between the target polling hit rate and an observed polling hit rate for the at least one queue.

Abstract: Processes in a message passing system may be unblocked when messages having data patterns match data patterns of a function on a receiving process. When the match occurs, the process may be added to a runnable queue, and in some embodiments, may be raised to the top of a runnable queue. When a match does not occur, the process may remain in a blocked or non-executing state. In some embodiments, a blocked process may be placed in an idle queue and may not be executed until a process scheduler determines that a message has been received that fulfills a function waiting for input. When the message fulfills the function, the process may be moved to a runnable queue.

Abstract: A computer-based method configures a hardware circuit to transfer a message to a message queue in an operating system. The hardware circuit is used to transfer a message to the message queue in the operating system without requiring use of either the operating system or a hypervisor associated with the operating system. The using the hardware circuit uses a logical identifier associated with the message to select an entry in a mapping table of the hardware circuit. A value in the entry in the mapping table is used to select an entry in an action table. The entry in the action table is used to determine a tail pointer for the message queue. The hardware circuit appends the message to a location indicted by the tail pointer without requiring cycles of a hypervisor associated with the strand.

Abstract: Certain example embodiments relate to techniques for managing the interprocess communication between at least one database client process and at least one database server process in a database system. The at least one database client process sends at least one request to the at least one database server process, with the at least one request comprising one or more buffers. The one or more buffers are transferred, in a single step, from the at least one database client process to a buffer area. The one or more buffers are transferred, in a single step, from the buffer area to the at least one database client process. The buffer area is directly accessible by the at least one database server process.

Abstract: To process media data from one or more sources, a hierarchy of media components are formed. Each media component receives as input one or more streams of media data and manipulates the media data to produce an output media stream. The media components conform to a uniform plug-in structure. The plug-in structure defines an abstraction that facilitates the hierarchical organization of the media components and that allows the media components to interact, in a decoupled manner, with each other and with processors that perform specific types of media data manipulations. The hierarchy can be reorganized dynamically.

Abstract: Provided are a system and method for allocating a specific job or application to a specific slave core by using an inter-core-communication (ICC) channel and executing the job or application in a multicore system environment including the master core and a plurality of slave cores. The method of a master core, includes: initializing message transmission times; generating an event for processing a instruction received from an application program and generating a channel event message from the event; checking a process for transmitting the generated channel event message, and if a channel event message queue corresponding to an event transmitting request is not “FULL” of a previously-stored channel event message, transmitting the channel event message to a specific slave core to request for storing the channel event message; and returning a response of processing status to the request for storing the channel event message to the application program.

Abstract: A method includes receiving data in a first data processing module, and enabling a second data processing module when at least one signal time slot of the received data comprises data that complies with a first data transmission standard. The method also includes exchanging signals between the first data processing module and software executing in a processor, and determining that a software configuration of the second data processing module has been completed. The method also includes processing the data in the second data processing module for the at least one signal time slot, and enabling a third data processing module upon a completion of processing at least one data block in the second data processing module, and determining that a software configuration of the third data processing module has been completed, the at least one data block comprising multiple signal time slots.

Abstract: A method for recovering and requeueing lost messages is disclosed. The lost messages are intended for delivery from a first computer program to a second computer program but are instead stranded in locations internal to the first program. The method extracts one or more of these stranded messages from the location internal to the first program, determines the original destination of each stranded message and delivers that message to the second program. Delivery of each message to the second program is facilitated by using message queues provided by middleware type software programs. The desired middleware program can be selected by the user of the method, and the method provides for the necessary formatting of each recovered message according to the selected middleware. Absent use of the present method, these stranded messages would not be routed to their original destinations.

Abstract: The present invention extends to methods, systems, and computer program products for maintaining a count for lock-free stack access. A numeric value representative of the total count of nodes in a linked list is maintained at the head node for the linked list. Commands for pushing and popping nodes appropriately update the total count at a new head node when nodes are added to and removed from the linked list. Thus, determining the count of nodes in a linked list is an order 1 (or O(1)) operation, and remains constant even when the size of a linked list changes.

Abstract: A method of 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 previously initiated message and an action to be performed on the previously initiated message; and upon determining that the previously initiated message has already been received in the asynchronous messaging queue, performing the action on the previously initiated message with the client computer.

Abstract: A computer implemented method invokes a business application in response to receipt of a request Simple Object Access Protocol (SOAP) message. The request SOAP message requests an operation that is defined in a Web Services Description Language (WSDL) service. To implement the operations defined in the WSDL service, the WSDL service is provided as input to a tool that generates a business application which corresponds to the supplied WSDL service. The SOAP BODY from the request SOAP message is converted into an unformatted data structure for inputting to the business application, while information from the SOAP HEADER is retained in order to generate a reply SOAP message that contains execution results.

Abstract: A message is efficiently relayed in a cut-through mode to a communication line of the transmission destination of a transmission rate higher than that of the communication line of the recipient while preventing the state that there is no data to be transmitted. A vehicle-mounted relay connection unit is used to relay messages received through first CAN communication lines to a second CAN communication line of a transmission rate higher than that of the first transmission lines in a cut-though mode.

Abstract: An interprocess memory controller is described that may be used to provide multiple processes within a multi-process device with access to a shared physical memory. The described interprocess memory controller may enforce access rights to shared memory that has been allocated to the respective processes, thereby guarding the multi-process device from instability due to the unauthorized overwriting and/or unauthorized freeing of allocated memory. The described interprocess memory controller approach may streamline interprocess communication by allowing data associated with an interprocess communication to be passed from a first process to a second process by passing a pointer as well as access rights to a buffer in shared memory that contains the message data.

Abstract: Computer-executable code is automatically generated for a message flow in a message queuing infrastructure by determining a type of the message flow, inputting message flow parameters, and generating the computer-executable code based on the type of the message flow and the message flow parameters. The generation of code can also implement a design pattern, which is input based on the determined type of message flow. The computer-executable code can be, for example, Extended Structured Query Language (ESQL) code. The type of the message flow can identify, for example, a transformation requirement of the message flow. The transformation requirement can be, for example, one of (i) transformation from a first Extensible Markup Language (XML) message to a second XML message, (ii) transformation from an XML message to a Message Repository Manager (MRM) message, and (iii) transformation from a first MRM message to a second MRM message.

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. Data from the first virtual machine is copied to a first queue. The first queue receives the data from the first virtual machine. The first queue has a header section and a data section, wherein the header section being write protected and stores a tail pointer of the data in the first queue. The tail pointer is updated in the header section. This update of the tail pointer causes a page fault, which is handled-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: 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: Described are techniques for communicating between one or more producers and one or more consumers. A first consumer of an event queue registers for notification regarding occurrences of one or more events. A producer of the event queue posts one or more notifications to one or more consumers of the event queue regarding one or more occurrences of one or more events. Each of the consumers receive notification regarding occurrences of events for which the consumer is registered. The first consumer retrieves posted event notifications regarding events for which the first consumer is registered. If the first consumer is executing in user space and an event notification list to which the event notifications for the first consumer are posted is located in shared memory, the first consumer retrieves the posted event notifications without proxying into kernel space.

Abstract: A computer-based method configures a hardware circuit to transfer a message to a message queue in an operating system. The hardware circuit is used to transfer a message to the message queue in the operating system without requiring use of either the operating system or a hypervisor associated with the operating system. The configuring includes tieing (i) a value in a head pointer register with a head pointer for the message queue stored in the hardware circuit and (ii) a value in a tail pointer register for the message queue with a tail pointer for the message queue stored in the hardware circuit so that the value in the head pointer register equals the stored head pointer and the value in the tail pointer register equals the stored tail pointer. The using the hardware circuit uses a logical identifier associated with the message to select an entry in a mapping table of the hardware circuit. A value in the entry in the mapping table is used to select an entry in an action table.

Abstract: An information messaging and collaboration system is described. In one embodiment, for example, a method is described for interactive content retrieval and display, the method comprises steps of: providing a plurality of portlets for retrieval of content for display in a user interface; mapping a message action to a first portlet to create a messaging portlet for sending a message in response to user interaction with the messaging portlet; creating a listener portlet by registering a second portlet to receive messages from the messaging portlet; and in response to user interaction with the messaging portlet, retrieving particular content for display in the user interface based on the message received by the listener portlet from the messaging portlet.

Abstract: A broker may be used as an intermediary to exchange messages between producers and consumers. The broker may store and dispatch messages from a physical queue stored in a persistent memory. More specifically, the broker may enqueue messages to the physical queue that are received from producers and may dispatch messages from the physical queue to interested consumers. The broker may further utilize one or more logical queues stored in transient memory to track the status of the messages stored in persistent memory. As messages are dispatched to and acknowledged by interested consumers, the broker deletes acknowledged messages from the physical queue. The messages deleted are those preceding a physical ACKlevel pointer that specifies the first non-acknowledged message in the physical queue. The physical ACKlevel pointer is advanced in the physical queue based on the relative position of corresponding logical ACKlevel pointers maintained by the logical queues.

Abstract: A method for recovering and requeueing lost messages is disclosed. The lost messages are intended for delivery from a first computer program to a second computer program but are instead stranded in locations internal to the first program. The method extracts one or more of these stranded messages from the location internal to the first program, determines the original destination of each stranded message and delivers that message to the second program. Delivery of each message to the second program is facilitated by using message queues provided by middleware type software programs. The desired middleware program can be selected by the user of the method, and the method provides for the necessary formatting of each recovered message according to the selected middleware. Absent use of the present method, these stranded messages would not be routed to their original destinations.

Abstract: Disclosed embodiments include a Java messaging method for efficient inter-node and intra-node communications on computer systems with multi-core processors interconnected via high-speed network interconnections. According to one embodiment, the Java messaging method accesses the high-speed networks and memory more directly and reduces message buffering. Additionally, intra-node communications utilize shared memory transfers within the same Java Virtual Machine. The described Java messaging method does not compromise Java portability and is both user and application transparent.

Abstract: A device, system and method are provided for presenting message threads in a device display where messages may have a persistent or intermediate status. A list of message threads is displayed, collated according to a given message thread attribute, is displayed. When a new message is detected belonging to one of the message threads, if the message has a persistent status it is added to the message thread and the collating message thread attribute for that thread is updated. If the message has an intermediate status, it may be added to the message thread but the collating message thread attribute for that message is deferred until the intermediate status is changed to a persistent status. The collated list of message threads is then updated. By deferring updates to the collating message thread attribute when a message has an intermediate status, disruption to the order of the collated list is mitigated.

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: A mechanism is provided for merging in a network processor results from a parser and results from an external coprocessor providing processing support requested by said parser. The mechanism enqueues in a result queue both parser results needing to be merged with a coprocessor result and parser results which have no need to be merged with a coprocessor result. An additional queue is used to enqueue the addresses of the result queue where the parser results are stored. The result from the coprocessor is received in a simple response register. The coprocessor result is read by the result queue management logic from the response register and merged to the corresponding incomplete parser result read in the result queue at the address enqueued in the additional queue.

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: Focusing electronic mail messages in a list of messages. Category information is received for classifying particular e-mail messages or senders of the messages in the list of e-mail messages according to a category. The method also includes setting a status data associated with each of the particular messages. The status data indicates the category classified by the user. A first instruction is received from the user for focusing the particular messages according to the category. The particular messages having the status data therewith in the list are focused collectively without altering a preexisting order of the messages in the list.

Abstract: One or more policies to be applied to a set of one or more messages in a message oriented middleware are defined. Metrics of the message oriented middleware are monitored. Application of a policy in response to a trigger condition being satisfied is initiated. Application of the policy applies actions across the set of one or more messages.

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 network device may include a line interface to receive and transmit data units, a memory including instructions associated with a user space and a kernel space that are executable by a processor, the user space including a first-in-first-out (FIFO) region for storing the data units and corresponding metadata, where the kernel space writes the data unit and the corresponding metadata to the FIFO region, the metadata including a next pointer that identifies a memory address for storing the next data unit in the FIFO region, a user space process determines whether to transmit or drop the data unit, the user space process being a single process, and the user space transmits the data unit from the FIFO region without involving the kernel space when the user space process issues a command.

Abstract: A method and an apparatus for selecting one or more applications running in a data processing system to reduce memory usage according to information received from the applications are described. Notifications specifying the information including application specific memory management capabilities may be received from the applications. A status of memory usage indicating lack of available memory may be determined to notify the selected applications. Accordingly, the notified applications may perform operations for application specific memory management to increase available memory.

Abstract: The present invention extends to methods, systems, and computer program products for configuring assurances within distributed messaging systems. A defined set of message log and cursor components are configurably activatable and deactivatable to compose a variety of different capture assurances, transfer assurances, and delivery assurances within a distributed messaging system. A composition of a capture assurance, a transfer assurance, and a delivery assurance can provide an end-to-end assurance for a messaging system. End-to-end assurances can include one of best effort, at-most-once, at-least-once, and exactly once and can include one of: durable or non-durable. Using a defined set of activatable and deactivatable message log and cursor components facilities more efficient transitions between desired assurances. In some embodiments, a composition of a capture assurance, a transfer assurance, and a delivery assurance provides durable exactly-once message delivery.

Abstract: One or more computer-readable media that enable a method of recording object configurations at and after an incident occurs in the object. The present invention captures object configurations surrounding an incident that allows changes to be made in response to the incident to be analyzed. The present invention also may generate an incident classification based on a comparison of the configuration when the incident occurs and after it is resolved.

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: A method and apparatus for managing a transaction in a storage area network is presented. A request is received from an agent process at a management server. The management server provides a ticket relating to the request. The ticket is sent to the agent process. The management server identifies a storage process related to the ticket. The storage process contacts the agent process and receives the information from the agent process.

Abstract: Conditional deferred queuing may be provided. Upon receiving a message, one or more throttle conditions associated with the message may be identified. A lock associated with the throttle condition may be created on the message until the throttle condition is satisfied. Then, the lock on the message may be removed and the message may be delivered.

Abstract: Technologies pertaining to cluster-on-chip computing environments are described herein. More particularly, mechanisms for supporting message passing in such environments are described herein, where cluster-on-chip computing environments do not support hardware cache coherency.

Abstract: A method for providing voice telephony services can include the step of receiving a call via a telephone gateway. The telephone gateway can convey call identifying data to a resource connector. A media port can be responsively established within a media converter that is communicatively linked to the telephone gateway through a port associated with the call. A call description object can be constructed that includes the call identifying data and an identifier for the media port. The call description object can be conveyed to a telephony application server that provides at least one speech service for the call. The telephony application server can initiate at least one programmatic action of a communicatively linked speech engine. The speech engine can convey results of the programmatic action to the media converter through the media port. The media converter can stream speech signals for the call based upon the results.

Abstract: A message flow within a message broker can be identified. The message flow can include nodes and connections. The nodes can include a reflective node, a pre-defined node and a user-defined node. The message broker can be an intermediary computer program code able to translate a message from a first formal messaging protocol to a second formal messaging protocol. The code can be stored within a computer readable medium. The reflective node within the message flow can be selected. The reflective node can be associated with an external resource which can be an executable code. The external resource can be executed which can result in the modifying of the structure of the message flow. The modification can occur during runtime. The modification can include node and/or connection adding, altering, and deleting.

Abstract: The present invention extends to methods, systems, and computer program products for durable exactly once message delivery at scale. A message capture system uses a synchronous capture channel and transactions to provide durable exactly once message capture. Messages are sent from the message capture system to a message delivery system over a network using an at least once transfer protocol. The message delivery system implements a durable at most once messaging behavior, the combination of which results in durable exactly once transfer of messages from the message capture system to the message delivery system. The message delivery system uses a synchronous delivery channel and transactions to provide durable exactly once message delivery. Cursors maintaining message consumer state are collocated with message consumers, freeing up message log resources to process increased volumes of messages, such as, for example, in a queued or pub/sub environment.

Abstract: A computer implemented method invokes a business application in response to receipt of a request Simple Object Access Protocol (SOAP) message. The request SOAP message requests an operation that is defined in a Web Services Description Language (WSDL) service. To implement the operations defined in the WSDL service, the WSDL service is provided as input to a tool that generates a business application which corresponds to the supplied WSDL service. The SOAP BODY from the request SOAP message is converted into an unformatted data structure for inputting to the business application, while information from the SOAP HEADER is retained in order to generate a reply SOAP message that contains execution results.

Abstract: An approach for reducing transport of messages between nodes of a multi-node system is presented wherein a message queue is associated with a queue service, and based on which node the message queue resides, one of the nodes is registered as hosting the associated queue service. In response to a client attempting to connect and requesting a particular queue service, the client is caused to connect to the node on which the queue service resides.

Abstract: A method, system and a computer-readable media for automatically detecting that a malfunction affecting message withdrawal from a queue is present is described. In one embodiment, the malfunction is detected by evaluating the number of messages that enter and leave a queue during a period of time. For example, if the messages entering the queue do not equal the messages leaving the queue a malfunction may be present. In one embodiment, queue-performance indicator is calculated based on the number of messages leaving and entering the queue. If the queue-performance indicator is outside of the normal-operating range an alarm is generated and sent to a designated responder who can fix malfunctions associated with the queue.

Abstract: Various embodiments of the present invention transform devices into Web services or special-purpose servers that are capable of communicating with personal computers. Various embodiments of the present invention allow various low-level aspects of device drivers to reside in the devices, eliminating the need for the devices to be compatible with legacy specification. Various embodiments of the present invention allow various devices to be shipped from the factory with low-level software already built in so that users are liberated from having to deal with the experience of installing and upgrading device drivers. In various embodiments of the present invention, each device is preferably a network node identifiable by a Uniform Resource Identifier (URI).

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, system, and medium are provided for re-routing messages from a particular parallel queue instance that is experiencing below normal message throughput by lowering the priority setting of the particular queue instance. The messages are re-routed to the other parallel queue instances by a load balancing algorithm that transfers messages to queue instances having a higher priority setting. A series of determinations are made, prior to lowering the priority setting, to confirm that lowering the priority setting for the queue instance is the preferred response to the decreased throughput for the queue instance.

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: A system for communications in a distributed computing environment is provided that includes an application layer (132), a proxy layer (134), a reference layer (136), and an object layer (138). The application layer (132) provides communications between an application (108) and an operating entity. The proxy layer (134) provides communications between the application (108) and a remote proxy (154). The remote proxy (154) is a local representative for a requested object (110) residing in an address space different from an address space in which the application (108) resides. The reference layer (136) provides communications between the remote proxy (154) and the requested object (110). The reference layer (136) includes communication protocol details to support transmission of messages across a network (106) linking the remote proxy (154) and the requested object (110). The object layer (138) includes the requested object (110).