Comparison of Real Time Task Scheduling Algorithms
نویسندگان
چکیده
منابع مشابه
Simulation of hierarchical real-time task scheduling algorithms using DGridSim
Real-time Data Grid applications are emerging in many disciplines of science and engineering. In order to run these applications while meeting the real-time constraints associated with them, the Data Grid infrastructure should be designed to respect these constraints and allocate its computing, networking, storage, and the other resources accordingly. In this study, a process oriented and discr...
متن کاملReal-Time Scheduling Algorithms
Real-time systems play an important role in our modern society. They are used in critical control systems that rely on timely response and computed results to function properly. This paper summarizes to an extent the state of real-time systems in the area of scheduling. A vast amount of work that has been done in the area of real-time scheduling by both the operations research and the computer ...
متن کامل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...
متن کاملINVERTA – Specification of Real-Time Scheduling Algorithms
1 Faculty of Automation and Computers, Dept. of Computer and Software Engineering Bd. V. Parvan 2, 300223 Timisoara, Romania, e-mail [email protected] 2 Faculty of Automation and Computers, Dept. of Computer and Software Engineering Bd. V. Parvan 2, 300223 Timisoara, Romania, e-mail [email protected] 3 Faculty of Automation and Computers, Dept. of Computer and Software Engineering Bd...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2017
ISSN: 0975-8887
DOI: 10.5120/ijca2017912832