Static message placement in queues based on an apriori defined placement plan

Patent metadata

Field	Value
Publication number	US-10140167-B2
Application number	US-201515511866-A
Country	US
Kind code	B2
Filing date	Sep 21, 2015
Priority date	Sep 22, 2014
Publication date	Nov 27, 2018
Grant date	Nov 27, 2018

Abstract

An information exchange between at least two processes (FEED_PROC-1, FEED_PROC-2, CONSUME_PROC-1) communicating with each other using at least one queue (QUEUE-001) uses a placement plan for determining the order in which messages are placed into the queue. The information feeding processes (FEED_PROC-1, FEED_PROC-2) place pieces of information (MESG-001, MESG-002) into the queue (QUEUE-001), from where an information consuming process (CONSUME_PROC-1) sequentially consumes the pieces of information. The placement plan describes, for at least one possible value of identifying information contained in each of the pieces of information, a respective position (POS-001, POS-002) in the queue (QUEUE-001), such that the pieces of information (MESG-001, MESCG-002) or respective references thereto are placed into the queue according to positions in the queue (QUEUE-001) corresponding to the respective values of the identifying information in the pieces of information.

First claim

The invention claimed is:

1. A method for performing an information exchange between at least two processes (FEED_PROC- 1 , FEED_PROC- 2 , CONSUME_PROC- 1 ) communicating with each other using at least one queue (QUEUE- 001 ), the method comprising:
conducting at least one information feeding process (FEED_PROC- 1 , FEED_PROC- 2 ) that places pieces of information (MESG- 001 , MESG- 002 , MESG- 003 , MESG- 004 ) into the at least one queue (QUEUE- 001 ); and
conducting at least one information consuming process (CONSUME_PROC- 1 ) that sequentially consumes the pieces of information (MESG- 001 , MESG- 002 , MESG- 003 , MESG- 004 ) from the at least one queue (QUEUE- 001 );
wherein each piece of information comprises identifying information (F 003 , F 004 , F 005 , F 006 ),
wherein placing the pieces of information (MESG- 001 , MESG- 002 , MESG- 003 , MESG- 004 ) from the at least one information feeding process (FEED_PROC- 1 , FEED_PROC- 2 ) into the at least one queue (QUEUE- 001 ) is done according to an a priori specified placement plan (PP),
wherein the placement plan (PP) describes, for each of at least one possible value of the identifying information (MESG), a respective position (POS) where pieces of information of a message type as specified by the respective value of identifying information, or respective references thereto, are to be placed into the queue (QUEUE- 001 ),
wherein the pieces of information (MESG- 001 , MESG- 002 , MESG- 003 , MESG- 004 ) or respective references thereto are placed into the at least one queue (QUEUE- 001 ) at respective positions (POS) in the queue (QUEUE- 001 ) as defined in the placement plan by the respective values of the identifying information (MESG) comprised in the pieces of information, and
wherein the placement plan (PP) defines, for at least two values of identifying information (MESG- 001 , MESG- 002 ), the same position (POS- 001 ), and when information feeding processes (FEED PROC- 1 ,FEED PROC- 2 ) provide more than one piece of information (MESG- 001 , MESG- 002 ) for the same position (POS- 001 ), the queue (QUEUE- 01 ) performs a replacement strategy for the pieces of information (MESG- 001 , MESG- 002 ) to be placed into the same position.

2. The method according claim 1 , wherein the placement plan (PP) defines multiple positions (POS- 001 , POS- 002 , POS- 003 , POS- 004 ) for at least one value of the identifying information (MESG- 001 , MESG- 002 ), and the corresponding pieces of information (MESG- 001 , MESG- 002 ) or respective references thereto are placed at least at one of the multiple positions thus defined.

3. The method according to claim 2 , wherein when a piece of information (MESG- 001 , MESG- 002 ) or a respective reference thereto is placed at more than one position (POS- 001 , POS- 002 ), the information consuming process (CONSUME_PROC- 1 ) consumes the information (MESG- 001 , MESG- 002 ) repeatedly, namely, a corresponding number of times.

4. The method according to claim 1 , wherein the replacement strategy is one of the following: use the first, the second, or the last piece of information (MESG- 001 , MESG- 002 ) having the respective values of identifying information and discard the other pieces of information.

5. The method according to claim 1 , wherein the placement plan (PP) includes empty entries (EE- 001 ) which are processed to generate a pause of execution of the information consuming process (CONSUME_PROC- 1 ).

6. The method according to claim 1 , wherein at least one information consuming process (CONSUME_PROC- 1 ) is started at a configured point in time in a synchronized timebase.

7. The method according claim 6 , wherein the synchronized timebase is established by one of the following synchronization standards: IEEE 802.1AS, IEEE 1588, SAE AS6802 or a standard that builds on said synchronization standards.

8. The method according to claim 1 , wherein at least one information feeding process (FEED_PROC- 1 ) is started at a configured point in time in a synchronized timebase.

9. The method according to claim 1 , wherein the information consuming process (CONSUME_PROC- 1 ) starts to consume from a position (POS) in the queue (QUEUE) other than the first position.

10. The method according claim 9 , wherein the information consuming process (CONSUME_PROC- 1 ) implements an information consumption plan (CP) that instructs the information consuming process of the starting position (POS) to consume messages and optionally also instructs of the number of entries (ENT) to consume following the starting position (POS).

11. The method according claim 10 , wherein the information consumption plan (CP) uses the time reaching a configured point in time in a synchronized timebase as event (EVENT), to identify from which position (POS) the information consuming process (CONSUME_PROC- 1 ) starts to consume information.

12. The method according to claim 1 , wherein the pieces of information (MESG- 001 , MESG- 002 , MESG- 003 , MESG- 004 ) exchanged using the one or many queues (QUEUE, QUEUE- 001 ) are Ethernet frames or references representing Ethernet frames.

13. The method according to claim 1 , wherein the placement plan (PP) describes positions (POS) in the queue for sequentially consuming messages from the queue.

Assignees

• Fts Computertechnik Gmbh

Inventors

• Steiner Wilfried
• Bauer Günther

Classifications

• G06F9/466

  Transaction processing · CPC title

• G06F2209/548

  Queue · CPC title

• G06F9/546 Primary

  Message passing systems or structures, e.g. queues · CPC title