5245 results about "Message queue" patented technology

A system for dynamic message routing on a topic between publishing nodes and subscribing nodes includes a plurality of message queues, at least one topic/node table, a subscribing module, a publishing module, and other modules to send messages between one or more publisher and one or more subscribers. These modules are coupled together by a bus in a plurality of nodes and provide for the dynamic message routing on a topic between publishing nodes and subscribing nodes. The message queues store messages at each node for delivery to subscribers local to that node. The topic/node table lists which clients subscribe to which topics, and is used by the other modules to ensure proper distribution of messages. The subscribing module is use to establish a subscription to a topic for that node. The publishing module is used to identify subscribers to a topic and transmit messages to subscribers dynamically. The other modules include various devices to optimize message communication in a publish/subscribe architecture operating on a distributed computing system. The present invention also includes a number of novel methods including: a method for publishing a message on a topic, a method for forwarding a message on a topic, a method for subscribing to messages on a topic, a method for automatically removing subscribers, a method for direct publishing of messages, and methods for optimizing message transmission between nodes.

A graphical user interface (GUI) scheduler program is provided for modeling business workflow processes. The GUI scheduler program includes tools to allow a user to create a schedule for business workflow processes based on a set of rules defined by the GUI scheduler program. The rules facilitate deadlock not occurring within the schedule. The program provides tools for creating and defining message flows between entities. Additionally, the program provides tools that allow a user to define a binding between the schedule and components, such as COM components, script components, message queues and other workflow schedules. The scheduler program allows a user to define actions and group actions into transactions using simple GUI scheduling tools. The schedule can then be converted to executable code in a variety of forms such as XML, C, C+ and C++. The executable code can then be converted or interpreted for running the schedule.

A system and method for managing multiple queues of non-persistent messages in a networked environment are disclosed. A particular embodiment includes: receiving a non-persistent message at a gateway process, the message including information indicative of a named queue; mapping, by use of a data processor, the named queue to a queue node by use of a consistent hash of the named queue; mapping the message to a queue process at the queue node; accessing, by use of the queue process, a list of subscriber gateways; and routing the message to each of the subscriber gateways in the list.

The invention provides a posting/subscribing system for adding message queue models and a working method of the posting/subscribing system. The system comprises a distributed message-oriented middleware server-side cluster, a client-side cluster and a distributed coordinate server cluster. Service nodes in the message-oriented middleware server-side cluster are composed of corresponding modules of an original posting/subscribing system, and the function of the message-oriented middleware server-side cluster is the same as the information transferring relation; a client side is simultaneously provided with a calling interface of a posting/subscribing model and a calling interface of a message queue model which are used for achieving the purpose that a user can select and use the two different message transferring models directly without transforming the bottom layer middleware, so that a coordinate service module and a message processing module are additionally arranged on the client side based on an original framework. The system supports the posting/subscribing message transferring model and the message queue message transferring model simultaneously and guarantees that the availability, flexibility and other performance of the two models are all within the acceptable range, and the problem that it is difficult to transform the bottom layer message transferring model for the user is better solved.

A method for communicating data among processes of a network component is disclosed. A process communication module receives a request from a first process of a network component. The request requests a message buffer operable to store data associated with the first process. A message buffer is allocated to the first process in response to the request, and the data is stored in the message buffer. The message buffer is inserted into a message queue corresponding to a second process of the network component. The second process is provided access to the message buffer to read the data.

Spread spectrum packet-switching radio devices (22) are operated in two or more ad-hoc networks or pico-networks (19, 20, 21) that share frequency-hopping channel and time slots that may collide. The frequency hopping sequences (54) of two or more masters (25) are exchanged using identity codes, permitting the devices to anticipate collision time slots (52). Priorities are assigned to the simultaneously operating piconets (19, 20, 21) during collision slots (52), e.g., as a function of their message queue size or latency, or other factors. Lower priority devices may abstain from transmitting during predicted collision slots (52), and/or a higher priority device may employ enhanced transmission resources during those slots, such as higher error correction levels, or various combinations of abstinence and error correction may be applied. Collisions are avoided or the higher priority piconet (19, 20, 21) is made likely to prevail in a collision.

The present invention envisages a data access, replication or communications system comprising a software application that is distributed across a terminal-side component running on a terminal and a server-side component; in which the terminal-side component and the server-side component (i) together constitute a client to a server and (ii) collaborate by sending messages using a message queuing system over a network Hence, we split (i.e. distribute) the functionality of an application that serves as the client in a client-server configuration into component parts that run on two or more physical devices that commuunicate with each other over a network connection using a message queuing system, such as message oriented middleware. The component parts collectively act as a client in a larger client-server arrangement, with the server being, for example, a mail server. We call this a ‘Distributed Client’ model. A core advantage of the Distributed Client model is that it allows a terminal, such as mobile device with limited processing capacity, power, and connectivity, to enjoy the functionality of full-featured client access to a server environment using minimum resources on the mobile device by distributing some of the functionality normally associated with the client onto the server side, which is not so resource constrained.

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.

Computer system provided with a software architecture for processing transaction data which comprises a platform (5) with at least one logical processing unit (21) comprising the following components: a plurality of gates (G(k)); one or more message queues (MQ(k)), these being memories for temporary storage of data; one or more databases (DB); a hierarchical structure of managers in the form of software modules for the control of the gates (G(j)), the messages queues (MQ(k)), the one or more databases, the at least one logical processing unit (21) and the platform (5), wherein the gates are defined as software modules with the task of communicating with corresponding business components (BC(j)) located outside the platform (5), which are defined as software modules for carrying out a predetermined transformation on a received set of data.

A system and method for providing an actively invalidated client-side network resource cache are disclosed. A particular embodiment includes: a client configured to request, for a client application, data associated with an identifier from a server; the server configured to provide the data associated with the identifier, the data being subject to subsequent change, the server being further configured to establish a queue associated with the identifier at a scalable message queuing system, the scalable message queuing system including a plurality of gateway nodes configured to receive connections from client systems over a network, a plurality of queue nodes containing subscription information about queue subscribers, and a consistent hash table mapping a queue identifier requested on a gateway node to a corresponding queue node for the requested queue identifier; the client being further configured to subscribe to the queue at the scalable message queuing system to receive invalidation information associated with the data; the server being further configured to signal the queue of an invalidation event associated with the data; the scalable message queuing system being configured to convey information indicative of the invalidation event to the client; and the client being further configured to re-request the data associated with the identifier from the server upon receipt of the information indicative of the invalidation event from the scalable message queuing system.

A method, apparatus, and article of manufacture for accessing a database. A hierarchical database system is modeled into an objects framework, wherein the objects framework corresponds to one or more application views, database definitions, and data defined and stored in the hierarchical database system. The objects framework also provides mechanisms for accessing a relational database system, wherein the objects framework provides industry-standard interfaces for attachment to the relational database system. Transactions from an application program for both the hierarchical database system and the relational database system are processed through the objects framework using message queue objects.

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.

The invention discloses a message processing system and processing method based on kafka and belongs to the technical field of message processing. The message processing system and processing method based on kafka are aimed to solve the problems of the prior art that repeated messages appear in an order system frequently, the processing for each message consumes much system resource, the system resource consumption would greatly increase the database visitor volume at the consumer end, the message processing ability is lowered, and the system stability and service effectiveness are lowered. The message processing system based on kafka comprises a message producer cluster composed of one or more message producers, a kafka cluster, and a consumer cluster composed of one or more consumers, the kafka cluster is composed of one or more servers, and the consumer cluster comprises a filter module, a local message queue caching module and a business processing module. The message processing method realized through the system is used for the system especially the order system which needs to process a large number of messages.

A method and apparatus is disclosed for delivering messages that utilizes a message queue and a router/filter within a private data network. The private network is connected to an external data network such as the Internet, and has separate outbound resource servers to provide a high degree of scalability for handling a variety of message types.

A system and method that provides a message engine to facilitate intra-day receiving of first data relative to the trade transaction on behalf of one party to the trade transaction, wherein the first data include a code identifying an opposing party to the transaction; sending a message to the designated opposing party prior to submitting the trade transaction for matching prior to end-of-day clearing; and monitoring a message queue for a response and sending a message to at least one of the parties based on the response.

A system and method are provided for coordinating concurrent processing of a plurality of messages communicated over a network between a source system and a target system. The plurality of messages are configured for including a pair of related messages having a common first unique message identifier and at least one unrelated message having a second unique message identifier different from the first unique identifier. The system and method comprise an input queue for storing the plurality of messages when received and an output message queue for storing the plurality of messages during message processing. The output message queue includes a plurality of execution streams for facilitating concurrent processing of the at least one unrelated message with at least one of the pair of related messages. The system and method also include a sequencer module coupled to the output message queue for determining using the first and second unique identifiers which of the plurality of messages are the pair of related messages and which of the plurality of messages are the at least one unrelated message. The sequencer module is further configured for identifying a sequence order for the pair of related messages according to a respective sequence indicator associated with each of the related messages, such that the sequence indicators are configured for use in assigning a first position in the sequence order for a first message of the pair of related messages and for use in assigning a second position in the sequence order for a second message of the pair of related messages. The system and method also have a registry coupled to the sequencer module and configured for storing a pending message status indicator for the first message in the output message queue, wherein the sequencer module inhibits the progression of processing through the output message queue for the second message until the pending message status for the first message is removed from the registry while facilitating concurrent processing of the at least one unrelated message though the output message queue.

The invention discloses an inter-core communicating method of multi-core processor in embedded real time operation system. It includes following steps: distributing memory as multi-core information sharing pool; writing information the source core would send into the pool; sending the information to target core; target core sending the information storing in pool to target mission. The invention also discloses an inter-core communicating device. It improves the inter-core communicating efficiency and realizes the unification of inner core communication and inter-core communication.

A system and method for providing dynamic screening of transient messages in a distributed computing environment is disclosed. An incoming message is intercepted at a network domain boundary. The incoming message includes a header having a plurality of address fields, each storing contents. A set of blocking rules is maintained. Each blocking rule defines readily-discoverable characteristics indicative of messages infected with at least one of a computer virus, malware and bad content. The contents of each address field are identified and checked against the blocking rules to screen infected messages and identify clean messages. Each such clean message is staged into an intermediate message queue pending further processing.

The invention provides an elastic cloud distributed massive request processing method, device and system, and can instantaneously and automatically carry out expansion when a server cannot respond to a peak value. The method comprises the steps that: S1: a cloud computing management platform creates a container, and a message queue cluster, a ZooKeeper cluster, a service instance and a data storage cluster are respectively constructed on the container; S2: a client sends requests containing time to a load balancing server, the load balancing server distributes the requests to the message queue cluster, and after being synchronized by the ZooKeeper cluster, the requests are rearranged according to a time sequence; S3: the service instance acquires the requests from the message queue cluster, processes the requests, then stores a processing result to the data storage cluster, and returns the processing result to the client; and in the process of S1 to S3, the cloud computing management platform monitors a state of the container where the service instance is positioned, and when a state index exceeds a preset threshold, a new container is created by duplicating the container so as to improve a processing speed.