Optimal data scheduling for uniform multidimensional applications

1996 ◽  
Vol 45 (12) ◽  
pp. 1439-1444 ◽  
Author(s):  
Qingyan Wang ◽  
N.L. Passos ◽  
Edwin Hsing-Mean Sha
Keyword(s):  
Data Scheduling

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
Keyword(s):  
Streaming Media ◽  
Scheduling Algorithm ◽  
P2p Streaming ◽  
Data Scheduling

scholarly journals On Energy Allocation and Data Scheduling in Backscatter Networks with Multi-antenna Readers

2021 ◽  
pp. 1-1
Author(s):  
Mohammad Movahednasab ◽  
Mohammad Reza Pakravan ◽  
Behrooz Makki ◽  
Tommy Svensson
Keyword(s):  
Energy Allocation ◽  
Data Scheduling

A dynamic priority strategy for IoV data scheduling towards key data

2020 ◽  
Author(s):  
Chenxi Huang ◽  
Hao Wang ◽  
Dong Guo ◽  
Guokai Zhang ◽  
Gaowei Xu ◽  
...  
Keyword(s):  
Data Scheduling ◽  
Dynamic Priority

Hybrid Software Redundancy Approach for Building Reliable Communication in Multi-BUS Heterogeneous Systems

2016 ◽  
Vol 23 (04) ◽  
pp. 1650013
Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine
Keyword(s):  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
Reliable Communication ◽  
Data Dependencies ◽  
Data Scheduling ◽  
Static Scheduling ◽  
Heterogeneous Architectures ◽  
Multiple Processors ◽  
Hardware Faults

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.

Cost-efficient and Skew-aware Data Scheduling for Incremental Learning in 5G Networks

2021 ◽  
pp. 1-1
Author(s):  
Lingjun Pu ◽  
Xinjing Yuan ◽  
Xiaohang Xu ◽  
Xu Chen ◽  
Pan Zhou ◽  
...  
Keyword(s):  
Incremental Learning ◽  
5G Networks ◽  
Data Scheduling ◽  
Cost Efficient

scholarly journals An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation

2016 ◽  
Vol 16 (2) ◽  
pp. 69-84
Author(s):  
Chafik Arar ◽  
Mohamed Salah Khireddine
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Experimental Results ◽  
Data Scheduling ◽  
Heterogeneous Architectures ◽  
Hardware Faults

Abstract The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, 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, this paper evaluates the proposed methods in terms of data scheduling length for a set of DAG benchmarks. The experimental results show the effectiveness of our technique.

Sign in / Sign up

Export Citation Format

Share Document