Dynamic Multi Threshold Priority Packet Scheduling Algorithms
Packet scheduling algorithms are developed in order to use shared transmission resources efficiently. Various application packets such as real and non-real time packets might have different QoS requirements and traditional scheduling algorithms might be ...
Dag Tamer, Uzungenc Sezer
doaj +4 more sources
Efficiency-Oriented Production Scheduling Scheme: An Ant Colony System Method
During the real production system, the scheduling scheme change is mostly changed by dynamic events or new tasks. Due to the different urgency degrees of dynamic events, the corresponding scheduling methods should be adopted to ensure the production ...
Yi Wan +4 more
doaj +1 more source
Priority Auctions and Queue Disciplines that Depend on Processing Time [PDF]
Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing ...
Thomas Kittsteiner +3 more
core +2 more sources
Robust aperiodic scheduling under dynamic priority systems [PDF]
When hard periodic and firm aperiodic tasks are jointly scheduled in the same system, the processor workload can vary according to the arrival times of aperiodic requests. In order to guarantee the schedulability of the periodic task set, in overload conditions some aperiodic tasks must be rejected.
Marco Spuri +2 more
openaire +2 more sources
Performance-based dynamic scheduling of hybrid real-time applications on a cluster of heterogeneous workstations [PDF]
It is assumed in this paper that periodic real-time applications are being run on a cluster of heterogeneous workstations, and new non-periodic real-time applications arrive at the system dynamically.
Nudd, G. R. +9 more
core +1 more source
Node Priority Scheduling Strategy Based on Heterogeneous Flink Cluster [PDF]
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
Dynamic, capability-driven scheduling of DAG-based real-time jobs in heterogeneous cluster [PDF]
In this research a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs, modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically.
Nudd, G. R. +9 more
core +1 more source
Dynamic scheduling of parallel real-time jobs by modelling spare capabilities in heterogeneous clusters [PDF]
In this research, a scenario is assumed where periodic real-time jobs are being run on a heterogeneous cluster of computers, and new aperiodic parallel real-time jobs' modelled by Directed Acyclic Graphs (DAG), arrive at the system dynamically.
Nudd, G. R. +9 more
core +1 more source
Research on Task Priority Model and Algorithm for Satellite Scheduling Problem
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]
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

