Non-Preemptive Real-Time Multiprocessor Scheduling Beyond Work-Conserving

Baek, Hyeongboo; Kwak, Jaeheon; Lee, Jin-Kyu

doi:10.1109/rtss49844.2020.00020

Cited by 6 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent work focuses their efforts on developing analysis to determine schedulability of a set of fixed set of periodic tasks over a homogeneous multiprocessor platform: [9], [2]. [9] seeks to bound the worst-case response time of a set of jobs which access shared resources, and a non-work-conserving nonclairvoyant and non-preemptive scheduling framework is proposed in [2], which is able to find feasible schedules for work-conserving-infeasible task sets. Although, they do not consider the constant interaction with users that produces new entry tasks in a system.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Job-shop Scheduling Over a Heterogeneous Platform

Benítez-Pérez

Hermosillo-Gomez²

2021

INT J COMPUT COMMUN, Int. J. Comput. Commun. Control

View full text Add to dashboard Cite

Real-time scheduling involves determining the allocation of platform resources in such a way tasks can meet their temporal restrictions. This work focuses on job-shop tasks model in which a task have a finite number of nonpreemptive different instances (jobs) that share a unique hard deadline and their time requirements are known until task arrival. Non-preemptive scheduling is considered because this characteristic is widely used in industry. Besides job-shop scheduling has direct impacts on the production efficiency and costs of manufacturing systems. So that the development of analysis for tasks with these characteristics is necessary. The aim of this work is to propose an online scheduling test able to guarantee the execution of a new arriving task, which is generated by human interaction with an embedded system, otherwise to discart it. An extension of the schedulability test proposed by Baruah in 2006 for non-preemptive periodic tasks over an identical platform is presented in this paper. Such extension is applied to non-preemptive tasks that have hard deadlines over a heterogeneous platform. To do that, some virtual changes over both the task set and the platform are effectuated.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Not only the number of tasks still the same but also their time computing requirements, during execution 2. There are also other names like coordinated tasks[10] in the literature to name this tasks which, at the same time, are a particular case of DAG tasks…”

mentioning

confidence: 99%