Results 221 to 230 of about 156,709 (282)

Energy efficient task scheduling for heterogeneous multicore processors in edge computing. [PDF]

Sci Rep
Liu Y, Qu H, Chen S, Feng X.
europepmc   +1 more source

Scalable hybrid framework for real time and non real time task scheduling in fog computing using federated reinforcement learning and PSO GA. [PDF]

Sci Rep
Liu F, Liu Z, Liu X, Zhou H.
europepmc   +1 more source

A Distributed Space Target Constellation Task Planning Method Based on Adaptive Genetic Algorithm. [PDF]

Sensors (Basel)
Hu Q, Guo J, Liu D.
europepmc   +1 more source

Load balancing for cloud computing using optimized cluster based federated learning. [PDF]

Sci Rep
Chennam KK, V UM, Aluvalu R, Chinthaginjala R, AbWahab M, Zhao X, Tolba A.   +6 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Alternative priority scheduling in dynamic priority systems

Proceedings of ICECCS '96: 2nd IEEE International Conference on Engineering of Complex Computer Systems (held jointly with 6th CSESAW and 4th IEEE RTAW), 2002
The major drawback of the slack-stealing based schedulings for aperiodic requests is a high computational complexity to calculate the slack which in consequence makes them not be practical. In this paper, we present a soft-aperiodic task scheduling algorithm, called Alternative Priority Scheduling (APS), which has a simple slack calculation method in ...
null Hyungill Kim, null Sungyoung Lee, null Jongwon Lee   +2 more
openaire   +1 more source

Scheduling aperiodic tasks in dynamic priority systems

Real-Time Systems, 1996
In this paper we present five new on-line algorithms for servicing soft aperiodic requests in realtime systems, where a set of hard periodic tasks is scheduled using the Earliest Deadline First (EDF) algorithm. All the proposed solutions can achieve full processor utilization and enhance aperiodic responsiveness, still guaranteeing the execution of the
BUTTAZZO, Giorgio Carlo, M. Spuri
openaire   +2 more sources

QoS using delay-synchronized dynamic priority scheduling

Proceedings. Sixth IEEE Symposium on Computers and Communications, 2002
Controlled-load service that provides acceptable quality of service to adaptive real-time applications without making absolute guarantee is extensively considered, owing to its higher resource utilization than guaranteed service. Enhancement of utilization strongly relies on traffic scheduling method adaptable to a varying traffic load, and admission ...
K. Siriwong, R. Ammar
openaire   +1 more source

Optimal aperiodic scheduling for dynamic-priority systems

Proceedings of 3rd International Workshop on Real-Time Computing Systems and Applications, 2002
This paper addresses the problem of jointly scheduling tasks with both hard and soft real-time constraints. We present a new on-line aperiodic admission algorithm to be used with on optimal dynamic priority preemptive scheduler, such as the Earliest Deadline First (EDF) or the Least Laxity First (LLF).
I. Ripoll, A. Garcia-Fornes, A. Crespo
openaire   +1 more source

Improving fixed priority schedulability with dynamic priority as secondary criterion

Journal of Embedded Computing, 2006
In this paper, we focus on a non-preemptive scheduling, combining fixed priorities and dynamic priorities on a uniprocessor. This scheduling is called FP/DP. Results presented in this paper can be applied indifferently to tasks and flows. With any flow are associated a fixed priority denoting the importance degree of the flow and a temporal parameter,
Steven Martin, Pascale Minet, Laurent George   +2 more
openaire   +1 more source