Effectiveness of different methods of microprocessor-based search for a free channel in a fully accessible line bunch

There has been an increased tendency towards the creation of switching units with their own microprocessor-based control devices. A problem is related to the development of an optimal working algorithm for the microprocessors when selecting a free channel (FC) in the switching units they serve. One of the main criteria of algorithm optimality is the maintenance of high-productivity microprocessor operation. The performance of the microprocessor as a controller will largely depend on its operating algorithm. The manner in which the average time T expended by the microprocessor in searching for the free channel in a fully accessible line bunch, depending on the size of the load on one channel a, the bunch size v and the number of bits in the microprocessor data word m when using different algorithms, is investigated.