This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class wi...This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class with exhaustive service discipline, and the other with gated service discipline. Using iterative method, we have developed an approximation method to obtain the mean waiting time for each message class. The performance of approximation has been compared with the simulation results. The expression for the upper bound of waiting time is given too.展开更多
Story time and narrative time are two interrelated issues in the research of drama.In Waiting for Godot,mere explorations in the perplexing systems of story time cannot pin down the signifieds of time,while incontigui...Story time and narrative time are two interrelated issues in the research of drama.In Waiting for Godot,mere explorations in the perplexing systems of story time cannot pin down the signifieds of time,while incontiguity and quiescency of narrative time highlight the theme“Existence of time is meaningless”.The contradictory and paradoxical co-existence of story time and narrative time contributes to the construing“the void of ambiguous signifieds”and“the void of ambiguous signifiers”of time as blank signs.展开更多
片上网络(Network on Chip,NoC)通过仲裁机制控制各个端口间的数据交换。经典的RR(Round-Robin)算法保障了各端口间的公平性,但却难以为时延敏感业务提供具有低数据交换等待时延的QoS保障。为此,提出一种区分优先级并行调度RR(PP-RR)算...片上网络(Network on Chip,NoC)通过仲裁机制控制各个端口间的数据交换。经典的RR(Round-Robin)算法保障了各端口间的公平性,但却难以为时延敏感业务提供具有低数据交换等待时延的QoS保障。为此,提出一种区分优先级并行调度RR(PP-RR)算法,其根据端口数据负载提供区分优先级服务,高优先级端口数据享有更多仲裁成功机会。采用并行调度两级轮控制模型实现了对PP-RR仲裁算法的数学建模,获得了时延性能的数学解析。展开更多
基金Supported by the High Technology Research and Development Program of China（2002AA412010-08） and the National Natural Science Foundation of China（60474031）.
文摘This paper considers a novel polling system with two classes of message which can experience an up-per bounded time before being served. The station serves these two classes with mixed service discipline, one class with exhaustive service discipline, and the other with gated service discipline. Using iterative method, we have developed an approximation method to obtain the mean waiting time for each message class. The performance of approximation has been compared with the simulation results. The expression for the upper bound of waiting time is given too.
文摘Story time and narrative time are two interrelated issues in the research of drama.In Waiting for Godot,mere explorations in the perplexing systems of story time cannot pin down the signifieds of time,while incontiguity and quiescency of narrative time highlight the theme“Existence of time is meaningless”.The contradictory and paradoxical co-existence of story time and narrative time contributes to the construing“the void of ambiguous signifieds”and“the void of ambiguous signifiers”of time as blank signs.
文摘片上网络(Network on Chip,NoC)通过仲裁机制控制各个端口间的数据交换。经典的RR(Round-Robin)算法保障了各端口间的公平性,但却难以为时延敏感业务提供具有低数据交换等待时延的QoS保障。为此,提出一种区分优先级并行调度RR(PP-RR)算法,其根据端口数据负载提供区分优先级服务,高优先级端口数据享有更多仲裁成功机会。采用并行调度两级轮控制模型实现了对PP-RR仲裁算法的数学建模,获得了时延性能的数学解析。
