An LP-Based Algorithm for Scheduling Preemptive and/or Non-Preemptive Real-Time Tasks
We consider a real-time system that requires the time stimuli to the system are processed through sequences of tasks to be within specified upper bounds, where the set of tasks can be the mixture of preemptive and non-preemptive tasks, and we propose an algorithm to design a static priority scheduli...
Main Authors: | Hideki HASHIMOTO, Mutsunori YAGIURA |
---|---|
Format: | Article |
Language: | English |
Published: |
The Japan Society of Mechanical Engineers
2010-06-01
|
Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
Subjects: | |
Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/4/3/4_3_578/_pdf/-char/en |
Similar Items
-
Solving Restricted Preemptive Scheduling on Parallel Machines with SAT and PMS
by: Xiaojuan Liao, et al.
Published: (2023-08-01) -
Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints
by: He Cheng, et al.
Published: (2014-02-01) -
Preemptive Zone Reset Design within Zoned Namespace SSD Firmware
by: Siu Jung, et al.
Published: (2023-02-01) -
Multi-Robot Preemptive Task Scheduling with Fault Recovery: A Novel Approach to Automatic Logistics of Smart Factories
by: Vivian Cremer Kalempa, et al.
Published: (2021-09-01) -
Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach
by: Swati Lipsa, et al.
Published: (2023-01-01)