Quantifying the Exact Sub-optimality of Non-preemptive Scheduling [PDF]
2015 IEEE Real-Time Systems Symposium, 2015 Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive Earliest Deadline First (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive
Davis, Robert +4 more
core +13 more sources
Reinforcement learning based multi objective task scheduling for energy efficient and cost effective cloud edge computing. [PDF]
Sci RepThe rapid proliferation of Internet of Things (IoT) devices and latency-sensitive applications has amplified the need for efficient task scheduling in hybrid cloud-edge environments.
Zhang W, Ou H.
europepmc +2 more sources
Optimizing multiprocessor performance in real-time systems using an innovative genetic algorithm approach. [PDF]
Sci RepDue to its enormous influence on system functionality, researchers are presently looking into the issue of task scheduling on multiprocessors. Establishing the most advantageous schedules is often regarded as a difficult-to-compute issue.
Hassan HE, Ibrahiem KH, Madian AH.
europepmc +2 more sources
Intelligent Road Management System for Autonomous, Non-Autonomous, and VIP Vehicles
World Electric Vehicle Journal, 2023 Currently, autonomous vehicles, non-autonomous vehicles, and VIP (emergency) autonomous cars are using intelligent road management techniques to interact with one another and enhance the effectiveness of the traffic system.
Awad Bin Naeem +4 more
doaj +1 more source
Per Processor Spin-Based Protocols for Multiprocessor Real-Time Systems [PDF]
Leibniz Transactions on Embedded Systems, 2017 This paper investigates preemptive spin-based global resource sharing protocols for resource-constrained real-time embedded multi-core systems based on partitioned fixed-priority preemptive scheduling.
Afshar, Sara +3 more
doaj +1 more source
An empirical analysis of exact algorithms for solving non-preemptive flow shop scheduling problem [PDF]
International Journal of Research in Industrial Engineering, 2022 Sequencing and scheduling are the forms of decision-making approach that play a vital role in the automation and services industries. Efficient scheduling can help the industries to achieve the full potential of their supply chains.
Md. Kawsar Ahmed Asif +3 more
doaj +1 more source
On Non-Preemptive VM Scheduling in the Cloud [PDF]
ACM SIGMETRICS Performance Evaluation Review, 2017 We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) for the duration of their service. To avoid costly preemptions, we consider non-preemptive scheduling:
Konstantinos Psychas, Javad Ghaderi
openaire +6 more sources
Domination analysis for scheduling on non preemptive uniformly related machines [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 no ...
Idan Eisner, Alek Vainshtein
doaj +1 more source
Applied Sciences, 2020 In mixed criticality systems (MCSs), the time-triggered scheduling approach focuses on a special case of safety-critical embedded applications which run in a time-triggered environment.
Eugenia Ana Capota +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