Enhanced virtual release advancing algorithm for real-time task scheduling
نویسندگان
چکیده
منابع مشابه
Virtual Real-Time Scheduling
We propose a new approach for the runtime scheduling of real-time workloads. This approach, which we call virtual scheduling, decouples real-time scheduling from the underlying real-time operating system (RTOS) kernel. Such a decoupling provides for the use of scheduling algorithms on an RTOS platform that does not support them natively. This allows new scheduling functionality to be offered to...
متن کاملA Power-Aware, Best-Effort Real-Time Task Scheduling Algorithm
In this paper, we present a power-aware, besteffort real-time task scheduling algorithm called PA-BTA that optimizes real-time performance and power consumption. The algorithm considers a timeliness model where task timing constraints are described using Jensen’s benefit functions and a system-level power model. We propose a metric called “Energy and Real-Time Performance Grade” (ERG) to measur...
متن کاملDynamic Real - Time Task Scheduling
Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention than before. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Meshes and hypercubes belong to this class of multiprocessors. In this paper, we propose...
متن کاملOptimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملReal-Time Scheduling Using Compact Task Graphs
The generation of a real-time schedule from a task precedence graph is complex and time consuming. In order to improve the eeciency of generating schedules, we propose a scheduling algorithm based upon the compact task graph (CTG) representation. In addition to precedence constraints, a CTG explicitly expresses the potential for interleaving the execution of tasks on a single processor and over...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information and Telecommunication
سال: 2018
ISSN: 2475-1839,2475-1847
DOI: 10.1080/24751839.2018.1423789