Results 11 to 20 of about 156,709 (282)
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
Human activity modeling and Barabasi's queueing systems [PDF]
, 2006 It has been shown by A.-L. Barabasi that the priority based scheduling rules in single stage queuing systems (QS) generates fat tail behavior for the tasks waiting time distributions (WTD). Such fat tails are due to the waiting times of very low priority
F. Brauer +4 more
core +2 more sources
Un ordonnancement dynamique de tâches stochastiques sur un seul processeur [PDF]
, 2002 We show that a particular dynamic priority given to jobs in a multitasks operating system of computers is a deteriorating jobs or a delaying jobs scheduling. Under some assumptions we also show that it is an index rule.
Derbala, Ali
core +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
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
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
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