Data scheduling algorithm of P2P streaming media

2013 ◽  
Vol 32 (4) ◽  
pp. 935-937
Author(s):  
Yuan-wei GUO ◽  
Xue-mei XU ◽  
Jian-yang ZHANG ◽  
Zheng-yu HUANG ◽  
Lan NI



2011 ◽  
Vol 267 ◽  
pp. 543-548
Author(s):  
You Ju Song ◽  
Rui Chun Tang ◽  
Guang Xu

Research P2P streaming media scheduling algorithm. Aim at how to make sure that the smaller number data blocks reach priorly, propose an evaluated priority based P2P streaming media scheduling algorithm(EPBSMSA). The algorithm calculates the data block priority according to its rarity, urgency and transmission time. Simulation proves that the algorithm is effective.





2009 ◽  
Vol 29 (9) ◽  
pp. 2442-2445
Author(s):  
Heng-long FAN ◽  
Lian-fu JIN


Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine

The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed algorithm is based on static scheduling that allows to include the dependencies and the execution cost of tasks and data dependencies in its scheduling decisions. Our scheduling algorithm is dedicated to multi-bus heterogeneous architectures with multiple processors linked by several shared buses. This scheduling algorithm is considering only one bus fault caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies to minimize the scheduling length of data on buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks. The experimental results show the effectiveness of our technique.



Sign in / Sign up

Export Citation Format

Share Document