公开(公告)号：US06580719B1

公开(公告)日：2003-06-17

申请号：US09297854

申请日：1999-05-06

申请人： Marianna Soboleva ,  Sergej Makevev ,  Andrey Artamonov ,  Richard Soja

发明人： Marianna Soboleva ,  Sergej Makevev ,  Andrey Artamonov ,  Richard Soja

IPC分类号： H04L1228

CPC分类号： G06F13/362

摘要： In a method for determining a worst case service latency, first a number of accesses granted to requesting channels during the worst case service latency is determined. Therefore, the ordered list of priorities and the priority passing rules of a scheduler of the queuing system is taken into consideration so that an accurate number of access requests during the worst case service latency results. According to the number of access requests, states are selected for the different requesting channels so that the sum of the state execution times reaches a maximum according to the applicable priority passing rules. This method can be implemented by a computer program and can be advantageously used for design of an apparatus which incorporates a queuing system, such as in automobile electronics.

摘要翻译： 在用于确定最坏情况的服务等待时间的方法中，首先确定在最坏情况的服务等待时间期间授予请求信道的许多访问。 因此，考虑到排队系统的调度器的优先顺序列表和优先级传递规则，使得在最坏情况下的服务等待时间内的准确数量的访问请求结果。 根据访问请求的数量，针对不同的请求信道选择状态，使得根据适用的优先级传递规则，状态执行时间的总和达到最大值。 该方法可以通过计算机程序来实现，并且可以有利地用于设计包括诸如汽车电子设备中的排队系统的装置。