Real-time semi-partitioned scheduling of fork-join tasks using work-stealing
نویسندگان
چکیده
منابع مشابه
Real-time semi-partitioned scheduling of fork-join tasks using work-stealing
This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks using work-stealing, 2015) where we address the semi-partitioned scheduling of real-time fork-join tasks on multicore platforms. The proposed approach consists of two phases: an offline phase where we adopt a multi-frame task model to perform the task-to-core mapping so as to improve the schedul...
متن کاملSemi-Partitioned Scheduling for Resource-Sharing Hard-Real-Time Tasks
As real-time embedded systems integrate more and more functionality, they are demanding increasing amounts of computational power that can only be met by deploying them on powerful multi-core architectures. Efficient task allocation and scheduling on such architectures is paramount. Multicore scheduling algorithms for independent real-time tasks has been the focus of much research over the year...
متن کاملOnline Semi-Partitioned Multiprocessor Scheduling of Soft Real-Time Periodic Tasks for QoS Optimization
In this paper, we propose a novel semipartitioning approach with an online choice of two approximation algorithms, Greedy and Load-Balancing, to schedule periodic soft real-time tasks in homogeneous multiprocessor systems. Our objective is to enhance the QoS by minimizing the deadline misses and maximizing the total reward or benefit obtained by completed tasks in minimum response time. Many re...
متن کاملResponse-Time Analysis of Fork/Join Tasks in Multiprocessor Systems
This paper proposes a model to analyse the response-time of parallel real-time tasks. The presented model is based on the fork/join model which is internally used by userlevel frameworks to exploit the parallelism provided by the underlying architecture. The model considers tasks with fixed priorities and allows real-time jobs to generate an arbitrary number of parallel threads. Each parallel t...
متن کاملTowards Holistic Analysis for Fork-Join Parallel/Distributed Real-Time Tasks
Parallel/distributed processing is a solution for providing scaling computing power for computational-intensive applications. Parallel/distributed applications are commonly based on the fork-join model, where precedence constraints have to be considered on the development of an adequate timing analysis. Moreover, as the main difference with multicore architectures, distributed systems entail th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Embedded Systems
سال: 2017
ISSN: 1687-3963
DOI: 10.1186/s13639-017-0079-5