dispatch policy
Recently Published Documents


TOTAL DOCUMENTS

13
(FIVE YEARS 1)

H-INDEX

5
(FIVE YEARS 0)

2016 ◽  
Vol 36 (3) ◽  
pp. 399-419
Author(s):  
Xun Li ◽  
◽  
Cem Saydam

2013 ◽  
Vol 380-384 ◽  
pp. 3366-3369
Author(s):  
Yi Kai ◽  
Bin Liu

In this paper, we present a new traffic dispatch policy for a power-aware router, which was named GreenRouter and was proposed in our previous publication [. Packet processing capacities, mainly including IP lookup and forwarding engines, are shared and modulated according to traffic loads, unoccupied capacities are powered off in order to save power. A flow based traffic dispatch policy was proposed to allocate traffic from network interfaces to processing engines dynamically. Significant power saving has been achieved while QoS constrains have been satisfied. We present a new packet-based dispatch policy for GreenRouter in this paper, which can achieve more power saving. Reordering is adopted to avoid out-of-order delivery.


2013 ◽  
Vol 5 (2) ◽  
pp. 167-182 ◽  
Author(s):  
Kim Tae-hyung
Keyword(s):  

Author(s):  
Hong Wang ◽  
Yoshitomo Murata ◽  
Hiroyuki Takizawa ◽  
Hiroaki Kobayashi

On the volunteer computing platforms, inter-task dependency leads to serious performance degradation for failed task re-execution because of volatile peers. This paper discusses a performance-oriented task dispatch policy based on the failure probability estimation. The tasks with the highest failure probabilities are selected for dispatch when multiple task enquiries come to the dispatcher. The estimated failure probability is used to find the optimized task assignment that minimizes the overall failure probability of these tasks. This performance-oriented task dispatch policy is evaluated with two real world trace data sets on a simulator. Evaluation results demonstrate the effectiveness of this policy.


2010 ◽  
Vol 37 (3) ◽  
pp. 2451-2458 ◽  
Author(s):  
Michael von Massow ◽  
Mustafa S. Canbolat

Sign in / Sign up

Export Citation Format

Share Document