| 摘要 |
PROBLEM TO BE SOLVED: To speedily reach a stable point while maintaining a past history by adapting current priority as subsequent priority to next channel allocation each time the frequency of priority alteration by the allocation of each channel reaches the upper-limit value of a counter. SOLUTION: At a channel request, a channel selector 11 scans a priority-by- channel display part 6i to select the channel of top priority and when the channel is free, the selector makes a▵P(a) arithmetic part 12 increase a priority storage part 9 of the priority-by-channel display part for the corresponding channel while indicating the use of the channel. If the channel is in use, a▵P'(a) subtraction part 13 is made to decrease the priority storage part 9 of the display part. When the priority is scanned, each priority-by-channel display part 6i reads the priority storage part 9 until the counter value (a) reaches 1st (n), and then reads a priority fixation part 8 thereafter and perform the increase or decrease of the priority storage part 9.
|
