WO2017107410A1 - 基于分形树结构的数据发布装置、方法、控制装置及智能芯片 - Google Patents

基于分形树结构的数据发布装置、方法、控制装置及智能芯片 Download PDF

Info

Publication number
WO2017107410A1
WO2017107410A1 PCT/CN2016/086093 CN2016086093W WO2017107410A1 WO 2017107410 A1 WO2017107410 A1 WO 2017107410A1 CN 2016086093 W CN2016086093 W CN 2016086093W WO 2017107410 A1 WO2017107410 A1 WO 2017107410A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
leaf nodes
leaf
node
central node
Prior art date
Application number
PCT/CN2016/086093
Other languages
English (en)
French (fr)
Inventor
罗韬
刘少礼
张士锦
陈云霁
Original Assignee
中国科学院计算技术研究所
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 中国科学院计算技术研究所 filed Critical 中国科学院计算技术研究所
Priority to US15/781,608 priority Critical patent/US10904034B2/en
Publication of WO2017107410A1 publication Critical patent/WO2017107410A1/zh
Priority to US17/100,570 priority patent/US11616662B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/782—Hierarchical allocation of resources, e.g. involving a hierarchy of local and centralised entities
    • 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/44—Star or tree networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/805—QOS or priority aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Packet switching elements characterised by the switching fabric construction
    • H04L49/109—Integrated on microchip, e.g. switch-on-chip
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/15—Interconnection of switching modules
    • H04L49/1515—Non-blocking multistage, e.g. Clos
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements

Definitions

  • the invention relates to the technical fields of intelligent devices, unmanned driving, on-chip network data transmission, and the like, and particularly relates to a data distribution device, a method, a control device and a smart chip based on a fractal tree structure.
  • Broadcast refers to a method of transmitting data to all devices in a limited range in the network, that is, in the broadcast domain.
  • Multicast refers to a method of transmitting data to one or more hosts in the network.
  • the on-chip network is a new form of computer integration based on multi-processor technology that can achieve higher bandwidth in concurrent and non-blocking switching while adapting to multiple asynchronous clocks often used in complex SoC designs, but due to data packing. Delays are added to the buffer, synchronization, and interface, so that the on-chip broadcast has different delays for each core.
  • the data is preferably transmitted in a stream in each node.
  • Data stream transmission means that after the node accepts the data in one beat, the data is sent to the next node without stopping at the next beat. If there is no consistent network communication protocol between the nodes, the cooperation is lacking in each node. Data flow conflicts and loss may occur during the execution of the pipeline, so the data transmission within the chip will be unreliable. In a specific instance, since the data sender cannot know whether the data receiver has taken the data from the buffer area, The next data is sent to the buffer area of the data receiver, at which point the original data will be flushed and updated by the new data and lost.
  • the prior art lacks effective support for both broadcast and multicast communication methods between on-chip multi-cores. Therefore, it is particularly urgent to provide a synchronous, streamlined, and reliable way of supporting both broadcast and multicast communication methods.
  • the present invention proposes a data distribution apparatus, method, control apparatus and smart chip based on a fractal tree structure for distributing central data to a high speed in a data processing device.
  • a data distribution apparatus for distributing central data to a high speed in a data processing device.
  • the cache In the cache.
  • the invention provides a data distribution device based on a fractal tree network structure, comprising:
  • central node which is a communication data center of the on-chip network, configured to broadcast or multicast communication data to a plurality of leaf nodes;
  • leaf nodes which are communication data nodes of the on-chip network, for transmitting communication data to the central leaf node;
  • a repeater module configured to connect the central node and the plurality of leaf nodes, and the communication data is forwarded by the forwarding module;
  • the plurality of leaf nodes are divided into N groups, and the number of leaf nodes in each group is the same, and the central node communicates with each group of leaf nodes separately through the repeater module, and each group of leaf nodes constitutes communication
  • the structure has self-similarity, and the plurality of leaf nodes and the central node are communicably connected in a completely multi-tree manner by the plurality of the repeater modules.
  • each node includes a local cache structure for storing a subset of the central node publishing data
  • Each leaf node has an id identifier, and the id identifier sequentially increases the sequence number from the top side of the complete multi-tree tree;
  • the data distribution device shares a clock signal.
  • the repeater module includes a local cache structure for storing data.
  • the present invention also provides a data distribution method using the data distribution apparatus, comprising: transmitting, by the central node, communication data to the plurality of leaf nodes, wherein the data sender is ready to send data, and the data is valid. Signal, and put the data on the bus; after the data receiver is ready to receive the data, the data is ready to receive the signal; when both the data valid signal and the data ready to receive signal are detected, the data sender considers that the data has been sent. And received by the data receiver.
  • the method further includes: when broadcasting communication data from the central node to the plurality of leaf nodes, first entering data from the central node to the repeater module directly connected to the central node by using a handshake protocol Temporarily stored in the local cache. After each handshake protocol succeeds, it enters the local cache of the next intermediate forwarding module for temporary storage. Finally, the transponder module directly connected to the leaf node is input, and is respectively issued by the transponder module. A set of leaf nodes.
  • the method further includes: if the handshake process of the next clock tick data sender and the data receiver is successful, the data is stored in the local buffer of the data receiver in a pipeline manner; if the handshake protocol is unsuccessful, the data is saved in the local cache of the current layer. And the current layer is used as the data receiver of the upper layer, and stops sending data to receive the signal, so that the data in the local cache of the current layer stops updating, the data one Save directly at the current layer until the handshake protocol is successful.
  • the method further includes: when the central node multicasts communication data to the plurality of leaf nodes, firstly, data enters from the central node to the repeater module directly connected to the central node by using a handshake protocol.
  • the local cache is temporarily stored. After each handshake protocol is successful, it is temporarily stored in the local buffer of the next intermediate repeater module. Finally, the forwarder module directly connected to the leaf node is input, and is respectively issued by the repeater module. A group of leaf nodes connected.
  • the method further includes: when receiving the data, the leaf node selects data of a preset bandwidth according to an id identifier corresponding thereto.
  • the invention also proposes a control device comprising the data distribution device.
  • the invention also proposes a smart chip comprising the control device.
  • FIG. 1 is a schematic diagram of a prior art ring-type on-chip network structure
  • FIG. 2 is a schematic structural view of a hub_one_to_two according to the present invention.
  • FIG. 5 is a schematic diagram of the behavior of data transmission in a hub according to another embodiment of the present invention.
  • FIG. 6 is a schematic structural diagram of the h-tree structure of the present invention expanded into a complete binary tree topology
  • FIG. 9 is a schematic diagram of the behavior of data transmission in a hub according to another embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a full quadtree topology of an x-tree structure of the present invention.
  • FIG. 11 is a schematic diagram of data of full bandwidth and data segments corresponding to each leaf tile on an x-tree in another embodiment of the present invention.
  • the invention provides a data distribution device based on a fractal tree network structure, comprising:
  • a central node which is a communication data center of the on-chip network, for the plurality of leaf segments Point to broadcast or multicast of communication data;
  • leaf nodes which are communication data nodes of the on-chip network, for transmitting communication data to the central leaf node;
  • a repeater module configured to connect the central node and the plurality of leaf nodes, and the communication data is forwarded by the forwarding module;
  • the plurality of leaf nodes are divided into N groups, and the number of leaf nodes in each group is the same, and the central node is separately connected to each group of leaf nodes through the forwarding module, and the communication structure formed by each group of leaf nodes Having self-similarity, the plurality of leaf nodes and the central node are communicably connected in a completely multi-tree manner by the plurality of the repeater modules.
  • Each node includes a local cache structure for storing a subset of the central node publishing data
  • Each leaf node has an id identifier, and the id identifier sequentially increases the sequence number from the top side of the topology of the completely multi-fork tree.
  • the data distribution device shares a clock signal.
  • the repeater module includes a local cache structure for storing data.
  • the present invention also provides a data distribution method using the data distribution apparatus, and the communication data is distributed to the plurality of leaf nodes by the central node, wherein the data sender is ready to send data, and then sends a data valid signal. And placing the data on the bus; after the data receiver is ready to receive the data, the data is ready to receive the signal; when both the data valid signal and the data ready to receive signal are detected, the data sender considers that the data has been sent, and Received by the data receiver.
  • first data is entered from the central node into a local cache of the repeater module directly connected to the central node by a handshake protocol.
  • Temporary storage after each handshake protocol is successful, it is temporarily stored in the local buffer of the next intermediate forwarding module, and finally the transponder module directly connected to the leaf node is input, and is respectively issued by the transponder module to a group connected thereto.
  • Leaf node When broadcasting communication data from the central node to the plurality of leaf nodes, first data is entered from the central node into a local cache of the repeater module directly connected to the central node by a handshake protocol. Temporary storage, after each handshake protocol is successful, it is temporarily stored in the local buffer of the next intermediate forwarding module, and finally the transponder module directly connected to the leaf node is input, and is respectively issued by the transponder module to a group connected thereto.
  • Leaf node When broadcasting communication data from the central node to the plurality of leaf nodes, first data is entered from the central node into
  • the central node When the central node multicasts communication data to the plurality of leaf nodes, firstly, data is transferred from the central node to a local cache of the repeater module directly connected to the central node by using a handshake protocol. Temporary storage, after each handshake protocol is successful, enters the local buffer of the next intermediate repeater module for temporary storage, and finally inputs a repeater module directly connected to the leaf node, and is respectively issued by the repeater module to the connected one. Group leaf nodes.
  • the invention also proposes a control device comprising the data distribution device.
  • the invention also proposes a smart chip comprising the control device.
  • FIG. 4 is a schematic diagram of an on-chip multi-core structure of 16+1 cores connected by using an h-tree according to an embodiment of the present invention.
  • the root node of the h-tree is a central tile, which is a starting point of data distribution;
  • the leaf node of the h-tree is Leaf tile, which is the end point of data publishing;
  • the remaining intermediate nodes are hubs for transmitting and distributing data;
  • the 16 leaf tiles in the figure are divided into 8 groups, and the number of leaf tiles in each group is 2, and the hub is separately connected with each group of leaf tiles through the forwarding module, and the communication composed of each group of leaf tiles
  • the structure has self-similarity, and the plurality of leaf tiles and the central tile are connected in a complete binary tree manner by the plurality of the transponder modules; the device implements broadcasting or multicasting from a data center to the processing unit The case of publishing data.
  • Figure 2 shows a schematic diagram of a hub structure.
  • the hub is composed of a hub_one_to_two module.
  • Hub_one_to_two divides a set of full-bandwidth input data 20 into two sets of full-bandwidth data 21 and 22 outputs for transmission from the central tile to the leaf tile.
  • the hub_one_to_two module labeled 310 when the hub_one_to_two module labeled 310 has sent data and data valid signals to the bus, the data receiver 0 labeled 320 and the data receiver 1 labeled 330 have prepared the data for reception.
  • the handshake protocol is considered successful: the beat 310 considers that the data receivers, 320 and 330, have received the data, while the next shots 320 and 330 store the data on the beat bus in its own buffer.
  • the second buffer Since the second buffer has 420 of the local cache already stored data, it sends the data and its valid signal to the bus in the direction of the next level 430 and 431, and this The data ready to receive signal of hub1_0 marked with 430 and hub1_1 labeled 431 is also high.
  • 430 and 431 of the next layer are successfully handshaked, at the third beat, 430 and 431 store data from the bus. It is temporarily stored in the local cache, and is executed in sequence, and each beat of the data goes further from the upper layer to the next layer.
  • the handshake is unsuccessful, the data of 520 cannot be transmitted to the next level 530 and 531, and stays in the local cache of 520. At this time, 520 cannot send data to receive the signal, and in the following time, since the local cache of 510 is empty, It can receive new data again, but since 520 does not send data to receive the signal, the handshake between 520 and 510 is unsuccessful, that is, the data of 510 cannot be sent to 520, thereby ensuring the security of the data in the local cache of 520, thereby This enables the reliability of data transmission to be achieved.
  • FIG. 9 is a schematic diagram of an on-chip multi-core structure of 64+1 cores connected by using an x-tree according to an embodiment of the present invention.
  • the root node of the x-tree is a central tile, which is a starting point of data publishing; and the leaf node of the x-tree is a leaf.
  • the central tile broadcast data of A10 is initialized to initialize all leaf tiles.
  • the local caches of all hubs and leaf tiles are empty, and the data ready to receive signals are high, and the data is directly connected to A10.
  • Hub0_0 labeled A20, has the same data ready to receive signal as high.
  • A10 prepares the data and sets it and the data valid signal high. Since the data of the hub0_0 of the mark A20 is ready to receive the signal high, the handshake between A10 and A20 is successful, and in the second beat, the data of A20 will be Stored in the local cache from the bus for temporary storage.
  • the second buffer Since the second buffer has data stored in the local buffer of the A20, it sends the data and its valid signal to the bus in the direction of the next level A30, A31, A32, A33.
  • the data ready to receive signals of hub1_0 marked A30, hub1_1 marked A31, hub1_2 marked A32, and hub1_3 labeled A33 are also high, when A20 and A30, A31, A32 of the next layer are taken.
  • A33 handshake is successful.
  • A30, A31, A32, and A33 store the data from the bus into its local cache for temporary storage, and execute it in sequence. Each beat of the data goes further from the previous layer to the next layer.
  • the hub is a non-leaf node
  • the leaf tile is a leaf node
  • the node with the same height in the tree is the same.
  • the clocks are sequentially incremented counterclockwise, and the hub is named by the combination of its number of layers and the serial number.
  • the flag 910 is hub0_0, that is, the node 0 of the first layer
  • the flag 920 is hub1_0, that is, the node 0 of the second layer
  • the flag 921 is Hub1_1, the node 1 of the second layer.
  • each leaf tile when the data arrives at each leaf tile, it is full bandwidth. Assume that the default bandwidth of each leaf tile is 16 bits of data, as shown in Figure 11, it can be from the full bandwidth according to its id number. In the data, the data is multicast to itself, and the position of the data in the full bandwidth is [id*16: id*16+15]. For example, data D0 with id number 63 is located at data[1023:1008], and data D0 with id number 0 is located at data[15:0].

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Multi Processors (AREA)

Abstract

本发明提出基于分形树结构的数据发布装置、方法、控制装置及智能芯片，该装置包括一中心节点，其为所述片上网络的通信数据中心，用于向所述多个叶子节点进行通信数据的广播或多播；多个叶子节点，其为所述片上网络的通信数据节点，用于向所述中心叶子节点进行通信数据的传递；转发器模块，用于连接所述中心节点与所述多个叶子节点，通信数据通过所述转发模块进行转发；将所述多个叶子节点分为N组，每组中叶子节点的个数相同，所述中心节点通过所述转发模块单独与每一组叶子节点进行通信连接，每组叶子节点构成的通信结构具有自相似性，所述多个叶子节点与所述中心节点通过多层所述转发器模块以完全多叉树方式进行通信连接。

Description

基于分形树结构的数据发布装置、方法、控制装置及智能芯片 技术领域
本发明涉及智能设备、无人驾驶、片上网络数据传输等技术领域，特别涉及基于分形树结构的数据发布装置、方法、控制装置及智能芯片。
背景技术
广播是指对网络中限定范围内，即广播域上，所有设备进行数据传输的一种方式；多播是指对网络中一台或者多台主机进行数据传输的一种方式。片上网络是基于多处理器技术的一种新型的计算机集成形式，可以在并发和非阻塞交换中获得更高的带宽的同时，适应现在复杂SoC设计中常使用的多异步时钟，但是由于在数据打包、缓冲、同步和接口中增加了延迟，使得片上广播对于每个核的延迟不同，如图1所示环形片上的网络结构示意图，其中，将所有tile(节点)相连成环，相邻tile可以直接传输数据，但是对角tile通信延迟较长，导致广播时，数据到达每个节点的延迟不同。
为了减少数据在打包、缓冲、同步和接口中的延迟，数据在各节点中最好以流水的方式传输。数据流水传输是指，节点在一个节拍内接受数据后，不停歇的在下一个节拍把数据发送给下一个节点，如果在各节点间中不具有一致的网络通信协议，各节点中缺乏协作，数据流水在执行中可能会发生数据冲突和丢失，那么芯片内的数据传输将是不可靠的，在特定实例中，由于数据发送方无法得知数据接收方是否已经从缓冲区域取走数据，则会将下一个数据发送至数据接收方的缓冲区域，此时原数据将被新数据冲刷更新而丢失。
现有技术对片上多核之间的广播和多播通信方式都缺乏有效地支持，因此，提供一种同时支持广播和多播通信方式的同步的、流水的、可靠的方式就尤为迫切。
发明公开
针对现有技术的不足，本发明提出特别涉及基于分形树结构的数据发布装置、方法、控制装置及智能芯片，用于将中心数据发布至数据处理设备内高速 缓存中。
本发明提出一种基于分形树网络结构的数据发布装置，包括：
一中心节点，其为所述片上网络的通信数据中心，用于向多个叶子节点进行通信数据的广播或多播；
多个叶子节点，其为所述片上网络的通信数据节点，用于向所述中心叶子节点进行通信数据的传递；
转发器模块，用于连接所述中心节点与所述多个叶子节点，通信数据通过所述转发模块进行转发；
将所述多个叶子节点分为N组，每组中叶子节点的个数相同，所述中心节点通过所述转发器模块单独与每一组叶子节点进行通信连接，每组叶子节点构成的通信结构具有自相似性，所述多个叶子节点与所述中心节点通过多层所述转发器模块以完全多叉树方式进行通信连接。
还包括每个节点包括本地高速缓存结构，用于存储所述中心节点发布数据的子集；
每个叶子节点均有id标识，且所述id标识从完全多叉树的拓扑一侧按序依次增加序号；
所述数据发布装置共享一个时钟信号。
所述转发器模块包括本地高速缓存结构，用于存储数据。
本发明还提出一种利用所述数据发布装置的数据发布方法，包括通过所述中心节点将通信数据向所述多个叶子节点进行发布，其中，数据发送方准备好发送数据后，发送数据有效信号，并将数据置于总线；数据接收方准备好接收数据后，发送数据准备接收信号；当所述数据有效信号与所述数据准备接收信号双方检测到后，数据发送方认为数据已经发出，且被数据接收方接收。
还包括：当从所述中心节点将通信数据向所述多个叶子节点之间进行广播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发模块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
还包括：如果下一时钟节拍数据发送方与数据接收方握手协议成功，则数据以流水方式进入数据接收方的局部缓存中存储；如果握手协议不成功，则数据在当前层的局部缓存中保存，且使得当前层作为上一层的数据接收方，并停止发送数据准备接收信号，使得当前层的局部缓存中的数据停止更新，数据一 直保存在当前层，直到握手协议成功。
还包括：当所述中心节点将通信数据向所述多个叶子节点之间进行多播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发器模块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
还包括：在接收的数据时，所述叶子节点根据与其相对应的id标识选取预设带宽的数据。
本发明还提出一种包含所述数据发布装置的控制装置。
本发明还提出一种包含所述控制装置的智能芯片。
附图简要说明
图1为现有技术的环型片上网络结构示意图；
图2为本发明的hub_one_to_two结构示意图；
图3为本发明的hub_one_to_two与数据接收方握手的行为示意图；
图4为本发明的一个实施例中使用h-tree连接的16+1个核的片上多核结构示意图；
图5为本发明的另一个实施例中数据在hub中传输的行为示意图；
图6为本发明的h-tree结构的展开成完全二叉树拓扑的结构示意图；
图7为本发明的另一个实施例中在h-tree上，全带宽的数据与对应每个leaf tile的数据段的示意图。
图8为本发明的一个实施例中使用x-tree连接的64+1个核的片上多核结构示意图；
图9为本发明的另一个实施例中数据在hub中传输的行为示意图；
图10为本发明的x-tree结构的完全四叉树拓扑的结构示意图；
图11为本发明的另一个实施例中，在x-tree上，全带宽的数据与对应每个leaf tile的数据段的示意图。
实现本发明的最佳方式
本发明提出一种基于分形树网络结构的数据发布装置，包括：
一中心节点，其为所述片上网络的通信数据中心，用于向所述多个叶子节 点进行通信数据的广播或多播；
多个叶子节点，其为所述片上网络的通信数据节点，用于向所述中心叶子节点进行通信数据的传递；
转发器模块，用于连接所述中心节点与所述多个叶子节点，通信数据通过所述转发模块进行转发；
将所述多个叶子节点分为N组，每组中叶子节点的个数相同，所述中心节点通过所述转发模块单独与每一组叶子节点进行通信连接，每组叶子节点构成的通信结构具有自相似性，所述多个叶子节点与所述中心节点通过多层所述转发器模块以完全多叉树方式进行通信连接。
每个节点包括本地高速缓存结构，用于存储所述中心节点发布数据的子集；
每个叶子节点均有id标识，且所述id标识从完全多叉树的拓扑一侧按序依次增加序号。
所述数据发布装置共享一个时钟信号。
所述转发器模块包括本地高速缓存结构，用于存储数据。
本发明还提出一种利用所述数据发布装置的数据发布方法，通过所述中心节点将通信数据向所述多个叶子节点进行发布，其中，数据发送方准备好发送数据后，发送数据有效信号，并将数据置于总线；数据接收方准备好接收数据后，发送数据准备接收信号；当所述数据有效信号与所述数据准备接收信号双方检测到后，数据发送方认为数据已经发出，且被数据接收方接收。
当从所述中心节点将通信数据向所述多个叶子节点之间进行广播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发模块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
如果下一时钟节拍数据发送方与数据接收方握手协议成功，则数据以流水方式进入数据接收方的局部缓存中存储；如果握手协议不成功，则数据在当前层的局部缓存中保存，且使得当前层作为上一层的数据接收方，并停止发送数据准备接收信号，使得当前层的局部缓存中的数据停止更新，数据一直保存在当前层，直到握手协议成功。
当所述中心节点将通信数据向所述多个叶子节点之间进行多播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发器模块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
在接收的数据时，所述叶子节点根据与其相对应的id标识选取预设带宽的数据。
本发明还提出一种包含所述数据发布装置的控制装置。
本发明还提出一种包含所述控制装置的智能芯片。
下面结合附图对本发明做进一步的详细说明，以令本领域技术人员参照说明书文字能够据以实施。
附图4为本发明的一个实施例中使用h-tree连接的16+1个核的片上多核结构示意图，h树的根节点为central tile，其为数据发布的起点；h树的叶子节点为leaf tile，其为数据发布的终点；其余的中间节点为hub，用于传输并分发数据；
将图中16个leaf tiles分为8组，每组中leaf tile的个数均为2，所述hub通过所述转发模块单独与每一组leaf tile进行通信连接，每组leaf tile构成的通信结构具有自相似性，所述多个leaf tile与所述central tile通过多层所述转发器模块以完全二叉树方式进行连接；此设备实现了从一个数据中心以广播或者多播的方式向处理单元发布数据的情况。
附图2表示了hub结构示意图，hub由hub_one_to_two模块构成，hub_one_to_two将一组全带宽的输入数据20分成两组全带宽的数据21和22输出，用于从central tile到leaf tile的传输。
如图3所示，当标记为310的hub_one_to_two模块已经将数据与数据有效信号发至总线上，且标记为320的数据接收方0与标记为330的数据接收方1已经将数据准备接收信号发至总线时，此时握手协议才算成功：此拍310认为数据接收方，即320和330，已经接收数据，而下一拍320和330将此拍总线上的数据存入自己的缓冲区。
如图4所示，标记410的central tile广播数据来初始化全部的leaf tile，此时所有hub和leaf tile的局部缓存均为空，其数据准备接收信号均为高，此时 与410直接相连的标记为420的hub0_0其数据准备接收信号同样为高。在第一拍时，410准备好数据，将其和数据有效信号置高，由于标记420的hub0_0此时的数据准备接收信号为高，410与420握手成功，在第二拍时，420将数据从总线存入其局部缓存中暂时存储，由于第二拍时，420的局部缓存中已经存有数据，它将数据及其有效信号发送至向下一级430与431方向的总线上，而此时标记为430的hub1_0与标记为431的hub1_1的数据准备接收信号也为高，当拍420与下一层的430和431握手成功，在第三拍时，430与431将数据从总线存入其局部缓存中暂时存储，依次执行，数据每一拍都从上一层向下一层行进一步。在此实例中，以430的hub1_0至标记为460的leaf tile0分支为例，在第四拍时，数据流入标记为440的hub2_0的局部缓存中暂时存储；在第五拍时，数据流入标记为450的hub3_0的局部缓存中暂时存储；在第六拍是，450通过两个输入端口在握手协议成功后分别将全带宽的数据存储到与其相连的一组leaf tile的局部缓存中，此时数据到达标记为460的leaf tile0。由此，在数据通路顺畅的情况下，数据的按层级流水传输得以保证。
如图5所示，此一实例以hub1_0作例，当如下情况发生时，数据将滞留在hub中，在第一拍时，标记为520的hub1_0收到来自标记为510的hub0_0的数据，此时，520将数据与其数据有效信号置于向下一层530与531方向的总线上。现设置情景如下，此时标记为530的hub2_0与标记为531的hub2_1此时并未发出数据准备信号，并在之后时间内一直保持这样的状况，此时由于520与下一层的530和531握手不成功，520的数据无法传输给下一级530与531，并滞留于520的局部缓存中，此时520无法发送数据准备接收信号，在之后的时间内，由于510的局部缓存为空，其又可以接收新的数据，但由于520并未发送数据准备接收信号，导致520与510握手不成功，即510的数据无法发送至520，保证了520的局部缓存中的数据的安全性，从而，使得数据传输的可靠性得以实现。
如图5所示，此一实例以hub1_0作例，当如下情况发生时，hub将可以流水传输数据，在第一拍时，标记为520的hub1_0收到来自标记为510的hub0_0的数据，此时，520将数据与其数据有效信号置于向下一层530与531方向的总线上。现设置情景如下，此时标记为530的hub2_0与标记为531的hub2_1此时发出数据准备信号，并在之后时间内一直保持这样的状况，此时 由于520与下一层的530和531握手成功，520的数据传输给下一级530与531，此时520已经可以发送数据准备接收信号，若此时510的局部缓存已经准备好新的数据，并将数据与与其数据有效信号置于向520方向的总线上，在当拍，由于520发送数据准备接收信号，520与510握手成功，在第二拍，520将510传输过来的数据存于局部缓存中，并将数据及其有效信号置于向下一层530与531方向的总线上，由此，可见，hub在数据通路舒畅即数据源充足的情况下，可以进行流水传输数据。
如图6所示，假设有16个leaf tile，将h树以完全二叉树的拓扑展开，hub为非叶节点，而leaf tile为叶节点，将在树中高度相同的节点都从左到右依次增序，hub以其层数与序号相结合命名，如标记610为hub0_0，即第一层的0号节点，标记620为hub1_0，即第二层的0号节点，标记621为hub1_1，即第二层的1号节点。
如图6所示，在一实施例中，标记60的central tile多播数据来初始化全部的leaf tile，此时所有hub和leaf tile的局部缓存均为空，其数据准备接收信号均为高，即数据通路顺畅，按数据流水传输，在第一拍时，60与610握手成功，在第二拍时，610将数据从总线存入其局部缓存中暂时存储，当拍610与下一层的620和621握手成功，在第三拍时，620与621将数据从总线存入其局部缓存中暂时存储，当拍620与下一层的630和631握手成功，621与下一层的632和633握手成功，在第四拍时，630，631，632，633将数据从总线存入其局部缓存中暂时存储，630与下一层的640和641握手成功，631与下一层的642和643握手成功，632与下一层的644和645握手成功，633与下一层的646和647握手成功，在第五拍时，640，641，642，643，644，645，646，647将数据从总线存入其局部缓存中暂时存储，640与下一层的650和651握手成功，641与下一层的652和653握手成功，642与下一层的654和655握手成功，643与下一层的656和657握手成功，644与下一层的658和659握手成功，645与下一层的65a和65b握手成功，646与下一层的65c和65d握手成功，647与下一层的65e和65f握手成功，在第六拍时，数据同时存储至所有leaf tile，650，651，652，653，654，655，656，657，658，659，65a，65b，65c，65e，65f的局部缓存中，由此可见，数据从中心向叶子节点广播的数据在数据通路顺畅的情况下可以同时到达，数据的同步性得以实现。
在上一实例中，数据到达每个leaf tile时都是全带宽的，假设如图7所示，每个leaf tile的预设带宽均为16位数据，则其可以按照其id序号从全带宽的数据中取得对自己多播的数据，数据在全带宽中的位置为[id*16：id*16+15]。如id序号为15的数据D0，位于data[255：240]，而id序号为0的数据D0，位于data[15：0]。
图9为本发明的一个实施例中使用x-tree连接的64+1个核的片上多核结构示意图，x树的根节点为central tile，其为数据发布的起点；x树的叶子节点为leaf tile，其为数据发布的终点；其余的中间节点为hub，用于传输并分发数据；将图中64个leaf tiles分为16组，每组中leaf tile的个数均为4，所述hub通过所述转发模块单独与每一组leaf tile进行通信连接，每组leaf tile构成的通信结构具有自相似性，所述多个leaf tile与所述central tile通过多层所述转发器模块以完全四叉树方式进行连接；此设备实现了从一个数据中心以广播或者多播的方式向处理单元发布数据的情况。
图8表示了hub结构示意图，hub由hub_one_to_four模块构成，hub_one_to_four将一组全带宽的输入数据800分成四组全带宽的数据801、802、803和804输出，用于从central tile到leaf tile的传输。
如图10所示，标记A10的central tile广播数据来初始化全部的leaf tile，此时所有hub和leaf tile的局部缓存均为空，其数据准备接收信号均为高，此时与A10直接相连的标记为A20的hub0_0其数据准备接收信号同样为高。在第一拍时，A10准备好数据，将其和数据有效信号置高，由于标记A20的hub0_0此时的数据准备接收信号为高，A10与A20握手成功，在第二拍时，A20将数据从总线存入其局部缓存中暂时存储，由于第二拍时，A20的局部缓存中已经存有数据，它将数据及其有效信号发送至向下一级A30、A31、A32、A33方向的总线上，而此时标记为A30的hub1_0、标记为A31的hub1_1、标记为A32的hub1_2、标记为A33的hub1_3的数据准备接收信号也为高，当拍A20与下一层的A30、A31、A32、A33握手成功，在第三拍时，A30、A31、A32、A33将数据从总线存入其局部缓存中暂时存储，依次执行，数据每一拍都从上一层向下一层行进一步。在此实例中，以A33的hub1_3至标记为A50的leaf tile48分支为例：在第四拍时，数据流入标记为A40的hub2_12的局部缓存中暂时存储；在第五拍时，A40通过四个输入端口在握手协议成功后分别将全带 宽的数据存储到与其相连的一组，即4个leaf tile的局部缓存中，包括A50、A51、A52、A53；此时数据到达标记为A50的leaf tile48。由此，在数据通路顺畅的情况下，数据的按层级流水传输得以保证。
如图9所示，假设有64个leaf tile与一个central tile，通过x树以完全四叉树为拓扑连接，hub为非叶节点，而leaf tile为叶节点，将在树中高度相同的节点都逆时针依次增序，hub以其层数与序号相结合命名，如标记910为hub0_0，即第一层的0号节点，标记920为hub1_0，即第二层的0号节点，标记921为hub1_1，即第二层的1号节点。
如图9所示，在一实施例中，标记90的central tile多播数据来初始化全部的leaf tile，此时所有hub和leaf tile的局部缓存均为空，其数据准备接收信号均为高，即数据通路顺畅，按数据流水传输，在第一拍时，90与910握手成功；在第二拍时，910将数据从总线存入其局部缓存中暂时存储，当拍910与下一层的920、921、922和923握手成功；在第三拍时，920、921、922和923将数据从总线存入其局部缓存中暂时存储，当拍920与下一层的930、931、932和933握手成功，921与下一层的934、935、936和937握手成功，922与下一层的938、939、93a和93b握手成功，923与下一层的93c、93d、93e和93f握手成功；在第四拍时，930，931，932，933，934、935、936、937、938、939、93a、93b、93c、93d、93e和93f将数据从总线存入其局部缓存中暂时存储，930与下一层的940、941、942和943握手成功，931与下一层的944、945、946和947握手成功，932与下一层的948、949、950和951握手成功，933与下一层的952、953、954和955握手成功，934与下一层的956、957、958和959握手成功，935与下一层的960、961、962和963握手成功，936与下一层的964、965、966和967握手成功，937与下一层的968、969、970和971握手成功，938与下一层的972、973、974和975握手成功，939与下一层的976、977、978和979握手成功，93a与下一层的980、981、982和983握手成功，93b与下一层的984、985、986和988握手成功，93c与下一层的988、989、990和991握手成功，93d与下一层的992、993、994和995握手成功，93e与下一层的996、997、998和999握手成功，93f与下一层的9a0、9a1、9a2和9a3握手成功；在第五拍时，数据同时存储至所有leaf tile，940～9a3的局部缓存中，由此可见，数据从中心向叶子节点广播的数据在数据 通路顺畅的情况下可以同时到达，数据的同步性得以实现。
在上一实例中，数据到达每个leaf tile时都是全带宽的，假设如图11所示，每个leaf tile的预设带宽均为16位数据，则其可以按照其id序号从全带宽的数据中取得对自己多播的数据，数据在全带宽中的位置为[id*16：id*16+15]。如id序号为63的数据D0，位于data[1023：1008]，而id序号为0的数据D0，位于data[15：0]。
工业应用性
本发明能够以同步的、流水的、可靠的方式在片上网络上实现广播和多播等操作，提高广播通讯和多播通讯的效率，使得通信的吞吐率大大提高，并在通信协议的保证下，使得数据传输得以安全地传输给各分支节点，做到数据的一致性和无差错，从而获得比现有技术更好的通讯效果。

Claims (10)

  1. 一种基于分形树网络结构的数据发布装置，其特征在于，包括：
    一中心节点，其为所述片上网络的通信数据中心，用于向多个叶子节点进行通信数据的广播或多播；
    多个叶子节点，其为所述片上网络的通信数据节点，用于向所述中心叶子节点进行通信数据的传递；
    转发器模块，用于连接所述中心节点与所述多个叶子节点，通信数据通过所述转发模块进行转发；
    将所述多个叶子节点分为N组，每组中叶子节点的个数相同，所述中心节点通过所述转发器模块单独与每一组叶子节点进行通信连接，每组叶子节点构成的通信结构具有自相似性，所述多个叶子节点与所述中心节点通过多层所述转发器模块以完全多叉树方式进行通信连接。
  2. 如权利要求1所述的基于分形树网络结构的数据发布装置，其特征在于，包括每个节点包括本地高速缓存结构，用于存储所述中心节点发布数据的子集；
    每个叶子节点均有id标识，且所述id标识从完全多叉树的拓扑一侧按序依次增加序号；
    所述数据发布装置共享一个时钟信号。
  3. 如权利要求1所述的基于分形树网络结构的数据发布装置，其特征在于，所述转发器模块包括本地高速缓存结构，用于存储数据。
  4. 一种利用如权利要求1或2或3所述数据发布装置的数据发布方法，其特征在于，通过所述中心节点将通信数据向所述多个叶子节点进行发布，其中，数据发送方准备好发送数据后，发送数据有效信号，并将数据置于总线；数据接收方准备好接收数据后，发送数据准备接收信号；当所述数据有效信号与所述数据准备接收信号双方检测到后，数据发送方认为数据已经发出，且被数据接收方接收。
  5. 如权利要求3所述的数据发布方法，其特征在于，包括：
    当从所述中心节点将通信数据向所述多个叶子节点之间进行广播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发模 块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
  6. 如权利要求5所述的数据发布方法，其特征在于，包括：
    如果下一时钟节拍数据发送方与数据接收方握手协议成功，则数据以流水方式进入数据接收方的局部缓存中存储；如果握手协议不成功，则数据在当前层的局部缓存中保存，且使得当前层作为上一层的数据接收方，并停止发送数据准备接收信号，使得当前层的局部缓存中的数据停止更新，数据一直保存在当前层，直到握手协议成功。
  7. 如权利要求4所述的数据发布方法，其特征在于，包括：
    当所述中心节点将通信数据向所述多个叶子节点之间进行多播时，首先数据通过握手协议从所述中心节点进入与所述中心节点直接相连的所述转发器模块的局部缓存中暂时存储，每次握手协议成功后，进入下一层中间转发器模块局部缓存中暂时存储，最后输入与所述叶子节点直接相连的转发器模块，并由转发器模块分别发布给与其相连的一组叶子节点。
  8. 如权利要求7所述的数据发布方法，其特征在于，包括：
    在接收的数据时，所述叶子节点根据与其相对应的id标识选取预设带宽的数据。
  9. 一种包含如权利要求1所述数据发布装置的控制装置。
  10. 一种包含如权利要求9所述控制装置的智能芯片。
PCT/CN2016/086093 2015-12-24 2016-06-17 基于分形树结构的数据发布装置、方法、控制装置及智能芯片 WO2017107410A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US15/781,608 US10904034B2 (en) 2015-12-24 2016-06-17 Fractal tree structure-based data transmit device and method, control device, and intelligent chip
US17/100,570 US11616662B2 (en) 2015-12-24 2020-11-20 Fractal tree structure-based data transmit device and method, control device, and intelligent chip

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510983306.8A CN105634960B (zh) 2015-12-24 2015-12-24 基于分形树结构的数据发布装置、方法、控制装置及智能芯片
CN201510983306.8 2015-12-24

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US15/781,608 A-371-Of-International US10904034B2 (en) 2015-12-24 2016-06-17 Fractal tree structure-based data transmit device and method, control device, and intelligent chip
US17/100,570 Division US11616662B2 (en) 2015-12-24 2020-11-20 Fractal tree structure-based data transmit device and method, control device, and intelligent chip

Publications (1)

Publication Number Publication Date
WO2017107410A1 true WO2017107410A1 (zh) 2017-06-29

Family

ID=56049478

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/086093 WO2017107410A1 (zh) 2015-12-24 2016-06-17 基于分形树结构的数据发布装置、方法、控制装置及智能芯片

Country Status (3)

Country Link
US (2) US10904034B2 (zh)
CN (1) CN105634960B (zh)
WO (1) WO2017107410A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105550157B (zh) 2015-12-24 2017-06-27 中国科学院计算技术研究所 一种分形树结构通信结构、方法、控制装置及智能芯片
CN105634960B (zh) 2015-12-24 2017-04-05 中国科学院计算技术研究所 基于分形树结构的数据发布装置、方法、控制装置及智能芯片
CN112631982A (zh) * 2020-12-25 2021-04-09 清华大学 基于众核架构的数据交换方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7502769B2 (en) * 2005-01-31 2009-03-10 Knowmtech, Llc Fractal memory and computational methods and systems based on nanotechnology
CN105046109A (zh) * 2015-06-26 2015-11-11 四川云合创智科技有限公司 一种用于生物信息序列分析的加速平台
CN105550157A (zh) * 2015-12-24 2016-05-04 中国科学院计算技术研究所 一种分形树结构通信结构、方法、控制装置及智能芯片
CN105630733A (zh) * 2015-12-24 2016-06-01 中国科学院计算技术研究所 分形树中向量数据回传处理单元的装置、方法、控制装置及智能芯片
CN105634960A (zh) * 2015-12-24 2016-06-01 中国科学院计算技术研究所 基于分形树结构的数据发布装置、方法、控制装置及智能芯片

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020174207A1 (en) * 2001-02-28 2002-11-21 Abdella Battou Self-healing hierarchical network management system, and methods and apparatus therefor
US7769891B2 (en) * 2007-08-27 2010-08-03 International Business Machines Corporation System and method for providing multiple redundant direct routes between supernodes of a multi-tiered full-graph interconnect architecture
CN102025614B (zh) * 2010-11-25 2013-01-30 浙江大学 一种线上可重构的4元树状片上网络系统及其重构方法
CN102546380B (zh) * 2010-12-30 2014-12-10 世意法（北京）半导体研发有限责任公司 修改的基于树的多播路由方案
US9473388B2 (en) * 2013-08-07 2016-10-18 Netspeed Systems Supporting multicast in NOC interconnect
WO2016151674A1 (ja) * 2015-03-20 2016-09-29 ルネサスエレクトロニクス株式会社 データ処理装置
CN105119833B (zh) * 2015-09-08 2018-05-01 中国电子科技集团公司第五十八研究所 一种用于片上网络的混合互连结构、其网络节点编码方法及其混合路由算法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7502769B2 (en) * 2005-01-31 2009-03-10 Knowmtech, Llc Fractal memory and computational methods and systems based on nanotechnology
CN105046109A (zh) * 2015-06-26 2015-11-11 四川云合创智科技有限公司 一种用于生物信息序列分析的加速平台
CN105550157A (zh) * 2015-12-24 2016-05-04 中国科学院计算技术研究所 一种分形树结构通信结构、方法、控制装置及智能芯片
CN105630733A (zh) * 2015-12-24 2016-06-01 中国科学院计算技术研究所 分形树中向量数据回传处理单元的装置、方法、控制装置及智能芯片
CN105634960A (zh) * 2015-12-24 2016-06-01 中国科学院计算技术研究所 基于分形树结构的数据发布装置、方法、控制装置及智能芯片

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LI, JIAXIN ET AL.: "Research on Ergodic Property and Streaming Model of Triplet-Based Interconnection Network", TRANSACTIONS OF BEIJING INSTITUTE OF TECHNOLOGY, vol. 30, no. 6, 30 June 2010 (2010-06-30) *

Also Published As

Publication number Publication date
US10904034B2 (en) 2021-01-26
US20200084065A1 (en) 2020-03-12
CN105634960B (zh) 2017-04-05
US20210075639A1 (en) 2021-03-11
CN105634960A (zh) 2016-06-01
US11616662B2 (en) 2023-03-28

Similar Documents

Publication Publication Date Title
US11616662B2 (en) Fractal tree structure-based data transmit device and method, control device, and intelligent chip
US8379642B2 (en) Multicasting using a multitiered distributed virtual bridge hierarchy
EP2740048B1 (en) Reverse path forwarding lookup with link bundles
EP2843906B1 (en) Method, apparatus, and system for data transmission
EP2721773A1 (en) Load balancing based on trill
CN104272679A (zh) 通信系统、控制装置、通信方法以及程序
CN105144639B (zh) 在覆盖网络中至双重连接(vpc)的主机的有效组播传送
CA2897118A1 (en) System and method for providing p2p based reconfigurable computing and structured data distribution
CN106254254B (zh) 一种基于Mesh拓扑结构的片上网络通信方法
CN103595627A (zh) 基于多播维序路由算法的NoC路由器及其路由算法
EP3213441B1 (en) Redundancy for port extender chains
WO2017050036A1 (zh) 资源配置信息的发送、数据分发方法及装置
CN110493137A (zh) 一种基于固定路由网络的分层广播方法、装置及系统
CN109302350B (zh) 一种基于光电组播混合网络架结构的调度方法
CN104796343A (zh) 一种基于片上网络的通信结构
US10805233B2 (en) Fractal-tree communication structure and method, control apparatus and intelligent chip
CN105530157A (zh) Afdx网络交换机多个虚拟链路共享信用的方法
CN105282036A (zh) 一种路由节点、路由交换方法及系统
CN102843247A (zh) 一种网元消息并发处理方法及系统
CN106254243B (zh) 一种报文转发方法及装置
JP2009260750A (ja) 経路設定方法および経路設定装置
CN103457844A (zh) 多Infiniband网关的vNIC绑定方法
CN108737265B (zh) 软件定义的无线网络系统及其管理方法
JP5374290B2 (ja) ネットワーク中継装置
CN106161236A (zh) 报文转发方法和装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 16877223

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 16877223

Country of ref document: EP

Kind code of ref document: A1