Abstract: Systems and methods are described for providing queue pair numbers for a queue pair to more effectively track and manage the frequency of use and re-use of queue pair numbers on a queue pair context basis in an InfiniBand™ device. The present invention uses a counter for each queue pair context to set the changeable portion of the queue pair number. A reference count for each queue pair context is also used to track the quantity of queue pair numbers currently allocated to a queue pair context. The present invention sets, tracks and manages the values of the counter and the reference count for each queue pair context in conjunction with queue pair operations to provide a systematic queue pair numbering scheme. By tracking and/or setting values of the counter and reference count for a queue pair context, the present invention re-uses queue pair numbers efficiently and in a predictable and repeatable manner.

Abstract: Among other things, processing an incoming message stream includes storing context data of an application in a global database. Various messages from the incoming message stream are placed in an in-memory message queue. One of at least a first and a second phases at a first process is executed, and another of the at least first and second phases at a second process is also executed, so as to alternately execute a first phase and a second phase by a first process and a second process. The first phase includes processing at least one message from the various messages and storing at least one corresponding result in a local memory area. The first phase also includes storing al least one modification to the context data in the local memory area. The second phase includes performing a transaction of the at least one result and the at least one modification of the context data to the global database and committing the transaction.

Abstract: The present invention enables “unit-of-order”, which allows a message producer to group messages into a single unit. It guarantees that messages are not only delivered to consumers in order, they are also are processed in order. The unit-of-order will be delivered to consumers as one unit and only one consumer will process messages from the unit at a time. The processing of a single message is complete when it is acknowledged, committed, recovered, or rolled back. Until message processing for a message is complete, the remaining unprocessed messages for that unit-of-order are blocked.

Abstract: Disclosed is a method for administering messages. In response to a determination that one or more consuming applications have failed to process the same message on a queue a predetermined number of times, the message is made unavailable to consuming applications. Responsive to determining that a predetermined number of messages have been made unavailable to consuming applications, one or more consuming applications are prevented from consuming messages from the queue.

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: Systems and methods are disclosed to perform messaging among a plurality of mobile nodes by performing one disk seek to store a predetermined short message; and performing two disk seeks to read and delete the predetermined short message.

Abstract: This invention provides methods, systems and apparatus for processing a message of a large number of agents. An example of an apparatus includes: a memory; means for managing a state of an agent based on whether the agent is in the memory and whether there is a message, by determining a priority level of the agent based on a message inserted into the agent; means for assigning a thread to the agent if the agent is in the memory and for assigning a thread to the agent after calling the agent to the memory if the agent is not in the memory, on condition that the agent having a highest priority level has been detected; and message processing means for repeating message processing until a predetermined criterion is satisfied, in relation to the agent to which a thread has been assigned.

Abstract: In a method or system for implementation of a transfer of data between two program elements of a process, a buffer object is provided between and linking two program elements. The buffer object comprises a buffer and control methods. A control method of a buffer object informs one of the linked program elements when the buffer is full or empty, the one link program element beginning with a reading of the data from the buffer or with a writing of the data into the buffer. The two linked program elements comprise one of the program elements writing the data into the buffer and the other program element reading data from the buffer, the program element writing the data driving the data transfer such that via the writing of the data into the buffer it causes the buffer object, via an informing of the program element reading the data, to call this program element and thereby trigger the reading of the data from the buffer.

Abstract: A server system in typical operation has a process manager, multiple listeners (each to receive requests for its protocols) and multiple worker processes that are each able to handle requests in multiple protocols. At server start-up, each listener connects with the process manager via a pipe published by the process manager. The listener then receives information via the process manager that includes information defining the application(s) for which that listener is to “listen” and associating application(s) to application pool(s). When the listener receives a request for such an application, the listener starts a queue for the associated application pool. The listener may use a hierarchical matching scheme to determine the associated application or application pool from the requested application. The process manager launches an appropriate worker process to handle requests in the listener's protocol. The worker process then makes a connection with the listener.

Abstract: A server system has a process manager, listeners and worker processes in which the listeners connect to worker processes. At server start-up, each listener connects with the process manager via a pipe published by the process manager. The process manager then provides information to each listener associating applications to application pools, and applications for which the listener is to “listen”. When the listener receives a request for which it is to listen, the listener starts a queue for the application or associated application pool. The process manager launches an appropriate worker process to handle requests in the listener's protocol. The worker process then makes a connection with the listener.

Abstract: A server system in typical operation has a process manager, multiple listeners (each to receive requests for its protocols) and multiple worker processes that are each able to handle requests in multiple protocols. At server start-up, each listener connects with the process manager via a pipe published by the process manager. The listener then receives information via the process manager that includes information defining the applications(s) for which that listener is to “listen” and associating selected application(s) to application pool(s). When the listener detects a request for such an application, the listener starts a queue for the associated application pool. In response, the process manager launches an appropriate worker process to handle requests in the listener's protocol. The worker process then makes a connection with the listener.

Abstract: A system for communication between a mainframe environment and a Java environment. The system can consist of a mainframe messaging system resident in the mainframe environment having an outbound and an inbound queue, a Java messaging system resident in the Java environment having an outbound and an inbound queue, and an intermediate messaging system coupled to the outbound and inbound queues of the mainframe messaging system and coupled to the outbound and inbound queues of the Java messaging system. The Java environment may be a J2EE environment. The mainframe messaging system may be an MQSeries messaging system and the Java messaging system may be a JMS messaging system. The outbound queue of the mainframe messaging system may communicate only messages directed to the Java environment and the inbound queue of the mainframe messaging system may communicate only messages directed from the Java environment.

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

Abstract: An apparatus and method for communicating with a network adapter using a queue data structure are provided. With the apparatus and method, a device driver invokes device driver services for initializing address translation and protection table (ATPT) entries in a root complex for the queue data structure. The device driver services return untranslated addresses to the device driver which are in turn provided to the network adapter. In response to retrieving a queue element from the queue data structure, the network adapter may request a translation of an untranslated address specified in the queue element and store the translated address in the network adapter prior to receiving a data packet targeting a buffer associated with the queue element.

Abstract: A method comprises estimating a performance of a processing system using queueing theory wherein the processing system comprises a network that accepts at least one input message stream from a plurality of publishing clients, transforms the at least one input message stream into at least one output message stream utilizing the plurality of transforms distributed in a first assignment among the plurality of brokers, and delivers the at least one output message stream to at least one of the plurality of subscribing clients, performing optimization upon the assignment of the plurality of transforms using the estimated performance to produce a second assignment, and reassigning the plurality of transforms in accordance with the second assignment.

Abstract: The disclosed embodiments relate to a method and apparatus for providing notification. The apparatus may comprise a plurality of completion queue handlers associated with a communication device. Each of the plurality of completion queue handlers may be associated with a plurality of processes. At least one completion queue may be associated with at least one of the plurality of completion queue handlers.

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

Abstract: A system and method for improving the efficiency with which data communications are passed through a protocol stack. Protocol layer modules within a protocol stack built upon the Streams framework are modified to establish tight embraces between adjacent modules. A tight embrace may be established by passing from one, upper, protocol layer module to its adjacent lower protocol layer module a pointer or reference to the upper module's functionality (e.g., rput) for reading a data communication into the upper module from the lower module. Similarly, the lower module passes the upper module a pointer or reference to its functionality (e.g., wput) for writing a data communication into the lower module from the upper module. After a tight embrace is established, the protocol layer modules can directly invoke each other's functionality, without incurring the overhead associated with the Streams framework's “canputnext” and “putnext” messages.

Abstract: A method for recording execution information for a software application executable in a computer system, the computer system including a message queue, the method comprising the steps of: generating the execution information by the software application; and recording the execution information to the message queue for subsequent retrieval, wherein the message queue is accessible by the software application and persistent with respect to the software application.

Abstract: A system and method for collective send operations on a system area network are provided. The mechanisms of the illustrative embodiments provide for the creation, modification, and removal of collective send queues (CSQs) that allow the upper level protocol (ULP) used by a consumer to send the same message to a collective set of queue pairs (QPs). In order to use the transport services of a CSQ, a consumer process posts a write work request (WR) to the CSQ. The write WR causes a write work queue element (WQE) to be generated and placed in the CSQ. A channel interface (CI) is provided that effectively copies the write WQE to all of the send queues (SQs) of the QPs in the QP set associated with the CSQ. When all the QPs complete processing of their respective write WQEs, the HCA releases all data segments referenced by the write WR.

Abstract: A multiprocessor system (206) having a plurality of processors (304-306), each processor capable of processing at least one queue (404A-404N) of at least one service application, and at least one task (402A-402N) comprising at least one of the at least one queue; and wherein a first processor and a second processor of the plurality of processors is each programmed to delegate (602) a service application from the first processor to a queue of the at least one queue of the second processor, evaluate (604-606) the queue at the second processor according to flow control criteria, process (608) the service application at the second processor upon satisfying the flow control criteria, and reject (610) the service application at the second processor upon failing to satisfy the flow control criteria.

Abstract: The present invention relates to an apparatus and computer program for workload balancing in an asynchronous messaging system. The number of server instances, which process work items from a queue of messages, is controlled based upon that queue's average queue depth and one or more predetermined thresholds.

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 task queue manager manages the task queues corresponding to virtual devices. When a virtual device function is requested, the task queue manager determines whether an SPU is currently assigned to the virtual device task. If an SPU is already assigned, the request is queued in a task queue being read by the SPU. If an SPU has not been assigned, the task queue manager assigns one of the SPUs to the task queue. The queue manager assigns the task based upon which SPU is least busy as well as whether one of the SPUs recently performed the virtual device function. If an SPU recently performed the virtual device function, it is more likely that the code used to perform the function is still in the SPU's local memory and will not have to be retrieved from shared common memory using DMA operations.

Abstract: A time-based buffering system buffers data based upon how long the data should be held in order to comply with a traffic shaping policy. The data's source or destination need not be considered in determining where to buffer the data. The time-based buffering system includes a collection of time-based queues, each of which has a different time to dequeue. The system controlling traffic shaping determines how long a particular piece of data should be buffered (a “traffic shaping delay”) until it can be put on the network. Then, based upon that length of time, the system chooses one of the time-based of queues in which to buffer the data. That chosen queue has a dequeuing time that matches the traffic shaping delay. After the chosen queue dequeues its contents (at the specified time), it assumes a new dequeing time and is free to buffer new data that must be delayed by a time matching the new dequeuing time.

Abstract: Method, apparatus and system embodiments provide a register to track the oldest exception event or sticky event in a processor. The processor may be an out-of-order processor. Dispatched instructions (or micro-ops) may be maintained in a queue, such as a reorder buffer (ROB), for in-order retirement. For at least one embodiment, event information is maintained only in the register and is not maintained in a ROB. For at least one other embodiment, event information is maintained in a ROB entry for some events and in the register for others. For such latter embodiment, a retire engine takes the contents of both the ROB entry and the register into account when determining whether to take an exception or otherwise initiate a handling sequence during in-order instruction retirement. Other embodiments are also described and claimed.

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: An apparatus, system, and method are disclosed for autonomically managing multiple queues in a data processing system. A receiver module receives a message that specifies a computing task. A time stamp module appends a time stamp recording a time the message is received to the message. An assignment module assigns the message to a local queue if the local queue has less than a specified threshold number of messages else assign the message to a global queue. A processor module processes a specified initial number of next messages from the local queue and process a next message from the local queue if a time stamp of the local queue next message is less than a time stamp of a last message processed from the global queue else processes the next message from the global queue.

Abstract: A palmtop computer system that incorporates mechanical buttons that combine the task of turning the palmtop computer system on and starting a particular application program. Furthermore, the same mechanical button can be used to navigate the application program to find the information that is most likely needed by the user. Additionally, external devices can be coupled to the palmtop computer system in a manner that allows the external hardware device to initiate specific application programs that cooperate with the external hardware device.

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: The present invention provides a system for minimally reducing the additional development correction request of which various and diverse systems are required, in the integration platform for the ubiquitous environment construction, and for supporting the diversity of the ubiquitous computing environment which minimally reduces the burden in which developers are additionally on duty for the interface development between the subsystems for an interaction.

Abstract: A system and method that provides a cross-platform queue viewer for use in a distributed processing system comprising a plurality of operational platforms that cooperate to perform various functions and tasks. The queues may be, for example, message queues in a distributed operating environment. A web browser is in communication with an application server. The web browser provides the application server with information regarding a query request. The application server communicates this request to one or more message servers. The message server communicates queue information responsive to the query back to the application server. The application server processes this information into a form that is easily understood by the requester.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for alerting one or more computer software application threads waiting to retrieve events from an event port. An alert event generated by a computer software application is received at the event port. A state of the event port is changed to an alert state, if the event port is not already in an alert state, in response to receiving the alert event. One or more of the computer software application threads is notified about the alert state of the event port.

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: A method and apparatus for adding support, to a device, for a new protocol which the device did not previously support is provided. Protocol information, which identifies how to add support for the protocol to the device, is stored. A protocol manager may read the protocol information and perform actions necessary for the new protocol to be supported by the device. For example, the protocol manager may create a listener, a message queue, and a protocol handler for the protocol based on the protocol information. The listener may receive a message, associated with the new protocol, that was sent to the device and store the message in a message queue. The message queue stores the message until the message is retrieved from the message queue by the protocol handler. The protocol handler, after retrieving a message from the message queue, may process the message.

Abstract: Provided are a method, system, and program for managing resources in which a local processor sends remote operation requests to be executed by a remote processor having multiple resources. In the illustrated embodiment, the local processor and the remote processor each have a resource manager, each of which maintains a control set for each resource of the remote processor. Each control set of the remote processor resource manager includes a queue for queuing remote operation requests awaiting execution in connection with the resource associated with the control set. Each control set of the local processor resource manager includes a credit counter which keeps track of permissible outstanding remote operation requests. Each local processor control set credit counter is decremented for each remote operation request for the associated resource sent to the remote processor and is incremented for each acknowledgment received from the remote processor.

Abstract: An intelligent queue may be used to facilitate communication among a set business application programs. In one embodiment, the intelligent queue may interact with a variety of business application programs providing consistent service behaviors across a variety of data store products. The intelligent queue provides extended message storage, efficient journalling, interoperability with other intelligent queues, load balancing, once-only processing, as well as detailed message state information that tracks the status of each message from both the sender and the recipient's perspective.

Abstract: A method for use in a computer system for extending coupling channels through the addition of specific hardware interrupts and controls to allow 1) sharing of receiver resources among multiple Coupling Facility (CF) logical partitions (LPARs), 2) direct CEC to CEC message passing, and 3) CF interrupts.

Abstract: A system for managing changes to identity data is described. A first spoke managing system is described which includes a first database, a first application in communication with the first database, and a first spoke manager in communication with the first application. A first message is generated including a plurality of common data attributes. The first message is sent to a hub managing system. The hub managing system includes a hub manager. The first message including the plurality of common data attributes is received from the first spoke managing system. A plurality of common data attributes are updated. A determination is made if a unique data attribute that uniquely identifies a reference object is being updated. A second message is generated based on the determination. A third message is generated based on the updates of the plurality of common data attributes. The second message and third message are sent.

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

Abstract: Shown is an improved method and system for implementing and building messages, such as HL7-based messages. Messages are constructed in a format-independent manner, in which a message is built by instantiating and linking Java classes. Metadata for the message specifications are used to construct the Java class libraries. Signature of the classes automatically cause the messages to be constructed with correct syntax, structure, and restrictions. Thus, the correctness of the constructed messages can be enforced at compile time. Moreover, a developer can construct a specification-specific message without having to know XML.

Abstract: Provided are a computer program, method and system providing simplified administration of groups of computer programs. Command target qualifiers are defined which enable a command to be targeted at either an individual computer program or all members of a group of computer programs. Additionally, scope parameters are defined which enable a command to be targeted at specific computer system resources managed by the computer programs within the group. The computer system resources which are to be accessible to all members of a group have an associated scope parameter defining shared or group access and are held in shared storage, whereas computer system resources to be accessed by only one computer program in the group have a corresponding scope parameter and are held in the local storage of the individual computer program.

Abstract: Applications to be connected, particularly MES (manufacturing execution system) applications, as well as the communications mechanisms are depicted in the object model of the framework (IF; IF meaning industrial framework) by using wrappers and/or adapters and, as a result, can be manipulated in a uniformly homogenous manner in the framework. The invention is advantageous in that the very heterogeneous structures of the applications are depicted on a common model and can be comfortably and easily used by a user by means of generic mechanisms. That is to say that the effort of programming is eliminated and, as a result, this communication can be easily projected by establishing a so-called connection.

Abstract: An application is built in accordance with a particular application framework. A component is incorporated into the application. When an asynchronous operation is to be performed, the component is configured to issue a standard function call in a manner that is independent of the particular application framework used to build the application. An asynchronous operations manager is configured to detect the particular application framework used to build the application, receive the standard function call, perform the asynchronous operation in accordance with a threading and concurrency model of the application framework, and cause a notification to be issued to the component in a manner that is in accordance with the threading and concurrency model when the asynchronous operation is complete. The asynchronous operations manager may determine the application framework by receiving a notification or function call from the application framework itself.

Abstract: A method of sharing memory between COBOL programs is provided. The method includes maintaining, by a COBOL routine, an index of shared memory addresses, requesting, by a COBOL program, a shared memory block, and receiving to a linkage section of the COBOL program an address of the shared memory block from the COBOL routine. A method of enabling queues for COBOL programs is also provided. The method includes creating a queue using a memory space and providing an operating system having a key related to an address of the memory space. The method provides for maintaining the key in an index and communicating with the operating system to receive the address of the memory space based on the key. The method also provides for resolving the memory space to an operable portion of the COBOL program based on the key from the index.

Abstract: In a priority execution control method in an information processing system, a processing request is stored in either of a priority queue and a normal queue in accordance with the processing priority. A processing request stored in the priority queue is extracted and processed by a priority processor which dedicatedly processes a processing request stored in the priority queue. A processing request stored in the normal queue is extracted and processed by a normal processor which dedicatedly processes a processing request stored in the normal queue. A priority execution control apparatus and computer-readable recording medium are also disclosed.

Abstract: An information handling system having a single pipe string driven data transport architecture includes a hardware independent execution environment subsystem and a native operating system environment subsystem. A data transport pipe is provided for integrating legacy instrumentation agents of the native operating system environment subsystem and new instrumentation agents of the hardware independent execution environment subsystem into a single integrated systems management application.

Abstract: A system and methodology providing typed event and notification services is described. In one embodiment a method for transmitting an event message from a first application to at least one second application over an event channel comprises: generating a message request based on an event at a first application, the message request having a header and a body, the body containing typed event data marshaled for transmission over an event channel; sending the message request to the event channel; in response, reading the header to obtain information about the event without un-marshaling the body; creating a wrapper based, at least in part, on the information obtained from the header; appending the body to the wrapper to create an event message; determining at least one second application to receive the event message; and delivering the event message to the at least one second application.

Abstract: The present invention provides a method and apparatus for handling object requests to an origin server. According to one embodiment, the method comprises storing a selection of objects from an origin server in a memory storage of a caching server associated with said origin server; receiving a request for an object stored in said origin server; determining if said request is serviceable from said selection; serving said request from said selection if it is so serviceable; and if said request is not so serviceable, then determining whether a predetermined number of in-progress object retrievals associated with requests previously forwarded from said cache server to said origin server has been exceeded; forwarding said request to said origin server if said predetermined number has not been exceeded; and retrieving the object associated with said request from said origin server in response to said forwarded request.

Abstract: A message such as an email or a MMS message is receiving from a sender over a communication link that includes a media file, such as a MP3 music file, a podcast, or the like. After receiving the message, a keyword that is independent of a content of the media file is automatically generated, and is automatically stored in a metadata field of the media file. In an embodiment, the generated keyword is selected from a locally stored contact list so as to identify the sender of the message that included the media file, enabling the user to identify who sent that media file originally. In other embodiments, the keyword is generated and stored as metadata of the media file by the sender himself, before the message bearing the media file is sent. Users may use the “sender” metadata field to sort or otherwise organize media files.