A resource synchronization protocol for dynamic scheduling real-time CORBA

2003 ◽  
Author(s):  
Chen Zhang ◽  
D. Cordes
Keyword(s):  
Real Time ◽  
Dynamic Scheduling ◽  
Resource Synchronization ◽  
Synchronization Protocol

scholarly journals A Real-Time, Automatic, and Dynamic Scheduling and Control System for PET Patients Based on Wearable Sensors

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1104
Author(s):  
Shin-Yan Chiou ◽  
Kun-Ju Lin ◽  
Ya-Xin Dong
Keyword(s):  
Control System ◽  
Real Time ◽  
Human Error ◽  
Dynamic Scheduling ◽  
Wearable Sensors ◽  
Time Data ◽  
Scan Time ◽  
Number Of Patients ◽  
And Control ◽  
Automatic Scheduling

Positron emission tomography (PET) is one of the commonly used scanning techniques. Medical staff manually calculate the estimated scan time for each PET device. However, the number of PET scanning devices is small, the number of patients is large, and there are many changes including rescanning requirements, which makes it very error-prone, puts pressure on staff, and causes trouble for patients and their families. Although previous studies proposed algorithms for specific inspections, there is currently no research on improving the PET process. This paper proposes a real-time automatic scheduling and control system for PET patients with wearable sensors. The system can automatically schedule, estimate and instantly update the time of various tasks, and automatically allocate beds and announce schedule information in real time. We implemented this system, collected time data of 200 actual patients, and put these data into the implementation program for simulation and comparison. The average time difference between manual and automatic scheduling was 7.32 min, and it could reduce the average examination time of 82% of patients by 6.14 ± 4.61 min. This convinces us the system is correct and can improve time efficiency, while avoiding human error and staff pressure, and avoiding trouble for patients and their families.

ACO Based Dynamic Scheduling Algorithm for Real-Time Multiprocessor Systems

2013 ◽  
pp. 85-96
Author(s):  
Apurva Shah ◽  
Ketan Kotecha
Keyword(s):  
Real Time ◽  
Computational Models ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Multiprocessor Systems ◽  
Individual Agent ◽  
Collective Foraging ◽  
Time Systems ◽  
Earliest Deadline

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.

scholarly journals Dynamic Soft Real-Time Scheduling with Preemption Threshold for Streaming Media

2019 ◽  
Vol 2019 ◽  
pp. 1-7 ◽  
Author(s):  
Wenle Wang ◽  
Yuan Wang ◽  
JiangYan Dai ◽  
Zhonghua Cao
Keyword(s):  
Real Time ◽  
Video Streaming ◽  
Dynamic Scheduling ◽  
Threshold Strategy ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Simulation Results ◽  
Relationship Of ◽  
Networking Technology ◽  
Efficient Video

Over the last decades, the advancements in networking technology and new multimedia devices have motivated the research on efficient video streaming mechanisms under wireless. We consider combing soft real-time video streaming scheduling with threshold to minimize the ineffective preemption. Based on the value density and urgency of soft real-time task, the dynamic scheduling with preemption threshold strategy (DSPT) is proposed in the paper. By analyzing the response time and preemption relationship of tasks, the preemption thresholds are assigned. Simulation results show that the DSPT strategy achieves improvements about success rate, delay time, and benefit of the system.

Sign in / Sign up

Export Citation Format

Share Document