JP2566350B2 - Data way device - Google Patents

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention connects a node to which a controller is connected to a plurality of local area networks, provides each node with a memory of the same structure, and uses a cyclic map, that is, transmission area information assigned to each node. A dataway device which is a node having a function necessary for performing cyclic communication in which transmission areas assigned to nodes are sequentially broadcasted and other nodes receive the same and store them in a predetermined area of a memory Is.

[0002]

2. Description of the Related Art FIG. 7 is an explanatory diagram of a conventional data way device for performing cyclic communication.
Reference numerals 2 and 3 are nodes equipped with a cyclic memory 11 for storing cyclic data to be transmitted and received cyclic data, and these nodes 1, 2 and 3 are connected to a local area network 5. A controller 6 is connected to each of the nodes 1, 2 and 3 to control the node.

All nodes of the cyclic memory 11 have the same memory, and an area is assigned to each node. When data is written in an area to which a node is assigned, the data is reflected in the same area of the cyclic memory 11 of all the nodes.

In the conventional cyclic communication, an application installed in each controller 6 by fixedly allocating the cyclic memory 11 as shown in FIG. 9 according to a cyclic map showing allocation of the cyclic memory 11 in FIG. Was being created. For example, node 1
Cyclic memory 11 is from address 100H to 10
Data to be transmitted is stored in the area up to H and is transmitted to the same area of the cyclic memory 11 of each node by the local area network 5. Similarly, each node is also equipped with an application according to the cyclic map of FIG. 8 and performs cyclic communication.

[0005]

Since the conventional data way device for performing cyclic communication, that is, each of the above-mentioned nodes is configured as described above, communication can be performed only with a predetermined cyclic map, and the system When changing the cyclic map such as expansion, reduction or movement of the cyclic area due to expansion or the like, there is a problem that the system is forced to stop or the application is changed, resulting in lack of flexibility.

The present invention has been made to solve the above-mentioned problems, and even if the cyclic area is changed due to system expansion or the like, it is possible to change the cyclic area in an online state. It is an object to obtain a data way device having a cyclic map management system.

[0007]

A data way device according to the present invention includes a cyclic map control unit for controlling management / monitoring of cyclic map information from an information processing device and cyclic communication, and power ON / OFF. Memory for storing the cyclic map information, a cyclic memory for storing the cyclic data from the controller and the cyclic data received from the local area network, and a cyclic memory for storing the current cyclic map information. A node with a click map table.

[0008]

The data way device according to the present invention centrally manages the cyclic map by allowing the creation of the cyclic map only in the information processing device, and when a node having a different cyclic map joins the network, The cyclic map control unit unifies to the latest version of the cyclic map, and by notifying the controller of the latest cyclic map, it is possible to change the cyclic area while online and to build a flexible system. It will be possible.

[0009]

FIG. 1 is a block diagram of cyclic communication showing an embodiment of the present invention. In FIG. 1, 5 is a local area network connecting nodes 1, 2, 3, 4 and 6 is each of the nodes. A controller that is connected to each of 1, 2, 3, 4 and controls a node, and 7 is an information processing device that creates cyclic map information to be set in the node.

Each of the nodes 1, 2, 3 and 4 has a tool I / I for interfacing with the information processing device 7.
F unit 8, cyclic map control unit 9 for controlling cyclic map management / monitoring and cyclic communication, memory (EEPROM) 10 for storing cyclic map information regardless of power ON / OFF of the node, controller 6 and cyclic data received from the local area network 5, a cyclic memory 11 for storing the cyclic data, and a cyclic map table 1 for storing current cyclic map information.
Have two. Reference numeral 13 is a cyclic map change notification from the cyclic map control unit to the controller 6.

Next, the operation of the above embodiment will be described.
In FIG. 1, nodes 1, 2, 3, and 4 are connected to a local area network 5. At this time, the cyclic map information of FIG. 2 created by the information processing device 7 is stored in the EEPROM 10 and the cyclic map table 12 through the tool I / F unit 8 in each node. EE
The meaning of storing in the PROM10 is the following when the node is started up.
This is because the cyclic map is set not by the information processing device 7 but by the contents of the EEPROM 10.

The structure of the cyclic map information shown in FIG. 2 will be described. The cyclic memory area for each node is represented by the items of the start address and data length of the cyclic area. In addition, the version number is added to each node and the initial value is 1 each time the cyclic area is updated.
Assign the value of all version No + 1. All version numbers indicate the maximum value of each version number. It is possible to know the current updated cyclic map information from all version numbers.

It is assumed that the node 4 newly joins the local area network 5 with the cyclic map information of FIG. 3 in the above state. The cyclic map information of FIG. 3 is obtained by changing the cyclic area of the node 1 and adding the cyclic area of the node 4 of FIG.
By adding this change, the version numbers of the nodes 1 and 4 and all version numbers are set to the value of version No + 1 of FIG. 2 to show that it is a new cyclic map.

When the node 4 joins, arbitration of the cyclic map is performed according to the flow of FIG. First, the cyclic map control unit 9 sends the current version numbers to the other nodes 1, 2, and 3 according to the version number request frame.
Inquire. Since the current all version numbers are "3" as shown in FIG. 2, the cyclic map control unit 9 of the other node replies "3" with the all version number response frame. Node 4 has all version numbers “3” returned and all version numbers of node 4
Compare “4”. In this case, since all the version numbers of the node 4 are larger, it is determined that the cyclic map information of FIG. 3 is the latest.

Since the cyclic map control unit 9 of the node 4 passes the latest cyclic map information of FIG. 3 to each node, first, a cyclic communication stop frame is transmitted by broadcast communication, and each node performs cyclic communication. Stop.
This is to synchronize the cyclic communication before and after changing the cyclic map.

Next, the latest version No frame and the cyclic map information frame are used to transmit the cyclic map information in which all the version numbers in FIG. 3 and the nodes 1 and 4 have been changed.

The cyclic map control units of the nodes 1, 2 and 3 which have received the information store in the EEPROM 10 and the cyclic map table 12, and the cyclic map change notification 13 notifies the controller that the cyclic map has been changed. Notify 6. The controller 6 refers to the cyclic map table 12 to recognize which node's cyclic map has been changed or added and reflect it in the subsequent processing.

For example, since the node 1 has moved the cyclic area, the cyclic data is updated for the moved cyclic area thereafter. If the process for the node 4 is installed in advance, the process is started.

After transmitting the version number and cyclic map information to the nodes 1, 2, and 3, the node 4 transmits a cyclic communication operation start frame by broadcast communication. Each node receiving this frame restarts cyclic communication at once using the cyclic map of FIG.

Next, the case where the node 4 enters with the cyclic map of FIG. 5, which is older than that of FIG. 2, will be described with reference to the flow of FIG. The process up to the comparison of all version numbers is the same as in FIG. When it is determined that the cyclic map information of the node 4 is old as a result of the comparison, the node 4 sends a map information request frame to another node to request the latest information.

The other nodes transmit the latest information by the latest version number and cyclic map information frame. The node 4 stores the received information in the EEPROM 10 and the cyclic map table 12, and notifies the controller 6 by the cyclic map change notification 13. The controller 6 is the cyclic map table 12
Refer to to recognize which node's cyclic map has been changed or added, and reflect it in the subsequent processing.

In the above description, the designation of the cyclic area is represented by the cyclic start address and the data length, but the method is not limited to this as long as the area can be designated. Although the network is described as a ring, the network is not limited to this.

[0023]

As described above, according to the present invention, a cyclic map is centrally managed by permitting the creation of a cyclic map only in the information processing device, and a data way device having different cyclic maps is provided. When a node that joins the network enters the network, the cyclic map control unit unifies it to the latest version of the cyclic map and configured to notify the controller of the latest cyclic map. This makes it possible to build a flexible system.

[Brief description of drawings]

FIG. 1 is a block diagram of a network having a data way device for performing cyclic communication as a node according to an embodiment of the present invention.

FIG. 2 is a cyclic map diagram according to the present invention.

FIG. 3 is a new cyclic map diagram of FIG. 2 according to the present invention.

FIG. 4 is a cyclic map arbitration flow according to the present invention.

FIG. 5 is an old cyclic map diagram of FIG. 2 in the present invention.

FIG. 6 is a cyclic map arbitration flow according to the present invention.

FIG. 7 is a block diagram of a conventional data way device showing the transfer of a transmission right in a network.

FIG. 8 is a cyclic map diagram in conventional cyclic communication.

FIG. 9 is a cyclic allocation diagram in conventional cyclic communication.

[Explanation of symbols]

 1, 2, 3, 4 nodes 5 local area network 6 controller 7 information processing device 9 cyclic map control unit 10 memory (EEPROM) 11 cyclic memory 12 cyclic map table 13 cyclic map change notification

Claims (3)

(57) [Claims] 1. A cyclic map control unit for controlling and monitoring cyclic map information from an information processing device and controlling cyclic communication in a data way device having a local area network in which a plurality of nodes to which a controller is connected are connected. And a memory that stores the cyclic map information regardless of whether the power is on or off,
A cyclic memory for storing cyclic data from the controller and cyclic data received from the local area network, and a cyclic map table for storing current cyclic map information are provided in each of the nodes, and the cyclic memory is provided. A dataway device, wherein a cyclic map change notification is sent from a click map control unit to the controller. 2. The data way device according to claim 1, wherein all cyclic areas of a plurality of nodes can be set from a certain node. 3. The data way device according to claim 1, wherein cyclic map information is set to each node from only one information processing device, and the current cyclic map is centrally managed by the information processing device.