A Data Scheduling Algorithm Based on Link Distance in Directional Aviation Relay Network

2021 ◽  
pp. 426-440
Author(s):  
Weiling Zhou ◽  
Bo Li ◽  
Zhongjiang Yan ◽  
Mao Yang
Keyword(s):  
Scheduling Algorithm ◽  
Relay Network ◽  
Data Scheduling ◽  
Link Distance

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

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.

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.

Superposed Redundancy Approach for Building Reliable Communication in Multi-Bus Heterogeneous Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 1-21
Author(s):  
Chafik Arar
Keyword(s):  
Fault Tolerant ◽  
Scheduling Algorithm ◽  
Heterogeneous Systems ◽  
List Scheduling ◽  
Reliable Communication ◽  
Data Scheduling ◽  
New Variant ◽  
Hardware Faults

In this article, the author uses a new variant of passive redundancy, which allows for a fictitious dual assignment by simultaneously scheduling two backup copies that overlap on the same communication bus at a given time. The proposed reliable fault tolerant greedy list scheduling algorithm is based on a superposed backup copy. This scheduling algorithm is considering up to n communication buses faults, caused by hardware faults and compensated by software redundancy solutions. it allows a reliable communication and efficient use of buses. In the experiments, the proposed methods are evaluated in terms of data scheduling length for a set of DSP benchmarks from the DSPstone.

scholarly journals Optimized Spatiotemporal Data Scheduling Based on Maximum Flow for Multilevel Visualization Tasks

2020 ◽  
Vol 9 (9) ◽  
pp. 518
Author(s):  
Qing Zhu ◽  
Meite Chen ◽  
Bin Feng ◽  
Yan Zhou ◽  
Maosu Li ◽  
...  
Keyword(s):  
Flow Model ◽  
Data Flow ◽  
Scheduling Algorithm ◽  
Maximum Flow ◽  
Data Access ◽  
Spatiotemporal Data ◽  
Cloud Environment ◽  
Calculation Algorithm ◽  
Data Scheduling ◽  
First Come First Serve

Massive spatiotemporal data scheduling in a cloud environment play a significant role in real-time visualization. Existing methods focus on preloading, prefetching, multithread processing and multilevel cache collaboration, which waste hardware resources and cannot fully meet the different scheduling requirements of diversified tasks. This paper proposes an optimized spatiotemporal data scheduling method based on maximum flow for multilevel visualization tasks. First, the spatiotemporal data scheduling framework is designed based on the analysis of three levels of visualization tasks. Second, the maximum flow model is introduced to construct the spatiotemporal data scheduling topological network, and the calculation algorithm of the maximum data flow is presented in detail. Third, according to the change in the data access hotspot, the adaptive caching algorithm and maximum flow model parameter switching strategy are devised to achieve task-driven spatiotemporal data optimization scheduling. Compared with two typical methods of first come first serve (FCFS) and priority scheduling algorithm (PSA) by simulating visualization tasks at three levels, the proposed maximum flow scheduling (MFS) method has been proven to be more flexible and efficient in adjusting each spatiotemporal data flow type as needed, and the method realizes spatiotemporal data flow global optimization under limited hardware resources in the cloud environment.

scholarly journals Improvising Reliability and Security in Multiple Relay Network using Optimal Scheduling

2019 ◽  
Vol 8 (2) ◽  
pp. 1243-1248
Keyword(s):  
Real Time ◽  
Random Network ◽  
Scheduling Algorithm ◽  
Data Communication ◽  
Attack Detection ◽  
Relay Network ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Priority Scheduling ◽  
Byzantine Attacks

In the real-time scenario involving wireless sensor networks, the data forwarding and data gathering procedures are taking place from the remote environment. With the involvement of heterogeneous architecture and multi-hop data transmission paths, there lies a serious threat for secured data communication. There may be chances of data attacks either from the inside intruder or from the external intruder. The problem of data flow attack by adding malicious information, viz. Data injection attack and outside arbitrary attack, viz. Byzantine attacks are found to be more dangerous and cause vulnerability for the wireless sensor network. So improving the reliability and security in multi-relay networks is very much essential. In this work, the practical approach of detecting data injection and Byzantine attacks using the proposed method of random network coding is performed. Then, as improvisation measure, the priority scheduling algorithm is implemented to effectively schedule the data transfer. Real-time packets with highest priority in the distribution queue are placed first in the processing mechanism. The remaining packets are arranged based on the position of the sensor nodes and are placed in separate queues. Least priority packets can obstruct the dispensation of their direct higher precedence packets after waitlisted for a certain number of time frames. Simulation results using the NS2 environment show that using the priority scheduling algorithm has good performance values in terms of the packet delivery ratio, throughput and delay. Also, the attack detection metrics such as false positive ratio and detection ratio are also improved when using the priority scheduling algorithm. Thus an improvised priority algorithm for an uplink scheduler in WSN is implemented to increase the performance and detection metrics.

Sign in / Sign up

Export Citation Format

Share Document