本文基于排队理论， 研究多请求源的仲裁机制， 即服务规则。在分析了常用的先来先服务（ＦＣＦＳ）、时间片轮转（Ｒｏｕｎｄ－Ｒｏｂｉｎ） 仲裁机制（服务规则） 的情况下，提出了一种既高效、又便于工程实现的仲裁机制： 批算法优先 Based on queuing theory, this paper studies the arbitration mechanism of multiple request sources, namely service rules. After analyzing the commonly used first-come-first-served (FCFS) and round-robin arbitration mechanisms (service rules), this paper proposes an efficient and easy-to-implement arbitration mechanism: batch algorithm has priority