3500/32 Bently 4-Channel Relay Module

3500/32 Bently 4-Channel Relay Module

3500/32 When a new acquisition cycle is started, the priority level of the acquisition channel is recalculated. Iterate through all channels to find the channel with the highest current priority for acquisition. Chunk the channels (the chunks contain the channels that need to be refreshed the most). Enter a communication loop (some devices require at least two communications for an acquisition, so a communication loop is needed). Send a data request and wait for a response; parse the results according to the returned information and process them accordingly; determine whether the next acquisition is needed, if not, jump out of the loop; update the channel and the acquisition flag; continue to send thread messages to start the next acquisition until the end of a communication loop; until all the channels that need to be acquired have been traversed.

3500/32 existing data exchange process, the data that the user cares about often only accounts for a very small part of all the information, and these collection points are scattered in the massive data, if the data is read sequentially without judgment, the ratio of valid information to the collected information is very low, and the real-time performance is poor; if only the valid information is collected, the granularity of the allocated collection is too small, and it will result in the inefficiency of the system, and the utilization of the channel is Poor channel utilization.

3500/32 transmits the collected information in chunks at a reasonable granularity, taking into account the channel utilization rate and the real-time performance of effective information acquisition; the realized chunking algorithm is briefly described as follows: judging at the time of acquisition, if the activated channels of the register class currently being acquired can be composed into a single data request packet, it will be processed to increase the number of channels to be acquired at one time. According to the channel priority defined by the developer, find out the channels with consecutive (or tight) addresses near the address of the channel with the highest priority, and these channels form a channel block. Repeat the same process to continue chunking the remaining channels until the number of chunks formed is greater than a specified value such as 20 or until all channels in this register have been allocated.