| 摘要 |
<p>PROBLEM TO BE SOLVED: To perform scheduling within a fixed time, regardless of the number of priority accesses through a decentralized control system by generating an empty flag that represents whether or not a cell that has a static priority is qualified to communicate during a hold time and connecting a priority quene to a priority switch based on the empty flag. SOLUTION: A static priority scheduler 200 selects a cell that exists at the front of the highest priority quene that is not empty according to the order of first-in first-out. Each j-th priority quene 210-j supplies an empty flag EFj to the j-th priority quene 210-j. Here, the empty flag EFj represents whether a qualified cell that should be transmitted to the queue 210-j exists or not and supplies the qualified cell to an input terminal of the j-th priority switch 250-j, when the qualified cell exists. The j-th priority quene switch 250-j connects one output terminal to one of two input terminals according to the j-th flag EFj .</p> |
