Central clocked event-triggered local modulo-N-counting for bus arbitration

Central clocked local modulo-N-counting methods are presented for fast distributed-bus arbitration. A model with discrete time is introduced for description, presentation, analysis and simulation of these counting techniques. With one or two active units the analytical solutions for the minimum mean transfer time and the maximum throughput of a unit are derived. Simulation results are shown for the mean transfer time with different mean time between the generation of two frames. The distribution of the time between two frame generations is assumed to be of equal size. There is no skew problem on the bus lines, if the receiver capacities are compensated with coils