Abstract: A system and method for providing a message service agent with pluggable functionality acts while a message is being transmitted by the message bus program to examine the content of the message. Once the content of the message has been examined, the message service agent program can: a) further direct the message based on criteria found during the examination of the message content for any additional information relevant to determining other receipt points for the message; b) alter the content of the message (add, remove or change); c) edit the message and change its destination; or d) manipulate the message in some other way. According to the present invention, messages are received by a program message bus and then sent to a “cloud.

Abstract: A novel apparatus and method for analyzing and displaying the operation of a computer is provided, that can display a timing chart with which the relationship between transmission processes and reception processes, each relating to inter-process communications, can be easily grasped. The apparatus includes a measuring device for measuring and collecting as chronological event trace data a software event occurring within a computer to be measured, an analyzer for analyzing the operation of the computer based on the event trace data collected by the measuring device, and a display for manifesting the operation of the computer analyzed by the analyzer.

Abstract: An efficient method for performing state based ingress packet selection for a packet processing system in a network processor is disclosed. With this method, each set of message classes is associated with a state of an application, and each set of message classes is assigned to a semaphore. The application blocks one of the semaphores based on its current state. When a message is received, and the message belongs to a class assigned to the blocked semaphore, the blocked semaphore is signaled. The blocked semaphore then wakes the application. In this manner, when the application is awakened, it is guaranteed to find a message that it is interested in processing in its current state, resulting in greater efficiency in the processing of ingress messages.

Abstract: A method of optimizing propagation of non-persistent messages from a source database management system (DBMS) to a destination database management system (DBMS) is described and provided. The method comprises receiving one or more non-persistent messages from a source non-persistent message queue of the source DBMS at a destination non-persistent message queue of the destination DBMS. The non-persistent messages are consumed from the destination non-persistent message queue such that consumed non-persistent messages are removed from the destination non-persistent message queue.

Abstract: A system accesses, from a first computer program written in a first computer language, functionality available through a second computer program written in a second computer language. The system has an interface intermediate the first and second programs for enabling access between the first program and the second program. The interface includes (a) a first handler in the second computer language for receiving messages from the functionality and (b) a second handler for retrieving messages, via the interface, that the first handler receives. The second handler is part of the first program.

Abstract: A computer program product and system for deleting objects used or managed by an application or application instance is disclosed. First program instructions identify the objects. Second program instructions write an executable program to delete the objects which were identified. There are wide variety of objects than can be deleted such as local queues, alias queues, remote queues, security objects, channel objects, process objects, etc. The first program instructions identify a queue object and determine whether the queue object contains a work item. If so, the second program instructions write into the executable program a command to clear the work item. A computer program product, system and method for deleting a queue object managed by an application or application instance is also disclosed. Channels used by other applications or other application instances to lock and access a queue defined by the queue object are identified. Then, the channels are stopped.

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

Abstract: A technique for communication between a first computer and a second computer, each of which is connected to a server computer. Under control of a first application at the first computer, a message is created, wherein the message comprises zero or more text and zero or more content identifiers, and the message is put into a message queue. Under control of a second application at the second computer, the message is retrieved from the message queue.

Abstract: Method, apparatus and article of manufacture for continuous modes for both asynchronous accepts and asynchronous receives. A single asynchronous accept is performed on a listening socket and a single asynchronous receive is performed on each connected socket. The continuous mode inputs result in queuing data structures on a pending queue. The contents of the pending data structures on the pending queue are copied to completion queues, while the pending data structures remain on the pending queue.

Abstract: An interprocess communication method for transporting messages from an originating place to a terminating place comprises the steps of: providing an operating system-unified interface function, at an operating system independent access (OIA) layer, which is independently accessible to operating systems of a communication apparatus; providing a device-unified interface function, at a device independent access (DIA) layer, which is independently accessible to physical devices of the communication apparatus; and transporting messages, at a unified interprocess communication (UIPC) layer, from the originating place to the terminating place through at least one of the operating system independent access layer and the device independent access layer using information about the terminating place that is provided by a terminating place task, and using a common task architecture based on the task's basic common control flow.

Abstract: In order to provide flexibility for a developer, a network API is provided which allows for a network event (for example, the receipt of data over the network) to be handled by one thread from among a predetermined number of dedicated threads. The number of dedicated threads is specified by the application at runtime and can be modified at runtime as well. Where the number of dedicated threads specified is greater than zero, dedicated threads are created which handle network events and call the specific callback functions of the application in response to the network events. Thus the number of such callback events from threads that can occur at one time is limited by the number of dedicated threads specified by the application. When the number of dedicated threads is specified as zero, no callback events can occur except when the application assigns a certain time period for them.

Abstract: Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabling new synchronization protocols for the parallel discrete event simulation. Two of such protocols, LB-GVT (LookBack-Global Virtual Time) and LB-EIT (LookBack-Earliest Input Time), are presented and their performances on the Closed Queuing Network (CQN) simulation are compared with each other. Lookback can be used to reduce the rollback frequency in optimistic simulations. The relation between lookahead and lookback is also discussed in detail. Finally, it is shown that lookback allows conservative simulations to circumvent the speedup limit imposed by the critical path.

Abstract: Representative embodiments are disclosed of a system and method for linearly exposing client-server interaction comprising interpreting a function command representing a first group of sequential action requests to an integrated multimedia communication server (iMCS), sequentially transmitting the first group of sequential action requests from an interactive multimedia runtime (iMR) client to the iMCS, wherein a next sequential action request of the first group is transmitted to the iMCS prior to receiving a response message from the iMCS associated with a previous sequential action request of the first group, queuing response messages received from the iMCS, and handling the queued response messages.

Abstract: A buffer ring is utilized to track and control the distribution of information. Index variables that refer to storage locations or slots in the buffer ring are utilized to track the receipt and distribution of information. The variables initially point to the same slot. As information is received a status indicator associated the slot is checked and if the location is free either the product information elements or addresses of where the product information are entered in the slots. They are tracked by a producer variable that is incremented to indicate the next available slot. Slots between the consumer variable and the producer variable define a segment of the buffer associated with a particular thread. The information is forwarded to a thread based upon the variables. As product information elements are forwarded control of the buffer ring is obtained and the variables determine a buffer segment that is forwarded.

Abstract: A system and method provides communications to processes, handles transmissions of communications received from processes, and allows other manipulations of transmissions upon request by processes without an operating system call.

Abstract: A method and computer program product is provided for sending a persistent message in a transaction-enabled messaging and queuing system. A message queue manager is responsible for transferring messages from a sender program to a receiving program via a message queue. A message is sent from the sender program to the message queue manager. The message is defined to permit the message queue manager to select whether to treat the message transactionally or non-transactionally.

Abstract: A rate-based scheduling system and method are disclosed. The rate-based system generally includes a first scheduler operable to limit the maximum rates at each of the plurality of queues. The first scheduler is configured as a work conserving scheduler shaped at an aggregate rate of active queues of the plurality of queues. The system further includes a second scheduler operable to provide a minimum rate to each of the plurality of queues and a rate controller configured to modulate the rate of at least one of the first and second schedulers.

Abstract: A web server system is provided which includes a web garden made up of a plurality of instances of a user-mode web application. The web server includes a kernel-mode listener service that is configured to receive web requests and selectively provide the TCP/IP connections to selected instances of the user-mode web application. It does this by establishing a plurality of request queues corresponding to the number of instances of the web application logic. The web server also includes a user-mode administrative process that is configured to selectively start each of the instances of the web application and maintain the size of the resulting web garden, for example, based on a defined maximum web garden size parameter.

Abstract: A wireless Internet gateway bridges wireless devices to the Internet, e.g., via a short message service center (SMSC). The gateway provides a portal to SMPP, HTTP, TNPP, or other protocol messages using Java Remote Method Invocation (RMI) techniques. Application servers insert RMI objects containing messages in a message queue handler of the gateway. The RMI objects are queued and passed either directly to a destination delivery handler (e.g., SMPP, SMTP, HTTP or TNPP protocol handler), or passed through a generic destination interface. An SMTP handler provides direct communication of SMTP protocol messages (i.e., email) to the message queue. An SMPP link proxy module provides direct access between a local application server and the destination delivery handler. The messages are packaged into relevant messages of the particular destination protocol (e.g., SMPP), and transmitted to the relevant network element (e.g., to an SMSC).

Abstract: An application programming interface (API) is described that allows creating or destroying one or more pairs of data structures for asynchronously passing between the operating system and a network application pointers to packet buffers mapped to both parties.

Abstract: A system is provided for terminating processes that are executing on a plurality of distributed computing nodes. The system comprises a batch queuing system configured to receive jobs from a user and to dispatch jobs to the distributed computing nodes. A process shutdown interface is included that is configured to receive task criteria for terminating processes corresponding to the task criteria on the distributed computing nodes. An automatic process shutdown module is in communication with the process shutdown interface. The automatic process shutdown module is configured to retrieve information based on the task criteria from the batch queuing system regarding the processing location of jobs submitted to the batch queuing system. The automatic process shutdown module is also configured to terminate the processes on the computing nodes for jobs that are identified using the information obtained from the batch queuing system.

Abstract: A method for triggering message queue applications, comprising performing a first trigger process, the first trigger process including: a first application evaluating a queue for a trigger message; the first application determining whether a second trigger process is already being performed for the queue; and the first application invoking a second application where the invoking is in response to the trigger message.

Abstract: A call flow server is disclosed that processes call flow events from a plurality of gateways bridging between traditional circuit-switched networks and packet-switched networks. The call flow server server, which may be implemented with either a single processor or multi-processor design, includes call flow engine and call flow thread manager modules capable of managing a plurality of call flow events by distributing the call flow scripts associated with such events among a plurality of threads executing on the call flow server. Each call flow event in the form of a call flow script is processed on a single thread within a selected processor. Processing each call flow script on a single thread fully utilizes the processor resources and ensures that a call flow script need not be blocked while another call flow script is running. The call flow server includes a thread manager to direct a given call flow script to a thread that has excess capacity.

Abstract: A system and process for ensuring the smooth flow of electronic ink is described. Dynamic rendering is give priority over other event handlers. Priority may be the use of one or more queues to order when events occur and may be performing dynamic rendering prior to other steps.

Abstract: TICC manages asynchronous communications among groups of concurrent (parallel) processes (Objects) in multiprocessors. It dedicates one processor to function as Communications Processor, C. TICC defines a Causal Communication programming Language, called CCL, whose statements may appear intermixed with statements of any conventional programming language. TICC defines methods for compiling CCL statements in these mixed language programs into sequences of protocols which are executed by C, in parallel with on going computations guaranteeing (1) group-to-group loss less, buffer less, self-synchronizing asynchronous data transfers; (2) more than a hundred fold reduction in communication latencies; (3) Dynamic Flexibility to monitor, repair, reconfigure and update software objects without service interruption; and (4) protection and security of all data, distributed to or collected from communicating objects, based on an Agreement Protocol.

Abstract: A system and method for using a management interface such as Portable Management Interface (PMI) in a thread-safe and efficient manner. A secondary scheduler receives PMI management requests from multi-threaded manager applications in a thread-safe manner, such as through a lock. The secondary scheduler monitors the flow of PMI-related requests into PMI to ensure that, at any point in time, only one management request (e.g., callback function) is running on the PMI thread. When a request in the secondary queue is ready for scheduling with the primary scheduler, the secondary scheduler then accesses the primary scheduler in a thread-safe manner, such as through a lock, to send the request to the primary scheduler. The management requests are dispatched from the primary scheduler and executed on managed objects though a Management Information Server.

Abstract: A method or apparatus for transferring packets, which enables fast lines to be housed for a high load service that requires many calculations in an edge node in a communication network, in which data flows are concentrated. Information obtained from an input packet is held in a table entry in the apparatus and whether to perform such a processing as encryption, etc. is decided according to the state of the source or destination of the input packet or the internal state of the apparatus, thereby performing such a processing as encryption only for necessary packets and reducing the number of calculations.

Abstract: A system and a method for changing the communication means used for communication between two software agents. Each software agent has a communication module, which gives the software agents access to the communication means. In addition, the software agents have means for receiving a new communication module from the communication server.

Abstract: A multithreaded testbench configured to verify a device under test defined by hardware description language logic can include a test case for the testbench executing within a master thread and a generator executing within a sub-thread thread of the master thread. The generator can be configured to create test vectors to be provided to the device under test. The testbench further can include one or more additional modules executing within additional sub-thread(s) of the master thread and a command queue. The additional module(s) can interact with the device under test. The command queue can be configured to store a plurality of commands registered by the master thread. The generator can obtain individual ones of the plurality of commands from the command queue for execution.

Abstract: A method for executing operations upon a linked data structure having at least one element such that the time during which the linked data structure is locked is reduced. The method includes performing a first set of operation tasks in a first phase, the first set of operation tasks being operable to effect a first set of element state transitions. A second set of operation tasks is developed in the first phase, the second set of operation tasks being operable to effect a second set of element state transitions, the second set of element state transitions being distinct from the first set of element state transitions. The second set of operation tasks is performed in a second phase. The method finds particular implementation in the rebalancing of tree data structures.

Abstract: A system and method facilitate substantially secure communication of messages in an architecture that allows a user-level application or process direct access to hardware, such as may include a storage device. A process directly provides to a storage device a message having address information and validation data associated with its destination. Prior to sending the message from the storage device, the stored message is validated based on its validation data and other validation information that has been associated with the storage device. The validation information is not available to the user-level process sending the message. The message may be sent from the storage device provided that its validation data is proper.

Abstract: A method for administration in an object-oriented data processing environment is provided, for use in a distributed messaging system comprising a local computer system, a remote computer system having a remote queue object to be administered and a network. A query object is sent to the remote queue object in order to obtain a first copy of the remote queue object. Once the first copy is received, a second copy of the remote queue object is made at the local computer system and an administrator uses this second copy to make one or more updates. The updates and the first copy are then sent to the remote queue object. The remote queue object in its current state is compared to the first copy, in order to determine whether they match. If a match occurs, the administrator's updates are processed and the remote queue object is replaced with the updated version.

Abstract: A communication system. One embodiment includes at least two functional blocks, wherein an first functional block communicates with a second functional block by establishing a connection. A connection is a logical state in which data may pass between the first functional block and the second functional block. One embodiment includes a bus coupled to each of the functional blocks and configured to carry a plurality of signals. The plurality of signals includes a thread identifier that indicates a transaction stream that the data transfer is part of and a busy signal identified by the thread identifier. The busy signal is issued by the target functional block when resources will be unavailable to perform a transfer.

Abstract: A system and method facilitate communication of data depending on whether communicating elements are properly associated with each other. An endpoint communication context is associated with a queue component, which queue component may communicate directly with a process. Each of the queue component and the endpoint communication context is associated with a domain in a privileged operation (e.g., by the operating system). The queue component may communicate with the endpoint communication context provided that the queue component and communication context have a valid association, such that their respective domains match.

Abstract: One embodiment of the present invention provides a system that facilitates inter-processor communication and synchronization through a hardware message buffer, which includes a plurality of physical channels that are structured as queues for communicating between processors in a multiprocessor system. The system operates by receiving an instruction to perform a data transfer operation through the hardware message buffer, wherein the instruction specifies a virtual channel to which the data transfer operation is directed. Next, the system translates the virtual channel into a physical channel, and then performs the data transfer operation on the physical channel within the hardware message buffer. In one embodiment of the present invention, if the data transfer operation is a store operation and the physical channel is already full, the system returns status information indicating that the physical channel is too full to perform the store operation.

Abstract: Methods and apparatus providing, controlling and managing a dynamically sized, highly scalable and available server farm are disclosed. A Virtual Server Farm (VSF) is created out of a wide scale computing fabric (“Computing Grid”) which is physically constructed once and then logically divided up into VSFs for various organizations on demand. Each organization retains independent administrative control of a VSF. A VSF is dynamically firewalled within the Computing Grid. Allocation and control of the elements in the VSF is performed by a control plane connected to all computing, networking, and storage elements in the computing grid through special control ports. The internal topology of each VSF is under control of the control plane. A request queue architecture is also provided for processing work requests that allows selected requests to be blocked until required human intervention is satisfied.

Abstract: In a data processing system, the flow of messages specifying the states of various processes in the system, is regulated using a first register which maintains a list of the current states of each process, and a queue. Whenever a process state message relating to a particular process arrives, the new state of that process is written into the current state register, and an item is placed in a queue. The item indicates the identity of the process concerned. When the item reaches the front of the queue, the current state of the process it identifies is read from the current state register and used to generate an output message. Flags can be used to reduce the redundancy of items in the queue and limit its size. The queue can be modified to cope with messages of differing priorities. To reduce memory requirements, the processes may be grouped into sets, so that each queue item relates to a set of processes.

Abstract: A Web-based management system operating method automates collection and analysis of information from a plurality of networked devices, as well as creation of metrics, and independently assembles and displays data related to the networked device information on a distributed network. The networked devices may include one or more copiers, printers, facsimile machines and multifunction devices. Internal and external data is gathered from the networked devices. At least one of graphical, textual, statistical, metrics and status data is generated using a network database concurrently. This data is assembled and presented to a user on demand as one or more Web pages.

Abstract: A method and system for reducing memory accesses by inserting qualifiers in control blocks. In one embodiment, a system comprises a processor configured to process frames of data. The processor may comprise a plurality of buffers configured to store frames of data where each frame of data may be associated with a frame control block. Each frame control block associated with a frame of data may be associated with one or more buffer control blocks. Each control block, e.g., frame control block, buffer control block, may comprise one or more qualifier fields that comprise information unrelated to the current control block. Instead, qualifiers may comprise information related to an another control block. The last frame control block in a queue as well as the last buffer control block associated with a frame control block may comprise fields with no information thereby reducing memory accesses to access information in those fields.

Abstract: A distributed computing environment and associated method for monitoring a queue-based messaging system. The queue-based messaging system controls the exchange of messages between a server process and client process applications. A messaging application residing at the server computer platform and forming part of the queue-based messaging system manages a plurality of trigger-initiated local queues, each associated with one of the plurality of client process applications and having queue depth, trigger enable, get enable and put enable attributes. A monitoring tool residing on the server computer platform acquires a value for the queue depth, trigger enable, put enable and get enable attributes for a plurality of trigger-initiated local queues and generally simultaneously displays, on a user interface coupled to the server computer platform, the value for the queue depth, trigger enable, put enable and get enable attributes for each one of the plurality of trigger-initiated local queues.

Abstract: A system and computer program product for backing up a program and a plurality of user instances of the program. First program instructions backup definitions of queues used by the program instances. Second program instructions backup authorizations for the queues. Third program instructions backup a plurality of program-instance configuration files for the plurality of program instances, respectively. Fourth program instructions backup a configuration file for the program. Also disclosed is a method and program product for backing up a user program instance which has locked a queue definition file containing definitions of queues and authorizations for accessing the queues, and which has not locked a configuration file identifying the user program instance. A backup program queries the user program instance for the definitions of the queues and the authorizations for the queues such that the user program instance retains the lock on the queue definition file.

Abstract: User interfaces for a number of services offered by an information distribution system. In one method, first (e.g., interactive program guide) and second (e.g., video-on-demand) applications are provided to support a first and second user interfaces for first and second services, respectively. A control mechanism coordinates the passing of control between the applications. A root application supports communication between the first and second applications and a hardware layer. The control mechanism may be implemented with first and second message queues maintained for the first and second applications, respectively. Control may be passed to an application via a (launch) message provided to the associated message queue. Each application is operable in an active or inactive state. Only one application is typically active at any given moment, and this application processes key inputs at the terminal. The transition between the active and inactive states may be based on occurrence of events.

Abstract: A communication system for issuing commands from an initiator to a target, thereby allowing the target to write or read out data into/from a memory area which the initiator has and exchanging the data. The initiator transmits read and write commands for the memory area to the target so as not to exceed the total number of commands which can be held by the target. The target holds the received read and write commands, holds references to the commands by different queues, and independently processes the commands, so that the number of the commands to be transmitted can be managed efficiently.

Abstract: A network station subsystem architecture that uses a simplified interface reference discovery method and system is provided. In one embodiment a method for managing client-server communications is disclosed that includes providing a server with functions and interface methods; providing a client with references to the interface methods; and processing client requests by invoking the interface methods on the server via the references. Ideally, the interface methods are implemented by providing the server with a table of pointers to the functions, and providing the client with references to the table of pointers, ideally at the time of design. In another embodiment, a system for managing communications in a network station for a data-over-cable network having a plurality of network stations is provided.

Abstract: A highly available, high-performance memory queue. Locking of the queue is minimized in order to provide a highly available queue and to improve performance of the queue. Multiple updates of the queue can occur under a single lock. Further, messages of the queue are persistent. A time-initiated checkpointing process, as well as the storing of message information on a recovery log, ensures the persistence of the queue messages.

Abstract: The present invention comprises a scheduling assist function (scheduling assist) that enables a processor to schedule events and be notified when these events expire. In addition, the present invention includes features that enable a processor to associate these events with output channels and enable the processor to quickly locate output channels (links) that are available and ready to be serviced. The invention takes advantage of the fact that the scheduling assist can be dedicated exclusively to scanning tables in its own dedicated memories looking for events that have expired and/or output channels that are available and not involve the processor in the search for output channels that are available and ready to be serviced.

Abstract: A computer implemented method for monitoring up-stream and down-stream software applications in a message queuing transmission system. The transmission system comprises at least one processing task that is able to read a plurality of incoming messages from at least one input queue and to write a plurality of outgoing messages into at least one output queue. The method allows for determining the number of messages in each of the input queues and the number of messages in each of the output queues, for determining the activation status of the processing task, and for gathering the results to display on a task monitor screen. The depth and status information are regularly refreshed.

Abstract: A method and system for passing messages between threads is provided, in which a sending thread communicates with a receiving thread by passing a reference to the message to a message queue associated with the receiving thread. The reference may be passed without explicitly invoking the inter-process or inter-thread message passing services of the computer's operating system. The sending thread may also have a message queue associated with it, and the sending thread's queue may include a reference to the receiving thread's queue. The sending thread can use this reference to pass messages to the receiving thread's queue.

Abstract: A program that includes expressions written in a process-based language for representing protocol-based applications as processes is disclosed. A process kernel executes the expressions in the program. The process kernel parses an expression to obtain syntactical elements that represent a queue, a set of queue delimiters, a query, a sequence delimiter, and other actions. The process kernel further translates the expression as a process whose first action is submitting the query as another process to the queue and after which the process continues with other actions. The query includes an organization scheme formed from a customizable, tag-based language that contains data and describes data.

Abstract: A method of communication between a first object and a second object is disclosed. A first method call is made on an intermediary object from the first object. The first direct method call contains information regarding a location in memory of the intermediary object instead of a location in memory of the second object and a name of the method to be called on the second object. The name of the method to be called on the second object is delivered from the intermediary object to a message queue object. The name of the method to be called on the second object is accessed from the message queue object by the second object.