Results 11 to 20 of about 7,611 (258)
DYNAMIC HW PRIORITY QUEUE BASED SCHEDULERS FOR EMBEDDED SYSTEM
International Journal of Embedded Systems and Applications, 2015 A real-time operating system (RTOs) is often used in embedded system, to structure the application code and to ensure that the deadlines are met by reacting on events by executing the functions within precise time. Most embedded systems are bound to real-time constraints with determinism and latency as a critical metrics. RTOs are generally implemented
Dinesh G Harkut, Ali M.S
+4 more sources
Node Priority Scheduling Strategy Based on Heterogeneous Flink Cluster [PDF]
Jisuanji gongcheng, 2022 The default task scheduling strategy of the Flink stream processing system ignores the cluster heterogeneity and available resources of nodes to a certain extent, resulting in an unbalanced overall cluster load.This study investigates the real-time ...
WANG Wenhao, SHI Xuerong
doaj +1 more source
Sensors, 2019 Emergency observations are missions executed by Earth observation satellites to support urgent ground operations. Emergency observations become more important for meeting the requirements of highly dynamic and highly time-sensitive observation missions ...
Jintian Cui, Xin Zhang
doaj +1 more source
Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort
IEEE Access, 2019 The earliest deadline first (EDF) scheduling algorithm is a typical representative of the dynamic priority scheduling algorithm. However, once the system is overloaded, the deadline miss rate increases and the scheduling performance deteriorates sharply,
Shanshan Meng, Qiang Zhu, Fei Xia
doaj +1 more source
Research on Task Priority Model and Algorithm for Satellite Scheduling Problem
IEEE Access, 2019 In satellite scheduling system, one of the most important issues is task scheduling. Most of the existing algorithms focused on the scenario of normal tasks with fixed priority and don’t consider emergency tasks.
Jian Wu +3 more
doaj +1 more source
M2M Uplink Priority Scheduling Algorithm Based on Dynamic Grouping [PDF]
Jisuanji gongcheng, 2019 Based on the Delay Tolerance Remaining Time(DTRT),an uplink priority scheduling algorithm for dynamic grouping of traffic is proposed.A Resource Block(RB) allocation method with variable size is adopted to satisfy the adjacency constraints of RB,and a ...
JIN Yeqi, XU Youyu, ZHENG Min, TAN Chong, WANG Hong
doaj +1 more source
Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach
IEEE Access, 2023 In this paper, a task scheduling problem for a cloud computing environment is formulated by using the M/M/n queuing model. A priority assignment algorithm is designed to employ a new data structure named the waiting time matrix to assign priority to ...
Swati Lipsa +3 more
doaj +1 more source
Enhancing task execution: a dual-layer approach with multi-queue adaptive priority scheduling [PDF]
PeerJ Computer ScienceEfficient task execution is critical to optimize the usage of computing resources in process scheduling. Various task scheduling algorithms ensure optimized and efficient use of computing resources.
Mansoor Iqbal +5 more
doaj +2 more sources
Advances in Mechanical Engineering, 2020 Roller grinding workshop is a typical multi-unit and multi-task manufacturing scenario, which is aimed to repair the surface damage of the rollers caused by the rolling process, so that the rollers can be reused.
Hanyang Li +5 more
doaj +1 more source
Dynamic Ready Queue Based Process Priority Scheduling Algorithm
, 2022 CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different properties of the system.
Dalmia, Raghav +3 more
openaire +2 more sources