Examining the developments in scheduling algorithms research: A bibliometric approach. [PDF]
Heliyon, 2022 Omotehinwa TO.
europepmc +2 more sources
Genetic algorithm based DSP multiprocessor scheduling [PDF]
, 1996 This paper presents recent work on the application of genetic algorithms to the NP-complete problem of multiprocessor scheduling for audio DSP algorithms.
Amphlett, RW, Bull, DR
core +2 more sources
A comparison of classical scheduling approaches in power-constrained block-test scheduling [PDF]
, 2000 Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned ...
Muresan, Valentin +3 more
core +1 more source
Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment [PDF]
Journal of Computer Networks and Communications, 2008 Distributed computing systems [DCSs] offer the potential for improved performance and resource sharing. To make the best use of the computational power available, it is essential to assign the tasks dynamically to that processor whose characteristics are most appropriate for the execution of the tasks in distributed processing system. We have developed
Pradeep Kumar Yadav +2 more
openaire +2 more sources
Dynamic Multi Threshold Priority Packet Scheduling Algorithms
MATEC Web of Conferences, 2016 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 +1 more source
IET Networks, 2021 In this manuscript, an upgraded Fruit Fly Optimization Algorithm (FFOA) is proposed for optimising task scheduling and resource management processes. The proposed FOA algorithm is utilized to address the issues.
K. Loheswaran
doaj +1 more source
Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times – A polymatroid optimization approach [PDF]
, 2008 We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost.
A. Federgruen +20 more
core +1 more source
Special Issue on Exact and Heuristic Scheduling Algorithms
Algorithms, 2019 This special issue of Algorithms is a follow-up issue of an earlier one, entitled ‘Algorithms for Scheduling Problems’. In particular, the new issue is devoted to the development of exact and heuristic scheduling algorithms.
Frank Werner +2 more
doaj +1 more source
Improved Elastic Scheduling Algorithms for Implicit-Deadline Tasks [PDF]
Leibniz Transactions on Embedded SystemsElastic scheduling provides a framework under which the utilizations of recurrent tasks are reduced by increasing their periods in response to system overload. The original elastic scheduling model was proposed by Buttazzo et al.
Sudvarg, Marion +2 more
doaj +1 more source
A combined tree growing technique for block-test scheduling under power constraints [PDF]
, 2001 A tree growing technique is used here together with classical scheduling algorithms in order to improve the test concurrency having assigned power dissipation limits.
Muresan, Valentin +3 more
core +1 more source