EP2294763A1 - N ud d'un système de communication avec une mémoire fonctionnellement distincte d'événements d'émission - Google Patents

N ud d'un système de communication avec une mémoire fonctionnellement distincte d'événements d'émission

Info

Publication number
EP2294763A1
EP2294763A1 EP09741925A EP09741925A EP2294763A1 EP 2294763 A1 EP2294763 A1 EP 2294763A1 EP 09741925 A EP09741925 A EP 09741925A EP 09741925 A EP09741925 A EP 09741925A EP 2294763 A1 EP2294763 A1 EP 2294763A1
Authority
EP
European Patent Office
Prior art keywords
message
memory
sent
transmission
subscriber node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP09741925A
Other languages
German (de)
English (en)
Inventor
Florian Hartwich
Marc Schreier
Franz Bailer
Markus Ihle
Tobias Lorenz
Christian Horst
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Robert Bosch GmbH
Original Assignee
Robert Bosch GmbH
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Robert Bosch GmbH filed Critical Robert Bosch GmbH
Publication of EP2294763A1 publication Critical patent/EP2294763A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/40006—Architecture of a communication node
    • H04L12/40032—Details regarding a bus interface enhancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L12/40143—Bus networks involving priority mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/40—Bus networks
    • H04L2012/40208—Bus networks characterized by the use of a particular bus standard
    • H04L2012/40215—Controller Area Network CAN

Definitions

  • the present invention relates to a subscriber node of a communication system.
  • the communication system comprises a data bus to which the subscriber node and at least one further subscriber node are connected.
  • the subscriber node has a communication controller for sending messages over the data bus and / or for receiving messages from the data bus and message memory for buffering messages to be sent or received.
  • the invention further relates to a communication system comprising a data bus and a plurality of subscriber nodes connected thereto for the purpose of data transmission.
  • Subscriber nodes each have a communication controller for sending messages over the data bus and / or for receiving messages from the data bus and message memory for buffering messages to be sent or received.
  • the present invention also relates to a method for transmitting a message from a first subscriber node of a communication system via a data bus of the communication system to a second subscriber node of the communication system.
  • An application program of the first subscriber node places the message to be sent in a message memory, from where it is fetched from a communication controller in response to a send command from the application program and transmitted via the data bus.
  • CAN controller area network
  • This is an asynchronous, serial bus system developed by Bosch in 1983 for the networking of control units in automobiles and compiled in 1986 (see SAE Paper 860391, International Congress and Exposition, Detroit, Michigan, Feb. 24-28, 1986) was introduced with Intel to reduce the length of wire harnesses in automobiles and thereby space and weight to save.
  • the use of the CAN bus is not limited to the automotive sector.
  • the CAN bus has been introduced, for example, in building control technology and in machine tools.
  • the data transmission takes place in CAN in data frames (so-called frames), which in addition to the user data to be transmitted (the actual message) and configuration data at the beginning (header part) and test data at the end (CRC part) of the
  • a known communication system of the above type are a FlexRay bus, a Media Oriented Systems Transport (MOST) bus, or any fieldbus, such as a LIN (Local Interconnect Network) bus.
  • MOST Media Oriented Systems Transport
  • LIN Local Interconnect Network
  • messages are transmitted between a first and a second subscriber node by an application program of the first subscriber node copies the message to be sent in a message memory, from where they fetched on a transmission command of the application program from a communication controller and transmitted via the data bus becomes.
  • the application program of the subscriber node copies the message to be sent of the urgent send request into a message store, from where it is fetched on a send command of the application program from a communication controller and transmitted via the data bus. After completing the urgent send request, the application program resumes the interrupted transmission. For this purpose, it is necessary for the application program to have information about the status of the job processed before the urgent job
  • Send job The application program should have the option of to inform themselves about the result of sending orders and possible withdrawals of send orders.
  • the message stores whose contents are to be sent are connected to status bits. Often only the success of a send job can be displayed on the status bits. Some results, especially in the case of a withdrawal of a send job (Tx Cancellation), can not be represented by the status bits.
  • the present invention is based on the object of designing and further developing a subscriber node such that information about send jobs can be managed and made accessible to the application program.
  • the subscriber node has at least one transmission event memory functionally separated from the message memories, in which a transmission event is stored for at least one message to be sent or sent.
  • the information about the send jobs is not stored in the message stores whose contents are to be sent, but in a separate list as part of a send event memory.
  • This has the advantage that the application program does not have to gather the information from different message stores, but rather that the information can be retrieved at a fixed location, preferably in chronological order, and that the message stores are immediately available again after the resumption of a send job and continue to be used without having to wait for the result of this withdrawal.
  • a CPU of the subscriber node can turn to the processing of the next send job immediately after the return of a send job and, for example, store the message in the message store. Of course, the CPU is also available for any other activities after taking back.
  • the processing of successive send jobs can be accelerated in the event of a withdrawal of a send job, and the efficiency of the CPU can be improved.
  • the invention also has the advantage that the status flags on the status of a send job are not coupled to the message store. According to an advantageous development of the invention, it is proposed that the transmission event comprises at least one of the following events:
  • the application program of the subscriber node can therefore retrieve the exact status or the output of a preceding transmission job at any time. It is not only possible to retrieve information about whether the data transfer was successful, but also about the circumstances under which the transfer was successful (with or without withdrawal of the send request) and whether and under which circumstances the send request was withdrawn ( Transmission has not yet started (for example because the data bus was busy), transmission ends after loss of arbitration or transmission ends after error). This additional information allows the application program to continue taking a data transmission whose send job has been withdrawn to take appropriate measures, for example to issue a new send job.
  • an identifier of the at least one message to be sent or sent is stored in the transmission event memory.
  • the identifier preferably allows a unique identification of the message or the transmission request.
  • the identifier stored in the transmission event memory in addition to the transmission event for the at least one message to be sent or transmitted makes it possible to unambiguously assign the transmission event to a specific message or a specific transmission job even if several transmission events are stored in the event memory stored by various send jobs.
  • this makes it possible at any time to read out the transmission event for a specific message or for a specific transmission request. The greater the capacity of the event memory, the more send events with associated information can be stored.
  • a data length code of the at least one message to be sent or sent a time stamp indicating when the event has occurred
  • an address of the message store for which the send job existed a sequence counter that identifies data packets when larger amounts of data are sent sequentially in multiple messages with the same identifier
  • a timestamp may be important for certain application programs. If the subscriber node has several transmit message memories (so-called send buffers), it can be determined from the address of the message store for which the send job was present which send buffer is free for new send requests.
  • a sequence counter can be important, for example, in the case of a software download if, for example, at the end of the tape or during a workshop visit, subscriber nodes of the communication network designed as control devices are programmed new or with a new software version for the first time. The software is split into several, for example, 8-byte data packets, which have the same identifier. The sequence counter indicates for which of the data packets a transmission event has been stored in the event memory or which of the data packets has been transmitted successfully.
  • the transmit event memory is organized as a FIFO (First In First Out) memory.
  • the transmission event memory preferably has a plurality of memory elements, wherein information about a message to be sent or sent is stored in each memory element.
  • a capacity of the event memory of a few memory elements will suffice.
  • the transmit event memory comprises a Random Access Memory (RAM).
  • Conceivable is also a realization in another way, for example by means of flip-flops, but these require a relatively large silicon area and thus also cause relatively high costs.
  • the transmission event memory is formed as part of a message memory.
  • the size of the transmission event memory in particular the number of memory elements of the event memory, can be freely configured by software, for example by means of configuration bits. In this way, the size of the event memory can be easily adapted flexibly to the individual requirements.
  • the at least one subscriber node has at least one transmission event memory functionally separated from the message memories, in which a transmission event for at least one message to be sent or sent is stored.
  • the at least one subscriber node of the communication system according to the invention can also have features of one or more of the subclaims 2 to 8.
  • a transmission event for the message to be sent or transmitted be stored in a transmission event memory functionally separated from the message memory, and the application program can access the information stored in the event memory at any time.
  • FIG. 1 shows an example of a communication network according to the invention
  • FIG. 2 shows an example of a subscriber node according to the invention of a communication network according to FIG. 1; and FIG. 3 shows an example of a flow chart of a method according to the invention for message transmission via a communications network according to FIG. 1.
  • a communication system is designated in its entirety by the reference numeral 1.
  • the network 1 comprises a data bus 2, which is represented symbolically by a single line.
  • the data bus 2 may be formed as a one-, two- or multi-wire bus.
  • the physical layer of the data bus 2 may comprise one or more copper lines, one or more optical fiber lines, or also optical (e.g., infrared) or radio links.
  • Several subscriber nodes 3 are connected to the data bus 2, of which only three are shown by way of example in FIG. Each node 3 is connected to the data bus 2 via a communication module 4 (so-called communication controller CC).
  • the nodes 3 also have a host application 5 (so-called application program AP).
  • messages 7 can be transmitted according to a serial communication protocol (e.g., CAN, FlexRay, LIN, MOST, etc.).
  • the communication module 4 is responsible for receiving and sending messages 7 via the data bus 2.
  • the messages 7 each have a so-called header 8 with an identifier (so-called identifier) and further configuration bits.
  • the messages 7 also have a user data part 9 (so-called payload) and a so-called trailer 10.
  • the identifier enables unambiguous identification of the messages 7.
  • the identifier is, for example, a type of sender Address which allows the determination of the origin of the message 7 and identifies the content 9 of the message 7.
  • transmit buffer 11 and receive buffer 12 (Rx) are arranged as intermediate memories for outgoing or incoming messages 7.
  • the message stores 11, 12 may be integral with or separate from the communication controller 4.
  • the message stores 11, 12 are preferably constructed in the manner of a FIFO (First In First Out). They are, for example, designed as a random access memory (RAM).
  • FIFO First In First Out
  • the application program 5 of one of the subscribers 3 wants to send a message 7 via the data bus 2 to another subscriber 3, it first deposits the message 7 to be sent or its content 9 in the send buffer 11 (arrow 20 in FIG. 2). On one
  • the transmission of the message 7 via the data bus 2 is serial and can therefore take a relatively long time.
  • the present invention relates to the case that at any time during the processing of the transmission job this is withdrawn (so-called. Transmit Cancellation), for example, because initially another, especially urgent send job is to be processed.
  • the transmission job begins with the filing of the message 7 or its content 9 in the transmission buffer 11 and ends with the receipt of a response from the communication controller 4 that the message was sent successfully or not.
  • the transmission buffers 11 are connected to status bits which can provide information as to whether the transmission request has been successfully completed or not. Information about further events, in particular in the case of a withdrawal of the send request, can not be taken from the status bits.
  • a possibly already started send process i.e., Start Of Frame (SOF) already sent in the CAN
  • SOF Start Of Frame
  • the application program 5 can not remove the status bits.
  • the application program 5 must wait for the result of the send job and is blocked during this time, so to speak.
  • the present invention can provide improvements.
  • a transmission event memory 13 which is functionally separate from the message memories 11, 12 is provided in the subscriber node 3, in which a transmission event or status for at least one message 7 to be transmitted or sent is stored.
  • Tx Stat transmission event memory 13
  • the Communication network 1 be provided with a transmission event memory 13.
  • the event memory 13 is preferably formed as a random access memory (RAM) and organized in the manner of a FIFO.
  • the event memory 13 may also be designed as a read-only memory (eg flash memory, ROM, EEPROM).
  • the event memory 13 may be formed as an integral part of the communication controller 4 or separate from it.
  • the transmission event memory 13 can be separated from the message memories 11, 12 or as part of a message memory 11, 12 be formed. If the event memory 13 is part of a message memory 11, 12, the size of the event memory 13 can be defined flexibly by software, for example by means of configuration bits, according to the individual requirements.
  • the information about the status of the send jobs are therefore no longer stored in a message store 11 whose contents should be sent, but in a separate send event list. This preferably contains one entry per send or return event.
  • the information about the status of the transmission jobs can be managed in the communication module 4 and stored in the event memory 13 (arrow 23 in FIG. 2).
  • the application program 5 can pick up the information stored in the event memory 13 flexibly in terms of time (arrow 24 in FIG. 2). It is particularly advantageous that the information about the send jobs are now completely separate from the send buffer 11.
  • the application program 5 does not have to gather together the status information about the send jobs from different message stores 11, but that the information on a fixed Place (in the send event list in the transmission event memory 13) are preferably sorted by time. After the withdrawal of a transmission request, the message memory 11 can be used immediately without having to wait for the result of the transmission request or the withdrawal.
  • the application program 5 can read out the information stored in the event memory 13 at a later time, it does not have to react to it immediately (for example, by interrupt). If the event memory 13 threatens to overflow because the application program 5 reads it too seldom, a warning signal can be output in a first step, which can be associated with appropriate measures for accelerated or more frequent readout of at least part of the information. If the memory 13 actually overflows, an error signal may be output. In this case, the oldest entries in the send event memory 13 can be discarded to make room for the information of current send requests.
  • the event memory 13 contains temporally ordered results (message 7 sent, withdrawal of the send request) of send requests. Below are some examples of other events that can be stored in the event memory 13:
  • identifiers for example CAN identifiers
  • the identifier allows a unique identification and assignment of the stored information to certain messages, so that the messages do not necessarily have to be stored in a time sequence in the memory 13. It is also conceivable to include one or more of the following additional information in the transmission event memory 13:
  • a timestamp may be important to particular application programs. If the subscriber node 3 has multiple send buffers 11, it can be determined based on the address of the message store 11 for which the send job existed, which send buffer 11 is free for new send jobs.
  • a sequence counter can be important, for example, in the case of a software download if, for example, subscriber nodes 3 of the communications network 1 designed as control devices at the end of the tape or during a workshop visit are programmed for the first time or with a new software version.
  • the software is split into several, for example, 8-byte data packets, which all have the same identifier.
  • the sequence counter indicates for which of the data packets a transmission event has been stored in the event memory 13 or which of the data packets has been transmitted successfully.
  • the sequence counter has been entered into the message memory 11 by the application program 5 when the transmission request is issued.
  • the method according to the invention will be explained in more detail below with reference to a flowchart shown in FIG.
  • the method begins in a function block 30.
  • the application program 5 transmits data to be transmitted to a transmission buffer 11.
  • the application program 5 sends a transmission command in function block 32.
  • the communication controller 4 then fetches the data from the transmission buffer 11 in a function block 33.
  • the controller 4 stows the data 9 in a function block 34, the data corresponding to the communication protocol used 7 and brings the data in the appropriate format.
  • the message 7 is transmitted serially via the data bus 2.
  • the message transmission begins with the transmission of an SOF bit.
  • an event may occur which requires a withdrawal of the transmission request, for example the desire to send as soon as possible another message which is more urgent or more important than the message of the current one send request.
  • the occurrence of such an event is illustrated in FIG. 3 by a function block 36.
  • event 36 occurs during serial messaging.
  • the application program 5 resets the current send job.
  • the application program 5 can immediately store new data in a send buffer 11 in a function block 37, namely the data for the more urgent or more important message 7.
  • the application program 5 does not have the end of the transmission of the first message or Wait for the result of the first send job.
  • the status of the first transmission job is stored in the transmission event memory 13 by the communication controller 4 after the end of the transmission of the first message at a later time. This can be done at any time after the end of the transmission of the first message and is exemplified in Figure 3 by a function block 38.
  • a function block 39 the application program 5 sends a send command for the transmission of the further message.
  • the communication controller 4 fetches the new data from the transmission buffer 11 in a function block 40.
  • the controller 4 stows the data 9 in a function block 41 into a second message 7 corresponding to the communication protocol used and brings the data into the appropriate format.
  • the second message 7 is transmitted serially via the data bus 2.
  • the message transmission begins with the sending of a SOF bits.
  • the status of the second send request is stored in the transmission event memory 13 by the communication controller 4 after the end of the transmission of the second message at any later time. This is exemplified by a function block 43 in FIG.
  • the application program fetches the result of the first transmission request from the transmission event memory 13. This is done in the example shown in a function block 44 after completion of the transmission of the second message 7, which has led to the withdrawal of the first send job.
  • the application program 5 initiates in a function block
  • Important aspects of the present invention reside in the fact that the utilization of the host CPU is improved, it is possible to start transmitting a new message in the shortest possible time after a send job has been withdrawn, that more detailed information on the individual send jobs is available, and that the Storing the information about the send jobs in the event memory and the reading out of this information is temporally decoupled, without this leading to a blocking of the host CPU.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Communication Control (AREA)
  • Computer And Data Communications (AREA)
  • Small-Scale Networks (AREA)

Abstract

L'invention concerne un noed (3) d'un système de communication (1), un système de communication (1) et un procédé de transmission d'un message (7) sur le système de communication (1). Le message (7) est émis par un premier noed (3) du système de communication (1), sur un bus de données (2) du système de communication (1), vers un deuxième noed (3) du système de communication (1). Un programme applicatif (5) du premier noed (3) place le message (7) à envoyer dans une mémoire de messages (11, 12), d'où il est extrait sur une instruction d'émission du programme applicatif (5) par un contrôleur de communication (4) pour être transmis sur le bus de données (2). Afin de pouvoir améliorer l'efficacité et la charge de l'unité centrale d'un ordinateur, en particulier en cas de révocation de l'instruction d'émission, il est proposé qu'un événement d'émission correspondant au message (7) à envoyer ou déjà envoyé soit mémorisé dans au moins une mémoire d'événements d'émission (13) fonctionnellement distincte de la mémoire de messages (11, 12) et que le programme applicatif (5) puisse accéder à tout instant aux informations mémorisées dans la mémoire d'événements d'émission (13).
EP09741925A 2008-05-05 2009-03-05 N ud d'un système de communication avec une mémoire fonctionnellement distincte d'événements d'émission Withdrawn EP2294763A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102008001548.2A DE102008001548B4 (de) 2008-05-05 2008-05-05 Teilnehmerknoten eines Kommunikationssystems, Kommunikationssystem und Verfahren zum Übertragen einer Nachricht in dem Kommunikationssystem
PCT/EP2009/052578 WO2009135707A1 (fr) 2008-05-05 2009-03-05 Nœud d'un système de communication avec une mémoire fonctionnellement distincte d'événements d'émission

Publications (1)

Publication Number Publication Date
EP2294763A1 true EP2294763A1 (fr) 2011-03-16

Family

ID=40671353

Family Applications (1)

Application Number Title Priority Date Filing Date
EP09741925A Withdrawn EP2294763A1 (fr) 2008-05-05 2009-03-05 N ud d'un système de communication avec une mémoire fonctionnellement distincte d'événements d'émission

Country Status (7)

Country Link
US (1) US8732374B2 (fr)
EP (1) EP2294763A1 (fr)
JP (1) JP5237438B2 (fr)
CN (1) CN102100037B (fr)
DE (1) DE102008001548B4 (fr)
RU (1) RU2537811C2 (fr)
WO (1) WO2009135707A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012080379A (ja) * 2010-10-04 2012-04-19 Renesas Electronics Corp 半導体データ処理装置及びデータ処理システム
NL1039562C2 (nl) * 2012-04-24 2013-10-28 Fusion Electronics B V Werkwijze, aansturing, berichtenontvangstmodule, databerichtformaat en netwerkprotocol voor een agrarisch systeem.
DE102017208836A1 (de) 2017-05-24 2018-11-29 Wago Verwaltungsgesellschaft Mbh Statussignalausgabe
CN107153412B (zh) * 2017-06-16 2019-09-03 北方电子研究院安徽有限公司 一种具有发送fifo的can总线控制器电路
DE102019205488A1 (de) * 2019-04-16 2020-10-22 Robert Bosch Gmbh Teilnehmerstation für ein serielles Bussystem und Verfahren zur Kommunikation in einem seriellen Bussystem

Family Cites Families (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2087610B (en) * 1980-10-13 1984-08-08 Multiform Electronics Ltd Communications systems
US4827409A (en) * 1986-07-24 1989-05-02 Digital Equipment Corporation High speed interconnect unit for digital data processing system
JP2559394B2 (ja) * 1987-02-16 1996-12-04 株式会社日立製作所 通信制御装置
JPH04313936A (ja) * 1991-03-29 1992-11-05 Mitsubishi Electric Corp 通信装置
EP0739119B1 (fr) * 1991-03-29 2002-02-27 Mitsubishi Denki Kabushiki Kaisha Appareil mémoire tampon
JP2731878B2 (ja) * 1992-02-18 1998-03-25 三菱電機株式会社 通信装置
US5513376A (en) * 1993-11-02 1996-04-30 National Semiconductor Corporation Method of operating an extension FIFO in another device when it is full by periodically re-initiating a write operation until data can be transferred
CA2207791C (fr) * 1994-12-13 2000-02-22 Novell, Inc. Procede et appareil pour la mise a jour ou la modification d'un repertoire de reseau
US6112268A (en) * 1997-06-16 2000-08-29 Matsushita Electric Industrial Co., Ltd. System for indicating status of a buffer based on a write address of the buffer and generating an abort signal before buffer overflows
US6968405B1 (en) * 1998-07-24 2005-11-22 Aristocrat Leisure Industries Pty Limited Input/Output Interface and device abstraction
JP2000134238A (ja) * 1998-10-27 2000-05-12 Matsushita Electric Ind Co Ltd 通信装置
US6560652B1 (en) * 1998-11-20 2003-05-06 Legerity, Inc. Method and apparatus for accessing variable sized blocks of data
FR2787267B1 (fr) * 1998-12-14 2001-02-16 France Telecom Dispositif et procede de traitement d'une sequence de paquets d'information
US6647440B1 (en) * 1999-09-15 2003-11-11 Koninklijke Philips Electronics N.V. End-of-message handling and interrupt generation in a CAN module providing hardware assembly of multi-frame CAN messages
US6574770B1 (en) * 2000-06-29 2003-06-03 Lucent Technologies Inc. Error-correcting communication method for transmitting data packets in a network communication system
JP4313936B2 (ja) 2000-08-17 2009-08-12 太平洋セメント株式会社 焼成物の製造方法およびその装置
TW559702B (en) 2000-08-31 2003-11-01 Nippon Telegraph & Telephone File transfer system, apparatus, method and computer readable medium storing file transfer program
US6976072B2 (en) * 2001-03-30 2005-12-13 Sharp Laboratories Of America, Inc. Method and apparatus for managing job queues
CN1381982A (zh) * 2001-04-20 2002-11-27 爱达数码科技(杭州)有限公司 一种电话机
US6757776B1 (en) * 2002-07-17 2004-06-29 Cypress Semiconductor Corp. Control transaction handling in a device controller
US20050024664A1 (en) * 2003-07-30 2005-02-03 Schmidt William Randolph Printer formatter with print server
US7243172B2 (en) * 2003-10-14 2007-07-10 Broadcom Corporation Fragment storage for data alignment and merger
JP4536361B2 (ja) * 2003-11-28 2010-09-01 株式会社日立製作所 データ転送装置、記憶デバイス制御装置、記憶デバイス制御装置の制御方法
CN1705295A (zh) 2004-05-29 2005-12-07 华为技术有限公司 具有优先级的包传输系统及其方法
EP2615160A1 (fr) 2004-10-06 2013-07-17 Universal Bio Research Co., Ltd. Cuve de réaction et commande de réaction
RU2305374C1 (ru) * 2005-12-14 2007-08-27 Ставропольский военный институт связи ракетных войск Способ гибридной коммутации и адаптивной маршрутизации и устройство для его осуществления
WO2007091128A1 (fr) * 2006-02-09 2007-08-16 Freescale Semiconductor, Inc. Procédé d'échange d'information avec des registres de composant de couche physique
WO2008078582A1 (fr) * 2006-12-22 2008-07-03 Canon Kabushiki Kaisha Élément de fixation, son procédé de fabrication, dispositif de fixation l'utilisant et dispositif de formation d'image électrophotographique
JP5036406B2 (ja) * 2007-05-30 2012-09-26 エイチジーエスティーネザーランドビーブイ コンテンツデータ管理システム及び方法
US8159709B2 (en) * 2008-03-31 2012-04-17 Konica Minolta Laboratory U.S.A., Inc. Method for canceling a print job submitted to a printer
JP5136610B2 (ja) * 2010-08-06 2013-02-06 ブラザー工業株式会社 端末装置及びコンピュータプログラム
CN102347778B (zh) * 2011-08-05 2014-01-22 中国舰船研究设计中心 一种自适应干扰对消装置及其调试方法
JP5547148B2 (ja) * 2011-09-13 2014-07-09 株式会社東芝 メモリデバイス

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
RU2537811C2 (ru) 2015-01-10
CN102100037A (zh) 2011-06-15
JP5237438B2 (ja) 2013-07-17
WO2009135707A1 (fr) 2009-11-12
JP2011520368A (ja) 2011-07-14
RU2010149264A (ru) 2012-06-20
DE102008001548A1 (de) 2009-11-12
CN102100037B (zh) 2018-01-09
US20110167188A1 (en) 2011-07-07
DE102008001548B4 (de) 2017-03-02
US8732374B2 (en) 2014-05-20

Similar Documents

Publication Publication Date Title
DE112013004941B4 (de) Gateway-Vorrichtung
DE2913288C2 (de) Multiprozessoranlage mit einer Vielzahl von Prozessorbausteinen
EP2882145B1 (fr) Procédé et agencement de filtre destinés à stocker des informations rélies aux messages entrantes à l'aide d'un bus de données en série d'un réseau de communication dans un noeud du réseau
EP1298849A2 (fr) Procédé et dispositif de transmission d'information via un système de bus et système de bus
DE102011122644B4 (de) Nachrichtenverlustverhinderung unter Verwendung eines Senderpuffers und Verkehrsgestaltung in durch ein Ereignis ausgelösten verteilten eingebetteten Echtzeitsystemen
DE102008001548B4 (de) Teilnehmerknoten eines Kommunikationssystems, Kommunikationssystem und Verfahren zum Übertragen einer Nachricht in dem Kommunikationssystem
EP1069731A2 (fr) Reseau et Procédé pour l'échange des messages
EP0903666B1 (fr) Procédé pour la distribution de paquets de données d'un système d'exploitation
DE102011122646B4 (de) Nachrichtenverlustverhinderung durch Verwendung von Sender- und Empfängerpuffern in durch ein Ereignis ausgelösten verteilten eingebetteten Echtzeitsystemen
DE102011015966A1 (de) Automatisierungssystem
EP1911213A1 (fr) Module de communication flexray, controleur de communication flexray, et procede de transmission de messages entre une liaison de communication et un abonne flexray
DE102017130547A1 (de) Verfahren zum Senden von Datenpaketen, Steuergerät und System mit Steuergerät
EP0555456B1 (fr) Procede de transmission de donnees et installation de traitement de donnees pourvu de noeuds de calcul repartis
DE60036121T2 (de) Hochgeschwindigkeitsverbindung für eingebettete Systeme in einem Rechnernetzwerk
DE19935127B4 (de) Verfahren zum Betrieb eines Vermittlungssystems für Datenpakete
EP1642207B1 (fr) Attribution d'adresses de station a des abonnes de communication dans un systeme de bus
DE10307424A1 (de) Datenvermittlungsvorrichtung und Multiplex-Kommunikationssysteme
DE102019125545B3 (de) Datenübertragungsverfahren, segment-telegramm und automatisierungskommunikationsnetzwerk
EP1892631A2 (fr) Procédé et dispositif d'alimentation de données dans un bus de données série
DE19846913A1 (de) Elektronische Steuereinrichtung mit einem parallelen Datenbus und Verfahren zum Betreiben der Steuereinrichtung
EP2130328A1 (fr) Procédé pour transférer des données vers plusieurs appareils de commande
DE102019003389A1 (de) Weiterleitungsvorrichtung
DE602004011760T2 (de) Speichervorrichtung für Datenpackete mit beliebiger Länge
DE69725570T2 (de) Paketendeerkennung zum speichern von mehreren paketen in einem sram
DE10260807A1 (de) Sendeverfahren für eine Zeitreferenz über ein Übertragungsmedium und hiermit korrespondierender Zeitgeberblock

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20101206

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA RS

DAX Request for extension of the european patent (deleted)
17Q First examination report despatched

Effective date: 20170704

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20171115