Dynamic adjustment of execution order in real-time databases

2004 ◽  
Author(s):  
Yongyan Wang ◽  
Qiang Wang ◽  
Hongan Wang ◽  
Guozhong Dai
Keyword(s):  
Real Time ◽  
Dynamic Adjustment ◽  
Execution Order

scholarly journals A Packet Scheduling Method Based on Dynamic Adjustment of Service Priority for Electric Power Wireless Communication Network

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Bo Hu ◽  
Xin Liu ◽  
Jinghong Zhao ◽  
Siya Xu ◽  
Zhenjiang Lei ◽  
...  
Keyword(s):  
Communication Network ◽  
Electric Power ◽  
Real Time ◽  
Resource Utilization ◽  
Packet Scheduling ◽  
Dynamic Adjustment ◽  
Communication Services ◽  
Network Bandwidth ◽  
Scheduling Method ◽  
Service Priority

With the development of the energy Internet, power communication services are heterogeneous, and different power communication services have different business priorities. The power communication services with different priorities have different requirements for network bandwidth and real-time performance. For traditional unified service, a scheduling method cannot meet these service requirements at the same time, and electric power communication network cannot guarantee the quality of service. Therefore, how to make full use of the time-varying characteristics of communication resources to meet the business needs of different priorities and achieve the goals of high resource utilization and transmission quality has become one of the urgent problems in the power communication network. For this reason, in order to adapt to the real-time congestion of the network, we have designed a packet scheduling method based on the dynamic adjustment of service priority, which dynamically adjusts the priority of the power service on the node; in addition, an evaluation method for the trust value of wireless forwarding nodes is introduced to improve the security of data transmission; and finally, we valuate the channel quality to establish a reasonable and efficient packet scheduling mechanism for services of different priorities. Simulation results show that this method improves the communication performance of high-priority services and improves the spectrum resource utilization of the entire system.

GENETIC ALGORITHM WITH TWO OBJECTIVE FOR REAL-TIME TASK SCHEDULING WITH COMMUNICATION TIME

2018 ◽  
Vol 6 (1) ◽  
pp. 14-17
Author(s):  
Myungryun Yoo ◽  
Takanori Yokoyama
Keyword(s):  
Real Time ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Multiprocessor System ◽  
Time Task ◽  
Communication Time ◽  
Adaptive Weight ◽  
Np Hard Problem ◽  
Heuristics Algorithm ◽  
Execution Order

Purpose of the study:The real-time task scheduling on multiprocessor system is known as an NP-hard problem. This paper proposes a new real-time task scheduling algorithmwhich considers the communication time between processors and the execution order between tasks. Methodology:Genetic Algorithm (GA)with Adaptive Weight Approach (AWA) is used in our approach. Main Findings:Our approach has two objectives. The first objective is to minimize the total amount of deadline-miss. And the second objective is to minimize the total number of processors used. Applications of this study:For two objectives,the range of each objective is readjusted through Adaptive Weight Approach (AWA) and more useful result is obtained. Novelty/Originality of this study:This study never been done before.This study also wasprovided current information about scheduling algorithm and heuristics algorithm.

Sign in / Sign up

Export Citation Format

Share Document